What is a 'Good' Encoding of Guarded Choice?
Open Access
- 31 December 1997
- journal article
- Published by Elsevier BV in Electronic Notes in Theoretical Computer Science
- Vol. 7, 206-226
- https://doi.org/10.1016/s1571-0661(05)80474-8
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Graph types for monadic mobile processesLecture Notes in Computer Science, 1996
- Some facile chemistryFormal Aspects of Computing, 1995
- On the π-calculus and linear logicTheoretical Computer Science, 1994
- The Polyadic π-Calculus: a TutorialPublished by Springer Science and Business Media LLC ,1993
- A calculus of mobile processes, IInformation and Computation, 1992
- CMLACM SIGPLAN Notices, 1991
- On the existence of symmetric algorithms to find leaders in networks of communicating sequential processesActa Informatica, 1988
- An Effective Implementation for the Generalized Input-Output Construct of CSPACM Transactions on Programming Languages and Systems, 1983
- Output Guards and Nondeterminism in “Communicating Sequential Processes”ACM Transactions on Programming Languages and Systems, 1980
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974