Advertisement

Process Calculi for Coordination: From Linda to JavaSpaces

  • Nadia Busi
  • Roberto Gorrieri
  • Gianluigi Zavattaro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1816)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Busi, R. Gorrieri, and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, 192(2):167–199, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 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. 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. 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. 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
  6. 6.
    D. Gelernter and N. Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97–107, 1992.CrossRefGoogle Scholar
  7. 7.
    J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263–299, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  9. 9.
    J. McClain. Personal communications. March 1999.Google Scholar
  10. 10.
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  11. 11.
    R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes. Information and Computation, 100(1):1–77, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Sun Microsystem, Inc. JavaSpaces Specifications, 1998.Google Scholar
  13. 13.
    Sun Microsystem, Inc. Jini Distributed Leasing Specifications, 1998.Google Scholar
  14. 14.
    P. Wyckoff, S.W. McLaughry, T.J. Lehman, and D.A. Ford. T Spaces. IBM Systems Journal, 37(3), 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Nadia Busi
    • 1
  • Roberto Gorrieri
    • 1
  • Gianluigi Zavattaro
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations