Skip to Main content Skip to Navigation

Des bisimulations pour la sémantique des systèmes réactifs

Abstract : This thesis contributes to the study of semantics for the specification and the verification of reactive systems. More precisely, we compare behavioral equivalences, based on bisimulation with those induced by branching-time modal logics. In the first part of the thesis, we consider interleaving models for sequential non-deterministic systems. Few recent works have shown that, in the framework of infinite branching systems (i.e. infinite non-determinism), bisimulation equivalence, acknowledged as the basic branching-time semantic equivalence, is strictly finer than those induced by branching-time logics (we already know that they coincide under the finite branching hypothesis). We use Ordinal Processes of Klop, and by deriving a notion of distinguishing power of a semantic equivalence, we show in a unified framework that bisimulation is finer than branching-time logics, but also that for a wide class of program combinators, the generated congruences by the logics are still weaker than bisimulation. In the second part of the thesis, we consider partial order based models for concurrent systems, and in which we have a satisfactory definition of program refinement operation (this notion is related to the classical method of hierarchical design of programs). Among the semantic equivalences of the literature, history preserving bisimulation is particularly interesting since it is a congruence w.r.t. the refinement of systems without invisible actions. We use a characterisation of this equivalence by means of a back and forth bisimulation to exhibit adequate modal logics, and we also give a translating algorithm between those logics. We enlarge the field of our work by considering partial order based models with invisible actions. We show that the above-mentionned back and forth bisimulation, adapted to this framework, coincides with branching bisimulation over causal trees, but also with two new equivalences~: the branching mixed-ordering equivalence and the history preserving branching bisimulation, we study in details.
Document type :
Complete list of metadata

Cited literature [60 references]  Display  Hide  Download
Contributor : Thèses Imag <>
Submitted on : Thursday, February 26, 2004 - 5:26:58 PM
Last modification on : Friday, November 6, 2020 - 4:09:13 AM
Long-term archiving on: : Friday, September 14, 2012 - 1:11:25 PM


  • HAL Id : tel-00005141, version 1




Sophie Pinchinat. Des bisimulations pour la sémantique des systèmes réactifs. Génie logiciel [cs.SE]. Institut National Polytechnique de Grenoble - INPG, 1993. Français. ⟨tel-00005141⟩



Record views


Files downloads