On the Bisimulation Proof Method (1994)

by Davide Sangiorgi
Venue:JOURNAL OF MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
Citations:72 - 2 self

Documents Related by Co-Citation

224 Barbed Bisimulation – Robin Milner, Davide Sangiorgi, Edinburgh Eh Jz - 1992
3219 Communication and Concurrency – R Milner - 1990
273 The polyadic -calculus: A tutorial – Robin Milner - 1992
1000 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
363 An Object Calculus for Asynchronous Communication – Kohei Honda, Mario Tokoro - 1991
144 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
315 Functions as processes – R Milner - 1990
70 An Efficiency Preorder for Processes – S. Arun-Kumar, M. Hennessy
254 Pict: A programming language based on the pi-calculus – Benjamin C. Pierce, David N. Turner - 1997
448 The Chemical Abstract Machine – Gérard Berry, Gérard Boudol - 1998
97 Decoding Choice Encodings – Uwe Nestmann, Benjamin C. Pierce - 1999
15 From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems – Marina Lenisa - 1999
62 Automata and coinduction (an exercise in coalgebra – J. J. M. M. Rutten - 1998
67 What is a `Good' Encoding of Guarded Choice? – Uwe Nestmann - 1997
66 Testing equivalence for mobile processes – M Boreale, R De Nicola - 1995
409 Testing Equivalences for Processes – R. De Nicola, M. C. B. Hennessy - 1984
17 The problem of "weak bisimulation up to – Davide Sangiorgi, Robin Milner - 1992
814 Mobile ambients – Luca Cardelli, Andrew D. Gordon - 1998
442 The π-calculus: A Theory of Mobile Processes – Davide Sangiorgi, David Walker - 2001