On the Bisimulation Proof Method (1994)

by Davide Sangiorgi
Venue:JOURNAL OF MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
Citations:85 - 3 self

Documents Related by Co-Citation

221 Barbed Bisimulation – Robin Milner, Davide Sangiorgi, Edinburgh Eh Jz - 1992
3218 Communication and Concurrency – R Milner - 1989
996 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
272 The Polyadic -Calculus: A Tutorial – R Milner - 1993
454 The Chemical Abstract Machine – Gérard Berry, Gérard Boudol - 1998
139 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
361 An Object Calculus for Asynchronous Communication – Kohei Honda, Mario Tokoro - 1991
315 Functions as Processes – Robin Milner - 1992
69 An Efficiency Preorder for Processes – S. Arun-Kumar, M. Hennessy
408 Testing Equivalences for Processes – R. De Nicola, M. C. B. Hennessy - 1984
64 Testing equivalence for mobile processes – Michele Boreale, Rocco De Nicola - 1995
615 Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR – Gavin Lowe - 1996
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
121 Bisimilarity as a theory of functional programming – Andrew D Gordon - 1999
17 The problem of "weak bisimulation up to – Davide Sangiorgi, Robin Milner - 1992
812 Mobile ambients – Luca Cardelli, Andrew D. Gordon - 1998
655 Concurrency and automata on infinite sequences – D Park - 1981
259 Expressing Mobility in Process Algebra: First-Order and Higher-Order Paradigms – D Sangiorgi - 1993