Comparing Refinements for Failure and Bisimulation Semantics

H. Eshuis, M.M. Fokkinga

Research output: Contribution to journalArticleAcademicpeer-review

15 Citations (Scopus)

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.
Original languageUndefined
Pages (from-to)297-321
Number of pages25
JournalFundamenta informaticae
Volume52
Issue number4
Publication statusPublished - Oct 2002

Keywords

  • failure semantics
  • decorated traces
  • EWI-6264
  • bisimulation semantics
  • Refinement
  • labelled transition systems
  • IR-63233

Cite this

Eshuis, H., & Fokkinga, M. M. (2002). Comparing Refinements for Failure and Bisimulation Semantics. Fundamenta informaticae, 52(4), 297-321.
Eshuis, H. ; Fokkinga, M.M. / Comparing Refinements for Failure and Bisimulation Semantics. In: Fundamenta informaticae. 2002 ; Vol. 52, No. 4. pp. 297-321.
@article{462b513f89284bde91304f177d0c8b41,
title = "Comparing Refinements for Failure and Bisimulation Semantics",
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 = "failure semantics, decorated traces, EWI-6264, bisimulation semantics, Refinement, labelled transition systems, IR-63233",
author = "H. Eshuis and M.M. Fokkinga",
note = "Imported from EWI/DB PMS [db-utwente:arti:0000002043],",
year = "2002",
month = "10",
language = "Undefined",
volume = "52",
pages = "297--321",
journal = "Fundamenta informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "4",

}

Eshuis, H & Fokkinga, MM 2002, 'Comparing Refinements for Failure and Bisimulation Semantics' Fundamenta informaticae, vol. 52, no. 4, pp. 297-321.

Comparing Refinements for Failure and Bisimulation Semantics. / Eshuis, H.; Fokkinga, M.M.

In: Fundamenta informaticae, Vol. 52, No. 4, 10.2002, p. 297-321.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Comparing Refinements for Failure and Bisimulation Semantics

AU - Eshuis, H.

AU - Fokkinga, M.M.

N1 - Imported from EWI/DB PMS [db-utwente:arti:0000002043],

PY - 2002/10

Y1 - 2002/10

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

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

KW - failure semantics

KW - decorated traces

KW - EWI-6264

KW - bisimulation semantics

KW - Refinement

KW - labelled transition systems

KW - IR-63233

M3 - Article

VL - 52

SP - 297

EP - 321

JO - Fundamenta informaticae

JF - Fundamenta informaticae

SN - 0169-2968

IS - 4

ER -