Advertisement

Three semantics of the output operation for generative communication

  • Nadia Busi
  • Roberto Gorrieri
  • Gianluigi Zavattaro
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1282)

Abstract

A simple, yet Turing powerful, calculus based on generative communication is introduced; among its primitives, it contains a conditional input operation that tests for presence (or absence) of an output, reminiscent of the inp predicate of Linda. We study three different operational semantics for the output operation, called instantaneous, ordered and unordered. The associated behavioural semantics are obtained as the coarsest congruence contained in the corresponding strong barbed semantics. We prove that when the output operation is instantaneous, the obtained semantics is a sort of asynchronous bisimulation; on the contrary, for the ordered semantics, as well as for the unordered one, the resulting semantics is a small variant of the classic (synchronous) bisimulation. A further result is that the language under unordered semantics is no more Turing powerful, hence the language becomes strictly less expressive.

Keywords

Operational Semantic Parallel Composition Label Transition System Tuple Space Random Access Machine 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ACS96]
    R. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for the Asynchronous π-Calculus. In Proc. CONCUR'96, volume 1119 of LNCS, pages 147–162, Springer Verlag, 1996.Google Scholar
  2. [Bou92]
    G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.Google Scholar
  3. [BG95]
    N. Busi and R. Gorrieri. A Petri Net Semantics for π-calculus. In Proc. CONCUR'95, volume 962 of LNCS, pages 145–159, Springer Verlag, 1995.Google Scholar
  4. [BGZ97a]
    N. Busi, R. Gorrieri, and G. Zavattaro. A Truly Concurrent view of Linda Interprocess Communication. Technical Report UBLCS-97-02, Department of Computer Science, University of Bologna, February 1997.Google Scholar
  5. [BGZ97b]
    N. Busi, R. Gorrieri, and G. Zavattaro. On the Turing Equivalence of Linda Coordination Primitives. Technical Report UBLCS-97-05, Department of Computer Science, University of Bologna, May 1997.Google Scholar
  6. [BGZ97c]
    N. Busi, R. Gorrieri, and G. Zavattaro, A Process Algebraic View of Linda Coordination Primitives. To appear in Theoretical Computer Science. Available as Technical Report UBLCS-97-06, Department of Computer Science, University of Bologna, May 1997.Google Scholar
  7. [BP95]
    N. Busi and G.M. Pinna. A Causal Semantics for Contextual P/T nets. In Proc. ICTCS'95, 311–325, World Scientific, 1995.Google Scholar
  8. [CGZ96]
    P. Ciancarini, R. Gorrieri, and G. Zavattaro. Towards a Calculus for Generative Communication. In Proc. 1st IFIP Conf. on FMOODS'96, pages 283–297. Chapman & Hall, 1996.Google Scholar
  9. [Gel85]
    D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.CrossRefGoogle Scholar
  10. [GC92]
    D. Gelernter and N. Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97–107, 1992.CrossRefGoogle Scholar
  11. [Gro93]
    J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263–299, 1993.CrossRefGoogle Scholar
  12. [HKH95]
    M. Hansen, J. Kleist, and H. Hüttel. Bisimulations for Asynchronous Mobile Processes. In Proc. Tbilisi Symposium on Language, Logic, and Computation, 1995.Google Scholar
  13. [HT91]
    K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Proc. ECOOP '91, volume 512 of LNCS, pages 133–147. Springer Verlag, 1991.Google Scholar
  14. [Mil89]
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  15. [MS92]
    R. Milner and D. Sangiorgi. Barbed Bisimulation. In Proc. ICALP'92, volume 623 of LNCS, pages 685–695, Springer Verlag, 1992.Google Scholar
  16. [Min67]
    M. L. Minsky. Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs, 1967.Google Scholar
  17. [MR95]
    U. Montanari and F. Rossi. Contextual Nets. Acta Informatica, 32(6):545–596, 1995.Google Scholar
  18. [Nar90]
    J. E. Narem. An Informal Operational Semantics of C-Linda V2.3.5. Technical Report YALEU/DCS/TR-839, Department of Computer Science, Yale University, December 1990.Google Scholar
  19. [SCA95]
    Scientific Computing Associates. Linda: User's guide and reference manual. Scientific Computing Associates, 1995.Google Scholar
  20. [SS63]
    J. C. Shepherdson and J. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217–255, 1963.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Nadia Busi
    • 1
  • Roberto Gorrieri
    • 2
  • Gianluigi Zavattaro
    • 2
  1. 1.Dipartimento di MatematicaUniversità di SienaSienaItaly
  2. 2.Dipartimento di Scienze dell'InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations