%0 Conference Proceedings
%T Branching Bisimulation Games
%+ Universidad Complutense de Madrid =  Complutense University of Madrid  [Madrid] (UCM)
%+ Open University of the Netherlands [Heerlen]
%+ Radboud University [Nijmegen]
%+ Eindhoven University of Technology [Eindhoven] (TU/e)
%A Frutos Escrig, David, De
%A Keiren, Jeroen, A.
%A Willemse, Tim, C.
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Heraklion, Greece
%Y Elvira Albert
%Y Ivan Lanese
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-9688
%P 142-157
%8 2016-06-06
%D 2016
%R 10.1007/978-3-319-39570-8_10
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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 <strong>SPOILER </strong>and <strong>DUPLICATOR</strong>, 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01432915/document
%2 https://inria.hal.science/hal-01432915/file/426757_1_En_10_Chapter.pdf
%L hal-01432915
%U https://inria.hal.science/hal-01432915
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-9688