Skip to main content
SpringerLink
Log in

Graphs for Generalized Traces

  • Conference paper
Structures in Concurrency Theory

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 51 Accesses

Abstract

Mazurkiewicz traces form a model suitable for the investigation of some aspects of concurrency. We want to investigate one of its generalization based on the weakening of the condition that the equivalence relation is a congruence. The (quasi-)prefix ordering is then compared with the configuration graph induced by the partial ordering of symbol occurrences. We point out differences and exhibit necessary and/or sufficient conditions for them to be isomorphic: this is settled with the help of diamond properties.

This work has been partially sipported by the ESPRIT working group “Caliban” n° 6067 and the inter PRC project “Modèles du Parallélisme”.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold and J.F. Husson. On an extension of asynchronous automata. Technical Report 93-10-R, Institut de Recherche en Informatique de Toulouse, France, 1993.

    Google Scholar 

  2. I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60(l):l–82, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Arnold. An extension of the notion of traces and of asynchronous automata. RAIRO, Theoretical Informatics and Applications, 25 (4): 335–393, 1991.

    Google Scholar 

  4. S. Bauget, I. Biermann, and B. Rozoy. Generalized traces and partial orders. TR, LRI 95–947, Orsay, France. Presentation at the Caliban meeting (Zaragoza, June 1994 ), 1994.

    Google Scholar 

  5. BDK95] F. Bracho, M. Droste, and D. Kuske. Dependence orders for computations of concurrent automata. Lecture Notes in Computer Science, 900:467–478, 1995. STACS’95.

    Google Scholar 

  6. S. Bauget and P. Gastin. On congruences and partial orders. TR, LITP, Paris, France, to appear in MFCS’95, 1995.

    Google Scholar 

  7. I. Biermann and B. Rozoy. Context traces and transition systems. In ISCIS IX, Antalya, Turkey, 1994.

    Google Scholar 

  8. V. Diekert. Combinatorics on traces. Lecture Notes in Compuetr Science, 520, 1990.

    Google Scholar 

  9. M. Droste. Event structures and domains. Theoretical Computer Science, 68: 37–47, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  10. GP92] P. Gastin and A. Petit. Poset properties of complex traces. Lecture Notes in Computer Science, 629:255–263, 1992. MFCS’92.

    Google Scholar 

  11. HKT92] P. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. A trace semantics for Petri nets. Technical Report 92–03, Leiden University, 1992. to appear in 1995 in Information and Computation.

    Google Scholar 

  12. P. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. Local event structures and Petri nets. Lecture Notes in Computer Science, 715: 462–476, 1993.

    MathSciNet  Google Scholar 

  13. H.J. Hoogeboom and G. Rozenberg. Diamond properties of state spaces of elementary net systems. Fundamenta Informaticae, XIV: 287–300, 1991.

    MathSciNet  Google Scholar 

  14. Maz86] A. Mazurkiewicz. Trace theory. Lecture Notes in Computer Science, 255:279–324, 1986. Advanced Course on Petri Nets.

    Google Scholar 

  15. R. McKenzie, G. McNulty, and W. Taylor. Algebras, Lattices, Varietes, volume 1. Wadsworth fc Brooks/Cole, 1987.

    Google Scholar 

  16. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains. Theoretical Computer Science, 13 (1): 85 — 108, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  17. Per89] D. Perrin. Partial commutations. Lecture Notes in Computer Science, 372:637–651, 1989. ICALP’89.

    Google Scholar 

  18. Roz92] B. Rozoy. Distributed languages and models for concurency. Lecture Notes in Computer Science. 609:267–291, 1992. Advances in Petri Net.

    Google Scholar 

  19. B. Rozoy and P.S. Thiagarajan. Trace monoids and event structures. Theoretical Computer Science, 91 (2): 285–313, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  20. Sta89] E.W. Stark. Connections between a concrete and an abstract model of concurrent systems. Lecture Notes in Computer Science, 442:53–79, 1989. 5th Mathematical Foundations of Programming Semantics, New Orleans, Louisiana, USA.

    Google Scholar 

  21. W. Vogler. A generalization of traces. RAIRO, Theoretical Informatics and Applications, 25 (2): 147–156, 1991.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.R.I. URA 410 CNRS, Université Paris Sud, 91405, Orsay Cedex, France

    I. Biermann & B. Rozoy

Authors
  1. I. Biermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Rozoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, D-10099, Berlin, Germany

    Jörg Desel Dr. rer. nat.

Rights and permissions

Reprints and permissions

Copyright information

© 1995 British Computer Society

About this paper

Cite this paper

Biermann, I., Rozoy, B. (1995). Graphs for Generalized Traces. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3078-9_7

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19982-3

  • Online ISBN: 978-1-4471-3078-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation