What is a `Good' Encoding of Guarded Choice? (1997)

Cached

Download Links

by Uwe Nestmann
Venue:INFORMATION AND COMPUTATION
Citations:64 - 2 self

Documents Related by Co-Citation

160 Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculi – Catuscia Palamidessi - 2002
363 An Object Calculus for Asynchronous Communication – Kohei Honda, Mario Tokoro - 1991
442 The π-calculus: A Theory of Mobile Processes – Davide Sangiorgi, David Walker - 2001
97 Decoding Choice Encodings – Uwe Nestmann, Benjamin C. Pierce - 1999
254 Pict: A programming language based on the pi-calculus – Benjamin C. Pierce, David N. Turner - 1997
1000 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
814 Mobile ambients – Luca Cardelli, Andrew D. Gordon - 1998
201 Resource Access Control in Systems of Mobile Agents – Matthew Hennessy, James Riely - 1998
592 A Communicating and Mobile Systems: the π-Calculus – R Milner - 1999
273 The polyadic -calculus: A tutorial – Robin Milner - 1992
31 On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes – L Bougé - 1988
3219 Communication and Concurrency – R Milner - 1990
144 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
315 Functions as processes – R Milner - 1990
45 Asynchrony and the π-calculus – G Boudol - 1992
54 The Join-Calculus: a Calculus for Distributed Mobile Programming – Cédric Fournet - 1998
409 Testing Equivalences for Processes – R. De Nicola, M. C. B. Hennessy - 1984
66 On bisimulations for the asynchronous -calculus – R M Amadio, I Castellani, D Sangiorgi - 1998
3407 Communicating Sequential Processes – C. A. R. Hoare - 2004