In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics are covered: (i) specification of processes using finite systems of equations over the syntax of process algebra; (ii) inference systems which are complete for proving the equivalence of regular (finite state) processes; (iii) variations of the bisimulation model
International audienceBisimilarity of two processes is formally established by producing a bisimulat...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
AbstractCharacteristic formulae have been introduced by Graf and Sifakis to relate equational reason...
AbstractCharacteristic formulae have been introduced by Graf and Sifakis to relate equational reason...
Abstract. Bisimilarity of two processes is formally established by producing a bisimulation relation...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operatio...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operatio...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operatio...
We identify two features of common process algebra operations: their first-order flavour and the fac...
International audienceBisimilarity of two processes is formally established by producing a bisimulat...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
AbstractCharacteristic formulae have been introduced by Graf and Sifakis to relate equational reason...
AbstractCharacteristic formulae have been introduced by Graf and Sifakis to relate equational reason...
Abstract. Bisimilarity of two processes is formally established by producing a bisimulation relation...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operatio...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operatio...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operatio...
We identify two features of common process algebra operations: their first-order flavour and the fac...
International audienceBisimilarity of two processes is formally established by producing a bisimulat...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which...
DOI
Add to ORKG