Abstract
We propose a new graph-based approach to modelling asynchronous languages and show how the new model can be viewed as a collapse of the standard transition system model for asynchronous behaviour by utilising the commuting properties of asynchronous transitions.
The motivation behind these new models stems from the issue of regularity for asynchronous processes. We note that the class of regular processes fails to contain many useful asynchronous processes and we identify a larger subclass of BPP accordingly. We call this new class asynchronously regular processes.
Using the new models we provide two appealing abstract characterisations of asynchronous bisimulation equivalence, namely, as spans of open maps and as a winning strategies for a bisimulation game. Also, by exploiting the coincidence of unite graphs with regular processes we see that bisimulation is polynomial time decidable over our class of asynchronously regular processes.
On leave from the University of Sussex. Supported by the EU-HCM Express network.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In U. Montanari and V. Sassone, editors, Proceedings CONCUR 96, Pisa, volume 1119 of Lecture Notes in Computer Science, pages 147–162. Springer-Verlag, 1996.
G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991.
S. Christensen, Y. Hirshfield, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In E. Best, editor, Proceedings CONCUR 93, Hildesheim, volume 715 of Lecture Notes in Computer Science, pages 143–157. Springer-Verlag, 1993.
C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. In Proc. ACM-POPL, 1996.
Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. In Proc. Mathematical Structures in Computer Science, 1996.
K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proc. ECOOP 91, Geneve, 1991.
A. Joyal, M. Nielsen, and G. Winskel. Bisimulation and open maps. In Proceedings 8 th Annual Symposium on Logic in Computer Science, pages 418–427. IEEE Computer Society Press, 1993.
P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43–68, 1990.
R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439–466, 1984.
R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989.
F. Moller. Infinite results. In U. Montanari and V. Sassone, editors, Proceedings CONCUR 96, Pisa, volume 1119 of Lecture Notes in Computer Science, pages 195–216. Springer-Verlag, 1996.
R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987.
B. Pierce and D. Turner. Pict: A programming language based on the π-calculus, 1996. Univeristy of Cambridge.
P. Selinger. First-order axioms for asynchrony. In M. Bednarczyk, editor, Proceedings CONCUR 97, Warsaw, volume 1243 of Lecture Notes in Computer Science, pages 376–390. Springer-Verlag, 1997.
C. Stirling. Bisimulation, model checking and other games, 1997. Notes for Mathfit Instructional Meeting on Games and Computation, University of Edinburgh.
G. Winskel and M. Nielsen. Models for concurrency. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume 4, pages 1–148. Oxford University Press, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rathke, J. (1998). Resource based models for asynchrony. In: Nivat, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1998. Lecture Notes in Computer Science, vol 1378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053556
Download citation
DOI: https://doi.org/10.1007/BFb0053556
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64300-5
Online ISBN: 978-3-540-69720-6
eBook Packages: Springer Book Archive