Abstract
We study at different levels of abstraction general semantic and algebraic properties of languages which are based on asynchronous communication. These different levels of abstraction concern the specific nature of the communication mechanism. At the highest level we introduce a process algebra which characterizes asynchronous communication in general, that is, when abstracting from the specific nature of the communication mechanism. This generic process algebra we further instantiate to algebras for different classes of languages. Considered are classes of languages which are based on a general monoid structure of the actions and classes of languages which are based on read/write operations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. C. M. Baeten and W. P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.
J. A. Bergstra and J. W. Klop. Process algebra for communication and mutual exclusion. Technical Report CS-R8409, CWI, 1984.
J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating systems. SIAM J. Comp., 17(6):1134–1177, 1988.
F. S. de Boer, J. W. Klop and C. Palamidessi. Asynchronous communication in process algebra. Proc. of the seventh annual IEEE symposium on Logics in Computer Science (LICS), pages 137–147. IEEE Computer Society Press, Los Alamitos, California, 1992.
F. S. de Boer, J. N. Kok, C. Palamidessi, and J. J. M. M. Rutten. The failure of failures: Towards a paradigm for asynchronous communication. Proc. of Concur’ 91, Lecture Notes in Computer Science, Vol. 527, pages 111–126, Amsterdam, The Netherlands, 1991.
F. S. de Boer and C. Palamidessi. A process algebra of concurrent constraint programming. Proc. of the Joint International Conference and Symposium on Logic Programming, JICSLP’92, pages 463–477, The MIT press, 1992.
M. Boreale, R. De Nicola, R. Pugliese. Asynchronous observations of processes. Proc. of FoSSaCS’98, Lecture Notes in Computer Science, 1998.
A. Brogi and P. Ciancarini. The concurrent language Shared Prolog. ACM Transaction on Programming Languages and Systems, 13(1):99–123, 1991.
S. D. Brookes. Full abstraction for a shared-variable parallel language. Information and Computation, 127(2):145–163, 15 June 1996.
N. Busi, R. Gorrieri, and G. Zavattaro. A process algebraic view of Linda coordination primitives. Theoretical Computer Science, 192(2):167–199, 1998.
P. Ciancarini, R. Gorrieri, and G. Zavattaro. An alternative semantics for the parallel operator of the calculus of gamma programs. Coordination Programming: Mechanism, Models and Semantics, pages 232–248, Imperial College Press, 1996.
R. De Nicola and R. Pugliese. A process algebra based on Linda. Proc. of Coordination’96, Lecture Notes of Computer Science, Vol. 1061, pages 160–178, 1996.
E. W. Dijkstra. Cooperating sequential processes. In Academic Press, New York, 1968.
D. Erman, F. HayesRoth, V. Lesser, and D. Reddy. The Hearsay2 speech understanding system: Integrating knowledge to resolve uncertainty. ACM Computing Surveys, 12:213–253, 1980.
D. Gelenter. Generative communication in Linda. ACM TOPLAS, 7(1):80–112, 1986.
L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971.
C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666–677, 1978.
He Jifeng, M. B. Josephs, and C. A. R. Hoare. A theory of synchrony and asynchrony. Proc. of IFIP Working Conference on Programming Concepts and Methods, pages 459–478, 1990.
G. Kahn. The semantics of a simple language for parallel programming. Information Processing 74: Proc. of IFIP Congress, pages 471–475, New York, 1974. North-Holland.
R. Milner. A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, New York, 1980.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
V. A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, january 1989. The MIT Press.
E. Y. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):412–510, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S., Zavattaro, G. (1999). Generic Process Algebras for Asynchronous Communication. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive