Skip to main content
SpringerLink
Log in

Metric pomset semantics for a concurrent language with recursion

  • Conference paper
  • First Online:
Semantics of Systems of Concurrent Processes (LITP 1990)

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

Included in the following conference series:

Abstract

We study the semantics of a simple language with concurrency and recursion. Our semantic domain consists of (sets of) finite and infinite partially ordered multisets (pomsets) in order to model true concurrency (i.e. non-interleaved parallel execution). It will be shown that the set of pomsets can be turned into a complete ultra-metric space. With the induced notion of convergence, it is possible to provide meaning to infinite computations. Operational and denotational semantics for the considered language are provided and their equivalence is established by showing that both are fixed points of a contracting higher order operator. In a final section we give a tentative denotational semantics for an extension of the language with synchronization.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

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

    Google Scholar 

  2. P. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, Journal of Computer and System Sciences, Vol 39, nr. 3, pp.343–375, 1989.

    Google Scholar 

  3. J.W. de Bakker, Comparative semantics for flow of control in logic programming without logic, Report CS-R8840, Centre for Mathematics and Computer Science, Amsterdam (1988), to appear in Information and Computation.

    Google Scholar 

  4. J.W. de Bakker, Designing concurrency semantics, in: Information Processing 89, G.X. Ritter (ed.), Elsevier, pp. 591–598, 1989.

    Google Scholar 

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

    Google Scholar 

  6. 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: Overviews and Tutorials (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.), Lecture Notes in Computer Science, Vol. 224, Springer (1986) 51–121.

    Google Scholar 

  7. J.W. de Bakker, J.-J.Ch. Meyer, Metric semantics for concurrency, BIT 28, pp. 504–529, 1988.

    Google Scholar 

  8. J.W. de Bakker, W.P. de Roever, G. Rozenberg (eds.), Linear Time, Branching Time and Partial Order, Proc. REX School/Workshop, Noordwijkerhout, June 1988, Lecture Notes in Computer Science, Vol. 354, Springer 1989.

    Google Scholar 

  9. J.W. de Bakker, J.J.M.M. Rutten, Concurrency semantics based on metric domain equations, Report CS-R 8954, Centre for Mathematics and Computer Science, Amsterdam (1989).

    Google Scholar 

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

    Google Scholar 

  11. G. Boudol, I. Castellani, Concurrency and atomicity, Theoretical Computer Science 59 (1988) 25–84.

    Google Scholar 

  12. H. Gaifman, Modeling concurrency by partial orders and nonlinear transition systems, in Proc. REX School/Workshop, Noordwijkerhout, June 1988, (J.W. de Bakker, W.P. de Roever, G. Rozenberg, eds.), Linear Time, Branching Time and Partial Order, Lecture Notes in Computer Science, Vol. 354, Springer (1989), 467–488.

    Google Scholar 

  13. J. Gischer, Partial orders and the axiomatic theory of shuffle, Ph.D. thesis, Stanford University, 1984.

    Google Scholar 

  14. J. Grabowski, On partial languages, Fundamenta Informaticae IV.2 (1981) 427–498.

    Google Scholar 

  15. J.N. Kok, J.J.M.M. Rutten, Contractions in comparing concurrency semantics, in Proc. 15th ICALP (T. Lepistö, A. Salomaa, eds.), Lecture Notes in Computer Science, Vol. 317, Springer (1988), 317–332. (To appear in Theoretical Computer Science.)

    Google Scholar 

  16. J.-J.Ch. Meyer, E.P. de Vink, Pomset semantics for true concurrency with synchronization and recursion (extended abstract), in Proc. MFCS '89 (A Kreczmar & G. Mirkowska, eds.), Lecture Notes in Computer Science, Vol. 379, Springer (1989), 360–369.

    Google Scholar 

  17. V. Pratt, Modelling concurrency with partial orders, Int. Journal of Parallel Programming 15 (1986) 33–71.

    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. W. de Bakker & J. H. A. Warmerdam

Authors
  1. J. W. de Bakker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. H. A. Warmerdam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irène Guessarian

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

de Bakker, J.W., Warmerdam, J.H.A. (1990). Metric pomset semantics for a concurrent language with recursion. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-53479-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53479-2

  • Online ISBN: 978-3-540-46897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation