| 1. |
- Milner, Robin, et al.
(författare)
-
A Calculus of Mobile Processes - Part I
- 1992
-
Ingår i: Information and Computation. - : Elsevier BV. - 0890-5401 .- 1090-2651. ; 100:1, s. 1-40
-
Tidskriftsartikel (refereegranskat)
|
|
| 2. |
- Milner, Robin, et al.
(författare)
-
A Calculus of Mobile Processes - Part II
- 1992
-
Ingår i: Information and Computation. - : Elsevier BV. - 0890-5401 .- 1090-2651. ; 100:1, s. 41-77
-
Tidskriftsartikel (refereegranskat)
|
|
| 3. |
- Milner, Robin, et al.
(författare)
-
Modal Logics for Mobile Processes
- 1993
-
Ingår i: Theoretical Computer Science. - 0304-3975 .- 1879-2294. ; 114:1, s. 149-171
-
Tidskriftsartikel (refereegranskat)abstract
- 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 π-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.
|
|
| 4. |
- Parrow, Joachim, et al.
(författare)
-
Modal logics for mobile processes
- 1991. - 1
-
Rapport (refereegranskat)abstract
- In process algebras, bisimulation equivalence is typically defined directly in terms of the operational rules of action; it also has an alternative characterisation in terms of a simple modal logic (sometimes called Hennessy-Milner logic . This paper first defines two forms of bisimulation equivalence for the\031-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 characterise the two bisimulation equivalences. Also, the relative expressive power of all the logics is exhibited as a lattice.
|
|
