Comparing Refinements for Failure and Bisimulation Semantics

• Autorzy: Eshuis, R. , Fokkinga, M.M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

refinement; Labelled Transition Systems (LTS); bisimulation semantics; failure semantics; decorated traces

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 52, nr 4
• Strony: 297-321
• Opis fizyczny: bibliogr. 14 poz.

Twórcy

autor

Eshuis, R.

autor

Fokkinga, M.M.

• Department INF, University of Twente, P.O.Box 217, NL-7500 AEEnschede, The Netherlands,