Skip to main content
SpringerLink
Log in

Trade-offs in true concurrency: Pomsets and mazurkiewicz traces

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1991)

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

Abstract

We compare finite pomsets and Mazurkiewicz traces, two models of true concurrency which generalize strings. We show that Mazurkiewicz traces are equivalent to a restricted class of pomsets. The restrictions lead to more algebraic structure satisfying additional properties.

For example, traces are consistently complete in the prefix order, while pomsets are not; also, traces can be distinguished by observing sequences of actions, in contrast to the elaborate scheme required for distinguishing pomsets. Finally, we discuss the operations of sequential and parallel composition in the two models. This is part of an ongoing effort to relate models of concurrency.

Supported by NSF grant (CCR-9003441).

Supported by SERC GR/F 93050. This paper was partly written when the second author was Visiting Professor at CWI, Amsterdam, sponsored by the Netherlands Organisation for Scientific Research (NWO).

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.

References

  1. I. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1–82, 1988.

    Article  Google Scholar 

  2. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Sci., 53(2/3):225–241, 1987.

    Google Scholar 

  3. B. Bloom and M. Kwiatkowska. Trade-offs in true concurrency: Pomsets and Mazurkiewicz traces. Technical Report 91-1223, Cornell, 1991.

    Google Scholar 

  4. B. Bloom and A. R. Meyer. Experimenting with process equivalence. In M. Kwiatkowska, M. Shields, and R. Thomas, editors, Semantics for Concurrency, Workshops in Computing. Springer-Verlag, 1990.

    Google Scholar 

  5. M. Chandy and L. Lamport. Finding global states of a distributed system. ACM Trans. Comput. Syst., 3(1):63–75, 1985.

    Google Scholar 

  6. J. de Bakker and J. Warmerdam. Metric pomset semantics for a concurrent language with recursion. In I. Guessarian, editor, Semantics of Systems of Concurrent Processes, volume 469 of Lecture Notes in Computer Science, pages 21–49. Springer-Verlag, 1990.

    Google Scholar 

  7. R. de Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Sci., 34(2/3):83–133, 1984.

    Google Scholar 

  8. J. L. Gischer. Partial orders and the axiomatic theory of schuffle. Technical Report STAN-CS-84-1033, Stanford University, 1984.

    Google Scholar 

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

    Google Scholar 

  10. C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice-Hall, 1985.

    Google Scholar 

  11. M. Kwiatkowska. Fairness for Non-interleaving Concurrency. PhD thesis, University of Leicester, 1989.

    Google Scholar 

  12. M. Z. Kwiatkowska. Defining process fairness for non-interleaving concurrency. In K. Nori and Veni-Madhavan, editors, Foundations of Software Technology and Theoretical Computer Science, volume 472 of Lecture Notes in Computer Science, pages 286–300. Springer-Verlag, 1990.

    Google Scholar 

  13. M. Z. Kwiatkowska. A metric for traces. Information Processing Letters, 35(3):129–135, 1990.

    Google Scholar 

  14. M. Z. Kwiatkowska. On the domain of traces and sequential composition. In S. Abramsky and T. Maibaum, editors, TAPSOFT'91, volume 493 of Lecture Notes in Computer Science, pages 42–56. Springer-Verlag, 1991.

    Google Scholar 

  15. A. Mazurkiewicz. Concurrent program schemes and their interpretations. Technical Report DAIMI Report PB-78, Aarhus University, 1977.

    Google Scholar 

  16. A. Mazurkiewicz. Basic notions of trace theory. In J. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 112 of Lect. Notes in Computer Sci. Springer-Verlag, 1989.

    Google Scholar 

  17. R. Milner. A modal characterisation of observable machine-behaviour. In E. Astesiano and C. Böhm, editors, CAAP '81: Trees in Algebra and Programming, 6th Colloquium, volume 112 of Lect. Notes in Computer Sci., pages 25–34. Springer-Verlag, 1981.

    Google Scholar 

  18. R. Milner. Communication and Concurrency. Prentice Hall International Series in Computer Science. Prentice Hall, New York, 1989.

    Google Scholar 

  19. G. Plotkin and V. Pratt. Teams can see pomsets (extended abstract). Preprint, 1990.

    Google Scholar 

  20. V. Pratt. The pomset model of parallel processes: Unifying the temporal and the spatial. In S. Brookes, A. Roscoe, and G. Winskel, editors, Seminar on Concurrency, volume 197 of Lect. Notes in Computer Sci. Springer-Verlag, 1985.

    Google Scholar 

  21. V. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33–71, 1986.

    Article  Google Scholar 

  22. M. W. Shields. Elements of a theory of parallelism. (to be published).

    Google Scholar 

  23. P. H. Starke. Traces and semiwords. In A. Skowron, editor, Computation Theory, volume 208 of Lecture Notes in Computer Science, pages 332–349. Springer-Verlag, 1985.

    Google Scholar 

  24. E. Szpilrajn. Sur l'extension de l'ordre partiel. Fund. Math., 16:386–389, 1930.

    Google Scholar 

  25. K. Taylor and C. Critchlow. The inhibition spectrum and the achievement of causal consistency (extended abstract). In Proceedings of the 9th SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC '90), 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cornell University, USA

    Bard Bloom & Marta Kwiatkowska

  2. University of Leicester, UK

    Bard Bloom & Marta Kwiatkowska

Authors
  1. Bard Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marta Kwiatkowska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, B., Kwiatkowska, M. (1992). Trade-offs in true concurrency: Pomsets and mazurkiewicz traces. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1991. Lecture Notes in Computer Science, vol 598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55511-0_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-55511-0_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55511-7

  • Online ISBN: 978-3-540-47194-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation