Advertisement

A general categorical connection between local event structures and local traces

  • H. C. M. Kleijn
  • R. Morin
  • B. Rozoy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1684)

Abstract

Local event structures and local traces are generalizations of the classical prime event structures and Mazurkiewicz’ traces in which independence is no longer a global binary property.We consider the problem of lifting the categorical connection between prime event structures and Mazurkiewicz’ traces to this more general setting. Using a generic approach it is shown how certain subcategories of local event structures and local trace languages can be related. Moreover, every coreflection between subcategories generalizing the connection between prime event structures and Mazurkiewicz’ traces fits into this approach.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Degano, P., Gorrieri, R., Vigna, S.: On Relating some Models for Concurrency. TAPSOFT, LNCS 668 (1993) 15–30Google Scholar
  2. 2.
    Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: A Trace Semantics for Petri Nets. Information and Computation 117 (1995) 98–114zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An Event Structure Semantics for General Petri Nets. Theoretical Computer Science 153 (1996) 129–170zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Kleijn, H.C.M., Morin, R., Rozoy, B.: Event Structures for Local Traces. Electronic Notes in Theoretical Computer Science 16-2 (1998)-16 pagesGoogle Scholar
  5. 5.
    Mazurkiewicz, A.: Trace Theory. Advanced Course on Petri Nets, Bad Honnef, Germany, LNCS 254 (1987) 269–324Google Scholar
  6. 6.
    Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, events structures and domains, Part I. Theoretical Computer Science 13 (1981) 85–108zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Nielsen, M., Sassone, V., Winskel, G.: Relationships between Models of Concurrency. LNCS 803 (1994) 425–475Google Scholar
  8. 8.
    Rozoy, B., Thiagarajan, P.S.: Trace monoids and event structures. Theoretical Computer Science 91 (1991) 285–313zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Pierce, B.C.: Category Theory for Computer Scientists. (The MIT Press, 1991)Google Scholar
  10. 10.
    Winskel, G., Nielsen, M.: Models for Concurrency. In Handbook of Logic in Computer Science, Vol. 4: Semantic Modelling, S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, eds (Oxford University Press, Oxford, 1995) 1–148Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • H. C. M. Kleijn
    • 1
  • R. Morin
    • 2
  • B. Rozoy
    • 2
  1. 1.LIACS, Leiden UniversityRA LeidenThe Netherlands
  2. 2.L.R.I.Universitè de Paris SudOrsay CedexFrance

Personalised recommendations