Branching Bisimulation Games - Formal Techniques for Distributed Objects, Components, and Systems Access content directly
Conference Papers Year : 2016

Branching Bisimulation Games


Branching bisimilarity and branching bisimilarity with explicit divergences are typically used in process algebras with silent steps when relating implementations to specifications. When an implementation fails to conform to its specification, i.e., when both are not related by branching bisimilarity [with explicit divergence], pinpointing the root causes can be challenging. In this paper, we provide characterisations of branching bisimilarity [with explicit divergence] as games between SPOILER and DUPLICATOR, offering an operational understanding of both relations. Moreover, we show how such games can be used to assist in diagnosing non-conformance between implementation and specification.
Fichier principal
Vignette du fichier
426757_1_En_10_Chapter.pdf (299.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01432915 , version 1 (12-01-2017)





David De Frutos Escrig, Jeroen A. Keiren, Tim C. Willemse. Branching Bisimulation Games. 36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2016, Heraklion, Greece. pp.142-157, ⟨10.1007/978-3-319-39570-8_10⟩. ⟨hal-01432915⟩
62 View
232 Download



Gmail Facebook X LinkedIn More