Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1988: Automata, Languages and Programming pp 317–332Cite as

Contractions in comparing concurrency semantics

  • Conference paper
  • First Online:

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

Abstract

We define for a simple concurrent imperative language both operational and denotational semantic models as fixed points of contractions on complete metric spaces. Next, we develop a general method for comparing different semantic models by relating their defining contractions and exploiting the fact that contractions have a unique fixed point.

The research of J.N. Kok is partially supported by the Netherlands Organisation for Research (NWO), grant 125-20-04. The research of J.N. Kok and J.J.M.M. Rutten is partially supported by ESPRIT project 415: Parallel Architectures and Languages for Advanced Information Processing — a VLSI-directed approach.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

4. References

  1. P. America, Definition of the programming language POOL-T, Esprit project 415, Doc. No. 91, Philips Research Laboratories, Eindhoven, September 1985.

    Google Scholar 

  2. P. America, J. de Bakker, J. Kok, J.J.M.M. Rutten, Operational semantics of a parallel object-oriented language, Conference record of the 13th Symposium on Principles of Programming Languages, St. Petersburg, Florida, January 1986, pp.194–208.

    Google Scholar 

  3. P. America, J. de Bakker, J. Kok, J.J.M.M. Rutten, Denotational semantics of a parallel object-oriented language, Technical Report (CS-R8626), Centre for Mathematics and Computer Science, Amsterdam, 1986. (To appear in: Information and Computation.)

    Google Scholar 

  4. K. Apt, G. Plotkin, Countable nondeterminism and random assignment, Journal of the Association for Computing Machinery, Vol. 33, No. 4, October 1986, pp. 724–767.

    Google Scholar 

  5. P. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, Report CS-R8709, Centre for Mathematics and Computer Science, Amsterdam, February 1987. (To appear in: Proceedings of the Third Workshop on Mathematical Foundations of Programming Language Semantics, Springer-Verlag, Lecture Notes in Computer Science, 1988.)

    Google Scholar 

  6. S. Brookes, C. Hoare, W. Roscoe, A theory of communicating sequential processes, J. Assoc. Comput. Mach. 31, No. 3, 1984, pp. 560–599.

    Google Scholar 

  7. J.W. de Bakker, J.-J. Ch. Meyer, Metric semantics for concurrency, Report CS-R8803, Centre for Mathematics and Computer Science, Amsterdam, 1988.

    Google Scholar 

  8. J.W. de Bakker, J.N. Kok, J.-J. Ch. Meyer, E.-R. Olderog, J.I. Zucker, Contrasting themes in the semantics of imperative concurrency, in: Current Trends in Concurrency (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.), Lecture Notes in Computer Science 224, Springer-Verlag, 1986, pp. 51–121.

    Google Scholar 

  9. J.W. de Bakker, J.-J. Ch. Meyer, E.-R. Olderog, J.I. Zucker, Transition systems, infinitary languages and the semantics of uniform concurrency, in: Proceedings 17th ACM STOC, Providence, R.I. (1985), pp. 252–262.

    Google Scholar 

  10. J.W. de Bakker, J.-J. Ch. Meyer, E.-R. Olderog, J.I. Zucker, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Report CS-R8601, Centre for Mathematics and Computer Science, Amsterdam, January 1986. (To appear in: Journal of Computer and System Sciences.)

    Google Scholar 

  11. J.W. de Bakker, J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982), pp. 70–120.

    Google Scholar 

  12. J. Dugundji, Topology, Allen and Bacon, Rockleigh, N.J., 1966.

    Google Scholar 

  13. E. Engelking, General topology, Polish Scientific Publishers, 1977.

    Google Scholar 

  14. N. Francez, C.A.R. Hoare, D.J. Lehmann, W.P. de Roever, Semantics of nondeterminism, concurrency and communication, J. CSS 19 (1979), pp. 290–308.

    Google Scholar 

  15. M. Hennessy, G.D. Plotkin, Full abstraction for a simple parallel programming language, in: Proceedings 8th MFCS (J. Bečvař ed.), Lecture Notes in Computer Science 74 Springer-Verlag (1979), pp. 108–120.

    Google Scholar 

  16. C.A.R. Hoare, Communicating sequential processes, Prentice Hall International, 1985.

    Google Scholar 

  17. J.N. Kok, A compositional semantics for Concurrent Prolog, in: Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, Lecture Notes in Computer Science, Springer Verlag, 1988, pp. 373–388.

    Google Scholar 

  18. J.N. Kok, Semantic equivalence for Concurrent Prolog, to appear.

    Google Scholar 

  19. J.N. Kok, J.J.M.M. Rutten, Contractions in comparing concurrency semantics (full version), Report CS-R8755, Centre for Mathematics and Computer Science, Amsterdam, November 1987.

    Google Scholar 

  20. R. Milner, A Calculus of communicating systems, Lecture Notes in Computer Science 92, Springer-Verlag, 1980.

    Google Scholar 

  21. G.D. Plotkin, A powerdomain construction, SIAM J. Comp. 5 (1976), pp. 452–487.

    Google Scholar 

  22. G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Comp. Sci. Dept., Aarhus Univ. 1981.

    Google Scholar 

  23. G.D. Plotkin, An operational semantics for CSP, in: Formal Description of Programming Concepts II (D. Bjørner ed.) North-Holland, Amsterdam (1983), pp. 199–223.

    Google Scholar 

  24. J.J.M.M. Rutten, Correctness and full abstraction of metric semantics for concurrency, to appear in: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.), Proc. REX Workshop 1988, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  25. J.J.M.M. Rutten, Semantic equivalence for a parallel object-oriented language, to appear.

    Google Scholar 

  26. D.S. Scott, Domains for denotational semantics, Proc. 9th ICALP (M. Nielsen, E.M. Schmidt, eds.), Lecture Notes in Computer Science 140, Springer-Verlag, 1982, pp. 577–613.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. N. Kok & J. J. M. M. Rutten

Authors
  1. J. N. Kok
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. J. M. M. Rutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Timo Lepistö Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kok, J.N., Rutten, J.J.M.M. (1988). Contractions in comparing concurrency semantics. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_125

Download citation

  • DOI: https://doi.org/10.1007/3-540-19488-6_125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19488-0

  • Online ISBN: 978-3-540-39291-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation