AbstractBehavioural preorders based on the idea of bisimulation but refining the notion of bisimulation equivalence and providing explicit treatments of the phenomenon of divergence in communicating systems are investigated. Particular study is made of these preorders in the context of Milner's Calculus of Communicating Systems. The precongruence relations generated by the preorders are characterized and axiomatized on the classes of finite closed terms and sequential terms. A verification technique based on the theory of the preorders is introduced and illustrated
International audienceCoinduction is a method for specifying and reasoning about infinite data types...
This note considers the notion of divergence-preserving branching bisimilarity. It briefly surveys r...
We study two bisimilarities for ν-calculus, a small but expressive formalism with asynchronou...
AbstractBehavioural preorders based on the idea of bisimulation but refining the notion of bisimulat...
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduce...
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduce...
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduce...
This paper is concerned with bisimulation relations which do not only require related agents to simu...
AbstractCharacteristic formulae have been introduced by Graf and Sifakis to relate equational reason...
AbstractA general approach for defining behavioral preorders over process terms as the maximal preco...
Abstract. We consider the relational characterisation of branching bisimulation with explicit diverg...
Abstract. We develop a theory of bisimulations for a simple language containing communicating transa...
AbstractAhigher-order process calculusis a calculus for communicating systems which contains higher-...
We consider the relational characterisation of branching bisimilarity with explicit divergence. We p...
International audienceWe study proof techniques for bisimilarity based on unique solution of equatio...
International audienceCoinduction is a method for specifying and reasoning about infinite data types...
This note considers the notion of divergence-preserving branching bisimilarity. It briefly surveys r...
We study two bisimilarities for ν-calculus, a small but expressive formalism with asynchronou...
AbstractBehavioural preorders based on the idea of bisimulation but refining the notion of bisimulat...
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduce...
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduce...
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduce...
This paper is concerned with bisimulation relations which do not only require related agents to simu...
AbstractCharacteristic formulae have been introduced by Graf and Sifakis to relate equational reason...
AbstractA general approach for defining behavioral preorders over process terms as the maximal preco...
Abstract. We consider the relational characterisation of branching bisimulation with explicit diverg...
Abstract. We develop a theory of bisimulations for a simple language containing communicating transa...
AbstractAhigher-order process calculusis a calculus for communicating systems which contains higher-...
We consider the relational characterisation of branching bisimilarity with explicit divergence. We p...
International audienceWe study proof techniques for bisimilarity based on unique solution of equatio...
International audienceCoinduction is a method for specifying and reasoning about infinite data types...
This note considers the notion of divergence-preserving branching bisimilarity. It briefly surveys r...
We study two bisimilarities for ν-calculus, a small but expressive formalism with asynchronou...