Abstract
We present a collection of process calculi featuring coordination primitives for the shared dataspace coordination model (inspired by Linda, JavaSpaces and TSpaces), some of which have never been formally defined before. The operational semantics of the calculi is used to clarify possible ambiguities of the informal definitions of these languages, to discuss possible implementation choices, to compare the expressive power of the new primitives and, finally, to support formal reasoning about programs written with these primitives.
Work partially supported by Esprit working group n.24512 “Coordina”
This is a preview of subscription content, log in via an institution to check access.
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
N. Busi, R. Gorrieri, and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, 192(2):167–199, 1998.
N. Busi, R. Gorrieri, and G. Zavattaro. Comparing Three Semantics for Linda-like Languages. Theoretical Computer Science, to appear, 2000. Extended abstract appeared in Proc. of Coordination’97.
N. Busi, R. Gorrieri, and G. Zavattaro. On the Expressiveness of Linda Coordination Primitives. Information and Computation, to appear, 2000. Extended abstract appeared in Proc. of Express’97.
N. Busi and G. Zavattaro. Event Notification in Datadriven Coordination Languages: Comparing the Ordered and Unordered Interpretations. In Proc. of SAC2000. ACM Press, 2000.
N. Busi and G. Zavattaro. On the Expressiveness of Event Notification in Data-driven Coordination Languages. In Proc. of ESOP2000, volume to appear of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2000.
D. Gelernter and N. Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97–107, 1992.
J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263–299, 1993.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
J. McClain. Personal communications. March 1999.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes. Information and Computation, 100(1):1–77, 1992.
Sun Microsystem, Inc. JavaSpaces Specifications, 1998.
Sun Microsystem, Inc. Jini Distributed Leasing Specifications, 1998.
P. Wyckoff, S.W. McLaughry, T.J. Lehman, and D.A. Ford. T Spaces. IBM Systems Journal, 37(3), 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Gorrieri, R., Zavattaro, G. (2000). Process Calculi for Coordination: From Linda to JavaSpaces. In: Rus, T. (eds) Algebraic Methodology and Software Technology. AMAST 2000. Lecture Notes in Computer Science, vol 1816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45499-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-45499-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67530-3
Online ISBN: 978-3-540-45499-1
eBook Packages: Springer Book Archive