Skip to main content
SpringerLink
Log in
Book cover

International Conference on Coordination Languages and Models

COORDINATION 2000: Coordination Languages and Models pp 51–65Cite as

A Principled Semantics for inp

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1906))

Abstract

The ‘predicated’ forms of the Linda in and rd primitives have given problems for both kernel implementors and Linda formalists. This paper firstly analyses these problems and then proposes a precise semantics for inp which is both reasonable, in that it does not admit unexpected or useless implementations, and implementable for open distributed tuple-space systems.

The semantics is given in a CSP style by the introduction of several new operators including kick-start, and deadlock-breaking concurrency which together enable a variety of well-defined, and feasibly implementable interpretations.

The paper includes a discussion of the implementation of these operators, and examples of the use of the resulting inp in practical coordination applications.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antonio Brogi and Jean-Marie Jacquet. On the expressiveness of coordination models. In Paolo Ciancarini and Alexander L. Wolf, editors, Coordination Languages and Models: Third International Conference, COORDINATION’ 99, number 1594 in Lecture Notes in Computer Science, pages 134–149, Berlin, April 1999. Springer.

    Google Scholar 

  2. N. Busi, R. Gorrieri, and G. Zavattaro. Three Semantics for the Output Operation for Generative Communication. In D. Garlan and D. Le Métayer, editors, Coordination Langauges and Models: Proceedings of the Second International Conference COORDINATION’ 97, volume LNCS 1282, pages 205–21. Springer, 1997.

    Chapter  Google Scholar 

  3. Nadia Busi and Gianluigi Zavattaro. Event notification in data-driven coordination languages: Comparing the ordered and unordered interpretations. In Janice Carroll, Ernesto Damiani, Hisham Haddad, and Dave Oppenheim, editors, Applied Computing 2000: Proceedings of the 2000 ACM Symposium on Applied Computing, volume 1, pages 233–239. ACM Press, March 2000.

    Google Scholar 

  4. Paul Butcher, Alan Wood, and Martin Atkins. Global Synchronisation in Linda. Concurrency: Practice and Experience, 6(6):505–516, 1994.

    Article  Google Scholar 

  5. N. Carriero and D. Gelernter. How to Write Parallel Programs: a First Course. MIT Press, 1990.

    Google Scholar 

  6. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1988.

    MATH  Google Scholar 

  7. Andrew Douglas, Alan Wood, and Antony Rowstron. Linda Implementation Revisited. In Transputer and occam Developments, pages 125–138. IOS Press, 1995.

    Google Scholar 

  8. David Gelernter and Nicholas Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97–107, 1992.

    Article  Google Scholar 

  9. C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice Hall International, Hemel Hempstead, 1985.

    MATH  Google Scholar 

  10. C. A. R. Hoare and Jifeng He. Unifying Theories of Programming. Series in Computer Science. Prentice Hall, London, 1998.

    MATH  Google Scholar 

  11. IBM. IBM TSpaces Programmer’s Guide. http://www.almaden.ibm.com/cs/TSpaces/html/ProgrGuide.html, 1999.

  12. IBM. Untitled (TSpaces specification). http://www.almaden.ibm.com/cs/TSpaces/html/javadoc/index.html, 1999.

  13. D. E. Knuth. Stable Marriage and its Relation to Other Combinatorial Problems: an introduction to the mathematical analysis of algorithms. American Mathematical Society, 1997.

    Google Scholar 

  14. Jeff Magee and Jeff Kramer. Concurrency: State models and Java programs. Worldwide Series in Computer Science. Wiley, Chichester, UK, 1999.

    MATH  Google Scholar 

  15. Ronaldo Menezes. Ligia: Incorporating Garbage Collection in a Java based Lindalike Run-Time System. In Proceedings of the 2nd Workshop on Distributed Systems (WOSID’98), pages 81–88, 1998.

    Google Scholar 

  16. Ronaldo Menezes and Alan Wood. Garbage Collection in Open Distributed Tuple Space Systems. In Proc. 15th Brazilian Computer Networks Symposium-SBRC’ 97, pages 525–543, 1997.

    Google Scholar 

  17. Ronaldo Menezes and Alan Wood. Using Tuple Monitoring and Process Registration on the Implementation of Garbage Collection in open Linda-like Systems. In Proceedings of the Tenth IASTED International Conference: PDCS’98, pages 490–495. IASTED/Acta Press, 1998.

    Google Scholar 

  18. I. Merrick and A. M. Wood. Coordination with Scopes. Proc. ACM Symposium on Applied Computing, pages 210–217, 2000.

    Google Scholar 

  19. R. Milner. Communications and Concurrency. Series in Computer Science. Prentice-Hall International, Hemel Hempstead, 1989.

    MATH  Google Scholar 

  20. Robin Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge, UK, 1999.

    MATH  Google Scholar 

  21. E.S. Page and L.B. Wilson. An Introduction to Computational Combinatorics. Cambridge University Press, 1979.

    Google Scholar 

  22. A. W. Roscoe. The Theory and Practice of Concurrency. Series in Computer Science. Prentice Hall Europe, 1998.

    Google Scholar 

  23. A. Rowstron and A. M. Wood. Solving the Multiple-rd Problem. Science of Computer Programming, 31:335–358, July 1998.

    Google Scholar 

  24. Antony Rowstron and Alan Wood. BonitA: A Set of Tuple Space Primitives for Distributed Coordination. In Hesham El-Rewini and Yale N. Patt, editors, Proc. of the 30th Hawaii International Conference on System Sciences, volume 1, pages 379–388. IEEE Computer Society Press, January 1997.

    Google Scholar 

  25. Steve A. Schneider. Concurrent and Real-time Systems: The CSP approach. Worldwide Series in Computer Science. Wiley, Chichester, UK, 2000.

    Google Scholar 

  26. Scientific Computing Associates. Linda User’s Guide & Reference Manual, 1995.

    Google Scholar 

  27. Sun Microsystems. JavaSpaces Specification, 1999.

    Google Scholar 

  28. Alan Wood. Coordination with Attributes. In P. Ciancarini and A.L. Wolf, editors, Coordinatiion Languages and Models: Proceedings of the Third International Conference COORDINATION’ 99, volume LNCS-1594, pages 21–36. Springer, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, UK

    Jeremy L. Jacob

  2. Department of Computer Science, University of York, UK

    Alan M. Wood

Authors
  1. Jeremy L. Jacob
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan M. Wood
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática, Universidade Nova de Lisboa, Monte de Caparica, 2825-114, Caparica, Portugal

    António Porto

  2. Department of Computer Science, Washington University in St. Louis, Box 1045, One Brookings Drive, St. Louis, MO, 63130, USA

    Gruia-Catalin Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jacob, J.L., Wood, A.M. (2000). A Principled Semantics for inp. In: Porto, A., Roman, GC. (eds) Coordination Languages and Models. COORDINATION 2000. Lecture Notes in Computer Science, vol 1906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45263-X_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45263-X_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41020-1

  • Online ISBN: 978-3-540-45263-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation