What is a "good" encoding of guarded choice?

Information and Computation

Volumn 156, Issue 1-2, 2000, Pages 287-319

  Nestmann, Uwe ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; FORMAL LANGUAGES; MATHEMATICAL OPERATORS;

RANDOM ACCESS MACHINES;

ENCODING (SYMBOLS);

EID: 0034627947     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2822     Document Type: Article

References (41)

1. Amadio, R. M., Castellani, I., and Sangiorgi, D. (1998), On bisimulations for the asynchronous π-calculus, Theoret. Comput. Sci. 195(2), 291-324.
2. [An extended abstract appeared in "Proceedings of CONCUR '96," LNCS, Vol. 1119, pp. 147-162].
3. Arun-Kumar, S., and Hennessy, M. (1992), An efficiency preorder for processes, Acta Inform. 29, 737-760.
4. [Ama97] Amadio, R. M. (1997), An asynchronous model of locality, failure, and process mobility, in "Proceedings of COORDINATION '97" (D. Garlan and D. Le Metayer, Eds.), LNCS, Vol. 1282, Springer-Verlag, Berlin.
5. [Extended version as Rapport de Recherche RR-3109, INRIA Sophia-Antipolis, 1997]
6. Ben-Or, M. (1983), Another advantage of free choice: Completely asynchronous agreement protocols (Extended abstract), in "Proceedings of PODC '83," pp. 27-30, ACM, New York.
7. Bernstein, A. (1980), Output guards and nondeterminism in "Communicating Sequential Processes," ACM Trans. Programming Lang. Systems 2(2), 234-238.
8. Busi, N., Gorrieri, R., and Zavattaro, G. (1997), On the Turing-equivalence of Linda coordination primitives, in "Proceedings of EXPRESS '97" (C. Palamidessi and J. Parrow, Eds.), ENTCS, Vol. 7, Elsevier Science, Amsterdam.
9. Bougé, L. (1988), On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, Acta Inform. 25(2), 179-201.
10. Boudol, G. (1992), Asynchrony and the π-Calculus, Rapport de Recherche 1702, INRIA, Sofia-Antipolis.
11. Buckley, G., and Silberschatz, A. (1983), An effective implementation for the generalized input-output construct of CSP, ACM Trans. Programming Lang. Systems 5(2), 223-235.
12. Bellin, G., and Scott, P. (1994), On the π-calculus and linear logic, Theoret. Comput. Sci. 135, 11-65. [Also published as LFCS report ECS-LFCS-92-232, LFCS, University of Edinburgh].
13. Fournet, C., and Gonthier, G. (1996), The reflexive chemical abstract machine and the join-calculus, in "Proceedings of POPL '96," pp. 372-385, ACM, New York.
14. Fournet, C., and Gonthier, G. (1998), A hierarchy of equivalences for asynchronous calculi, in "Proceedings of ICALP '98" (K. G. Larsen, S. Skyum, and G. Winskel, Eds.), LNCS, Vol. 1443, pp. 844-855, Springer-Verlag, Berlin.
15. Honda, K. (1992), Notes on soundness of a mapping from π-calculus to v-calculus. [Comments added in October 1993]
16. Honda, K., and Tokoro, M. (1992), On asynchronous communication semantics, in "Object-Based Concurrent Computing 1991" (M. Tokoro, O. Nierstrasz, and P. Wegner, Eds.), LNCS, Vol. 612, pp. 21-51, Springer-Verlag, Berlin.
17. Knabe, F. (1993), A distributed protocol for channel-based communication with choice, Comput. Artif. Intell. 12(5), 475-490.
18. Kobayashi, N. (1997), A partially deadlock-free typed process calculus, in "Proceedings of LICS '97," pp. 128-139, Comput. Soc. Press, New York. [Full version as as Technical Report 97-02, University of Tokyo]
19. Kumar, D., and Silberschatz, A. (1997), A counter-example to an algorithm for the generalized input-output construct of CSP, Inform. Process. Lett. 61, 287.
20. Lamport, L. (1974), A new solution of Dijkstra's concurrent programming problem, J. Assoc. Comput. Mach. 17(8), 453-455.
21. Leth, L., and Thomsen, B. (1995), Some facile chemistry, Formal Aspects Comput. 7(3), 314-328. [A previous version appeared as ECRC-Report ECRC-92-14]
22. Milner, R. (1993), The polyadic π-calculus: A tutorial, in "Logic and Algebra of Specification" (F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds.), Series F: Computer and System Sciences, Vol. 94, NATO Advanced Study Institute, Springer-Verlag, Berlin.
23. [Available as Technical Report ECS-LFCS-91-180, University of Edinburgh, October 1991].
24. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, I/II, Inform. and Comput. 100, 1-77.
25. Milner, R., and Sangiorgi, D. (1992), Barbed bisimulation, in "Proceedings of ICALP '92" (W. Kuich, Ed.), LNCS, Vol. 623, pp. 685-695, Springer-Verlag, Berlin.
26. Nestmann, U. (1996), "On Determinacy and Nondeterminacy in Concurrent Programming," Ph.D. thesis, Technische Fakultät, Universität Erlangen. [Arbeitsbericht IMMD-29(14)]
27. Nestmann, U., and Pierce, B. C. (1996), Decoding choice encodings, in "Proceedings of CONCUR '96" (U. Montanari and V. Sassone, Eds.), LNCS, Vol. 1119, pp. 179-194, Springer-Verlag, Berlin. [Revised full version as report ERCIM-10/97-R051, European Research Consortium for Informatics and Mathematics, 1997].
28. Palamidessi, C. (1997), Comparing the expressive power of the synchronous and the asynchronous π-calculus, in "Proceedings of POPL '97," pp. 256-265, ACM, New York.
29. Parrow, J., and Sjödin, P. (1992), Multiway synchronization verified with coupled simulation, in "Proceedings of CONCUR '92" (R. Cleaveland, Ed.), LNCS, Vol. 630, pp. 518-533, Springer-Verlag, Berlin.
30. Pierce, B. C., and Sangiorgi, D. (1996), Typing and subtyping for mobile processes, Math. Struct. Comput. Sci. 6(5), 409-454.
31. [An extract appeared in "Proceedings of LICS '93," pp. 376-385]
32. Reppy, J. (1991), CML: A higher-order concurrent language, in "Proceedings of PLDI '91," pp. 293-259, ACM, New York.
33. [In SIGPLAN Notices 26(6)]
34. Rabin, M. O., and Lehmann, D. (1994), On the advantages of free choice: A symmetric and fully distributed solution to the Dining Philosophers Problems, in "A Classical Mind: Essays in Honour of C.A.R. Hoare" (A. W. Roscoe, Ed.), Chap. 20, pp. 333-352, Prentice-Hall, Englewood Cliffs, NJ.
35. [An extended abstract appeared in "Proceedings of POPL'81," pp. 133-138].
36. Sangiorgi, D. (1993), "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis, LFCS, University of Edinburgh
37. Sangiorgi, D. (1997), The name discipline of uniform receptiveness, in "Proceedings of ICALP '97" (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), LNCS, Vol. 1256, pp. 303-313, Springer-Verlag, Berlin.
38. [Full version as Technical Report, INRIA Sophia-Antipolis, December 1996]
39. Thomsen, B., Leth, L., and Kuo, T.-M. (1996), A Facile tutorial, in "Proceedings of CONCUR '96" (U. Montanari and V. Sassone, Eds.), LNCS, Vol. 1119, pp. 278-298, Springer-Verlag, Berlin.
40. Victor, B., and Parrow, J. (1996), Constraints as processes, in "Proceedings of CONCUR '96" (U. Montanari and V. Sassone, Eds.), LNCS, Vol. 1119, pp. 389-405, Springer-Verlag, Berlin.
41. Yoshida, N. (1996), Graph types for monadic mobile processes, in "Proceedings of FSTTCS '96" (V. Chandru and V. Vinay, Eds.), LNCS, Vol. 1180, pp. 371-386, Springer-Verlag, Berlin. [Full version as Technical Report ECS-LFCS-96-350, University of Edinburgh]