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.
|Publisher||Sociedad Argentina de Informática e Investigacíon Operativa|
|Workshop||Workshop Argentino de Informatica Teorica (WAIT 1999)|
|Period||6/09/99 → 10/09/99|
|Other||6-10 Sep 1999|