In process algebras, bisimulation equivalence is typically defined directly in terms of the operational rules of action; it also has an alternative characterization in terms of a simple modal logic (sometimes called Hennessy-Milner logic). This paper first defines two forms of bisimulation equivalence for the pi-calculus, a process algebra which allows dynamic reconfiguration among processes; it then explores a family of possible logics, with different modal operators. It is proven that two of these logics characterize the two bisimulation equivalences. Also, the relative expressive power of all the logics is exhibited as a lattice. The results are applicable to most value-passing process algebras
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
We study an extension of Hennessy-Milner logic for the pi-calculus which gives a sound and complete ...
Preface We examine modal and temporal logics for processes. In section 1 we introduce concurrent pro...
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...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operati...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operati...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
This paper provides a denotational semantics for the ‘saturation method’, described by J. A. Bergstr...
We define a uniform semantic substrate for a wide variety of process calculi where states and action...
We study the problem of specifying and verifying properties of ß-calculus processes while relying on...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
We identify two features of common process algebra operations: their first-order flavour and the fac...
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 ...
We study an extension of Hennessy-Milner logic for the pi-calculus which gives a sound and complete ...
Preface We examine modal and temporal logics for processes. In section 1 we introduce concurrent pro...
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...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operati...
In process algebras, bisimulation equivalence is typically defined directly in terms of the operati...
AbstractIn process algebras, bisimulation equivalence is typically defined directly in terms of the ...
This paper provides a denotational semantics for the ‘saturation method’, described by J. A. Bergstr...
We define a uniform semantic substrate for a wide variety of process calculi where states and action...
We study the problem of specifying and verifying properties of ß-calculus processes while relying on...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
We identify two features of common process algebra operations: their first-order flavour and the fac...
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 ...
We study an extension of Hennessy-Milner logic for the pi-calculus which gives a sound and complete ...
Preface We examine modal and temporal logics for processes. In section 1 we introduce concurrent pro...