Comparing Refinements for Failure and Bisimulation Semantics

Share/Save/Bookmark

Eshuis, Rik and Fokkinga, Maarten M. (1999) Comparing Refinements for Failure and Bisimulation Semantics. In: Workshop Argentino de Informatica Teorica (WAIT 1999), 6-10 Sep 1999, Buenos Aires, Argentina (pp. pp. 65-80).

[img] PDF
Restricted to UT campus only
: Request a copy
167kB
Abstract:Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled transition systems, whereas in failure semantics refinement is based on inclusions between decorated traces systems. There exist however pairs of refinements, for bisimulation and failure semantics respectively, that have almost the same properties. Furthermore, each refinement in bisimulation semantics implies its counterpart in failure semantics, and conversely each refinement in failure semantics implies its counterpart in bisimulation semantics defined on the canonical form of the compared processes.
Item Type:Conference or Workshop Item
Additional information:Imported from EWI/DB PMS [db-utwente:inpr:0000003019], http://www.sadio.org.ar
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63500
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119622