Skip to main content

Rendez-Vous with Metric Semantics

  • Conference paper

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

Abstract

A comparative semantic study is made of an element of the family of concurrent object-oriented programming languages. Particular attention is paid to two notions: (i) dynamically evolving process structures, including a mechanism to name and refer to processes and a means to create new processes, and (ii) rendez-vous between processes involving the sending and answering of messages and the induced execution of method calls The methodology of metric semantics is applied in the design of operational and denotational semantics, as well as in the proof of their equivalence. Both semantics employ domains which are determined as fixed points of a contracting functor in the category of complete metric spaces. Moreover, fruitful use is made of the technique of defining semantic meaning functions as fixed points of contracting higher-order mappings. Finally, syntactic and semantics continuations play a pervasive role.

Partially supported by ESPRIT Basic Research Action 3020: Integration

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

Buying options

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. P. America and J.W. de Bakker. Designing equivalent semantic models for process creation. Theoretical Computer Science, 60: 109 - 176, 1988.

    Article  MathSciNet  Google Scholar 

  2. P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Operational semantics of a parallel object-oriented language. In Proc. POPL’86, pages 194 - 208, St. Petersburg, Florida, 1986.

    Google Scholar 

  3. P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Denotational semantics of a parallel object-oriented language. Information and Computation, 83: 152 - 205, 1989.

    Article  MathSciNet  Google Scholar 

  4. P. America. Issues in the design of a parallel object-oriented language. Formal Aspects of Computing, 1: 366 - 411, 1989.

    Article  Google Scholar 

  5. P. America and J.J.M.M. Rutten. A parallel object-oriented language: design and semantic foundations. In J.W. de Bakker, editor, Languages for Parallel Architectures: Design, Semantics, Implementation Models, Wiley Series in Parallel Computing, pages 1-49. Wiley, 1989.

    Google Scholar 

  6. P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences, 39: 343 - 375, 1989.

    Article  MathSciNet  Google Scholar 

  7. P. America and J.J.M.M. Rutten. A layered semantics for a parallel objectoriented language. Technical Report CS-R9052, CWI, Amsterdam, 1990. To appear in “Foundations of Object-Oriented Languages”, LNCS 489, Springer, 1991.

    Google Scholar 

  8. J.W. de Bakker, J.A. Bergstra, J.W. Klop, and J.-J.Ch. Meyer. Linear time and branching time semantics for recursion with merge. Theoretical Computer Science, 34: 135 - 156, 1984.

    Article  MathSciNet  Google Scholar 

  9. J.W. de Bakker and E.P. de Vink. CCS for 00 and LP. In Proc. TAP-SOFT’91. LNCS, Springer, 1991. To appear.

    Google Scholar 

  10. J.W. de Bakker and J: J.Ch. Meyer. Metric semantics for concurrency. BIT, 28: 504 - 529, 1988.

    Article  MathSciNet  Google Scholar 

  11. J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, and J.I. Zucker. Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Journal of Computer and System Sciences, 36: 158 - 224, 1988.

    Article  MathSciNet  Google Scholar 

  12. J.W. de Bakker and J.H.A. Warmerdam. Metric pomset semantics for a concurrent language with recursion. In I. Guessarian, editor, Proc. 18ème Ecole de Printemps d’Informatique, Semantique du Parallelisms, pages 2149. LNCS 469, Springer, 1990.

    Google Scholar 

  13. J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurrency. Information and Control, 54: 70 - 120, 1982.

    Article  MathSciNet  Google Scholar 

  14. J. Dugundji. Topology. Allyn and Bacon, 1966.

    Google Scholar 

  15. A. Eliëns. DLP - a Language for Distributed Logic Programming. PhD thesis, Universiteit van Amsterdam, 1991.

    Google Scholar 

  16. R. Engelking. General Topology, volume 6 of Sigma Series in Pure Mathematics. Heldermann, revised and completed edition, 1989.

    Google Scholar 

  17. C.A. Gunter and D.S. Scott. Semantic domains. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 633-674. North-Holland, 1990.

    Google Scholar 

  18. E. Horita, J.W. de Bakker, and J.J.M.M. Rutten. Fully abstract denotational semantics for nonuniform concurrent languages. Technical Report CS-R9027, CWI, Amsterdam, 1990.

    Google Scholar 

  19. J.N. Kok and J.J.M.M. Rutten. Contractions in comparing concurrency semantics. Theoretical Computer Science, 76: 180 - 222, 1990.

    Article  MathSciNet  Google Scholar 

  20. K. Kuratowski. Sur une méthode de métrisation complète des certains espaces d’ensembles compacts. Fundamenta Mathematicae, 42: 114 - 138, 1956.

    Article  Google Scholar 

  21. S. MacLane. Categories for the working mathematician, volume 5 of Graduate texts in mathematics. Springer, 1971.

    Google Scholar 

  22. J.-J.Ch. Meyer and E.P. de Vink. Applications of compactness in the Smyth powerdomain of streams. Theoretical Computer Science, 57: 251 - 382, 1988.

    Article  MathSciNet  Google Scholar 

  23. D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proc 5th GI Conference, pages 167-183. LNCS 104, Springer, 1981.

    Google Scholar 

  24. J.J.M.M. Rutten. Correctness and full abstraction of metric semantics for concurrency. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pages 628-659. LNCS 354, Springer, 1989.

    Google Scholar 

  25. J.J.M.M. Rutten. Deriving metric models for bisimulation from transition system specifications. In M. Broy and C.B. Jones, editors, Proc. IFIP TC2 Working conference on programming concepts and methods, pages 155-177. North-Holland, 1990.

    Google Scholar 

  26. J.J.M.M. Rutten. Semantic correctness for a parallel object-oriented language. SIAM Journal on Computing, 19: 341 - 383, 1990.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Bakker, J.W., de Vink, E.P. (1991). Rendez-Vous with Metric Semantics. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-25209-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-23206-4

  • Online ISBN: 978-3-662-25209-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics