Comparing Refinements for Failure and Bisimulation Semantics

Article type: Research Article

Authors: Eshuis, Rik | Fokkinga, Maarten M.

Affiliations: Department INF, University of Twente, PO Box 217, 7500 AE Enschede, The Netherlands

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 failure 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.

Keywords: refinement, labelled transition systems, bisimulation semantics, failure semantics, decorated traces

Journal: Fundamenta Informaticae, vol. 52, no. 4, pp. 297-321, 2002