Games for bisimulations and abstraction

David de Frutos Escrig, Jeroen J.A. Keiren, Tim A.C. Willemse

Research output: Contribution to journalArticleAcademic

2 Citations (Scopus)
25 Downloads (Pure)

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-, delay-, η- 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
Article number15
Number of pages40
JournalLogical Methods in Computer Science
Volume13
Issue number4
DOIs
Publication statusPublished - 22 Nov 2017

Keywords

  • Abstraction
  • Behavioural equivalences
  • Bisimulation games
  • Branching bisimulation
  • Divergence

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

  • Cite this