Process Calculi for Coordination: From Linda to JavaSpaces
- 246 Downloads
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.
Unable to display preview. Download preview PDF.
- 2.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.Google Scholar
- 3.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.Google Scholar
- 4.N. Busi and G. Zavattaro. Event Notification in Datadriven Coordination Languages: Comparing the Ordered and Unordered Interpretations. In Proc. of SAC2000. ACM Press, 2000.Google Scholar
- 5.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.Google Scholar
- 8.C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
- 9.J. McClain. Personal communications. March 1999.Google Scholar
- 10.R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
- 12.Sun Microsystem, Inc. JavaSpaces Specifications, 1998.Google Scholar
- 13.Sun Microsystem, Inc. Jini Distributed Leasing Specifications, 1998.Google Scholar
- 14.P. Wyckoff, S.W. McLaughry, T.J. Lehman, and D.A. Ford. T Spaces. IBM Systems Journal, 37(3), 1998.Google Scholar