Games for Bisimulations and Abstraction

D. de Frutos Escrig, J.J.A. Keiren, T.A.C. Willemse

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

Weak bisimulations are typically used in process algebras where silent steps are used to abstract from internal behaviours. They facilitate relating implementations to specifications. When an implementation fails to conform to its specification, pinpointing the root cause can be challenging. In this paper we provide a generic characterisation of branching-, delayed-, η- and weak-bisimulation as a game between Spoiler and Duplicator, offering an operational understanding of the relations. We show how such games can be used to assist in diagnosing non-conformance between implementation and specification. Moreover, we show how these games can be extended to distinguish divergences.
Original languageEnglish
Number of pages40
JournalLogical Methods in Computer Science
Volume13
Issue number4
DOIs
Publication statusPublished - 28 Nov 2017

Fingerprint Dive into the research topics of 'Games for Bisimulations and Abstraction'. Together they form a unique fingerprint.

  • Cite this

    de Frutos Escrig, D., Keiren, J. J. A., & Willemse, T. A. C. (2017). Games for Bisimulations and Abstraction. Logical Methods in Computer Science, 13(4). https://doi.org/10.23638/LMCS-13(4:15)2017