Skip to main content
SpringerLink
Log in

On distributed languages and models for concurrency

  • Conference paper
  • First Online:
Advances in Petri Nets 1992

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

Abstract

Event Structures are a poset based model for describing the behaviour of distributed systems. They give rise to a well understood class of Scott domains. Event structures are also related to Petri nets in a fundamental way. Trace monoids are a string-based formalism for describing the behaviour of distributed systems. They have an independent theory rooted in the theory of formal languages, but are too weak to express more general nets and problems, such as the producer and consumer paradigm for example. Thus extensions of original traces have been looked at. In this paper, we describe connections between Partially Ordered Sets and Traces, using a Transition Systems, and in order to allow sound generalizations of finite traces to context-sensitive ones.

We obtain a representation of generalized trace languages in terms of labelled event structures.

This work was partially supported by the ESPRIT / BRA DEMON project and the PRC C3, CNRS.

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.J. AALBERSBERG-G. ROZENBERG, Theory of Traces, Theor. Comp. Sci. 60 (1988) p. 1–82.

    Google Scholar 

  2. A. ARNOLD An extension of the notion of traces and of asynchronous automata, Theoretical Informatics and Applications, vol. 25, nℴ4 (1991) p. 335–393.

    Google Scholar 

  3. R. ASSOUS-C. CHARRETTON, Nice Labelling of Event Structures, Bull. EATCS nℴ41 (1990 June) p. 184–190.

    Google Scholar 

  4. R. ASSOUS-V. BOUCHITE-C. CHARRETTON, B. ROZOY, Finite Labelling Problem in Event Structures, (1991) to appear in Theor. Comp. Sci.

    Google Scholar 

  5. G. BOUDOL, I. CASTELLANI, Permutations of Transitions, an Event Structure Semantic for C.C.S. and S.C.C.S., REX Workshop on Concurrency (1988) L.N.C.S. nℴ 354, p. 411–427.

    Google Scholar 

  6. G. BOUDOL, I. CASTELLANI, Flow Models of Distributed Computations: Event Structure and Nets (1991) T.R. INRIA nℴ 1482.

    Google Scholar 

  7. G. BOUDOL, I. CASTELLANI, Flow Models of Distributed Computations: Three equivalent Semantic for C.C.S. (1991) T.R. INRIA nℴ 1484.

    Google Scholar 

  8. V. DIEKERT, P. GASTIN, A. PETIT, Recognizable complex Trace Languages, 16th symposium on M.F.C.S., Poland (1991), L.N.C.S. nℴ 520, p. 131–140.

    Google Scholar 

  9. P. GASTIN, A. PETIT, W. ZIELONKA, A Kleene Theorem for infinite Trace Languages, 18th ICALP, Madrid (1991), L.N.C.S. nℴ 510, p. 254–266.

    Google Scholar 

  10. P. GASTIN, B. ROZOY, Infinitary Partially Commutative Monoids, (1991) Tech. Rep. 91-07, LITP, Paris 6 University, France (to appear in Theor. Comp. Sci.).

    Google Scholar 

  11. H.J. HOOGEBOOM, G. ROZENBERG, Diamond Properties of State Spaces of Elementary Net Systems, Tech.Rep. 89-18 (1989) Leiden University, Holland.

    Google Scholar 

  12. P. HOOGERS, H.C.M. KLEIJN, P.S. THIAGARAJAN, A Trace Semantics for Petri Nets, Third Workshop on Concurrency and Compositionality (1991 March) Goslar, Germany.

    Google Scholar 

  13. M. Z. KWIATKOWSKA, On the domain of traces and sequential composition, CAAP'91, Trace Languages, L.N.C.S. nℴ 493 (1991) p. 42–56.

    Google Scholar 

  14. A. MAZURKIEWICZ, Trace Theory, Advanced Course on Petri Nets, Bad Honnef, Germany (1987) L.N.C.S. nℴ 254, p. 269–324.

    Google Scholar 

  15. M. MUKUND, P.S. THIAGARAJAN, A Petri Net Model of Asynchronously Communicating Sequential Processes, in: A Perspective in Theor. Comp. Science, R. Narasimhan ed, World Sc. series in Comp. Science Vol. 16 (1989) p. 165–198.

    Google Scholar 

  16. M. NIELSEN, Models for concurrency, 16th symposium on Mathematical Foundations of Computer Science, Poland (1991) L.N.C.S. nℴ 520, p. 43–46.

    Google Scholar 

  17. M. NIELSEN-G. PLOTKIN-G. WINSKEL, Petri Nets, Event Structures and Domains, Theor. Comp. Sci. 13 (1981) p. 85–108.

    Google Scholar 

  18. M. NIELSEN, G. ROZENBERG, P.S. THIAGARAJAN, Elementary Transitions System, Tech Rep. (1990) April, Aarhus Univ., to appear in Theor. Comp. Sci.

    Google Scholar 

  19. M. NIELSEN, G. ROZENBERG, P.S. THIAGARAJAN, Transitions Systems, Event Structures and Unfolding, Tech Rep. 91-01, Leiden Univ., Third Workshop on Concurrency and Compositionality (1991 March) Goslar, Germany.

    Google Scholar 

  20. D. PERRIN, Partial Commutations, ICALP 89, L.N.C.S. nℴ 372 (1989) p. 637–651.

    Google Scholar 

  21. B. ROZOY, Distributed Languages, a context dependant extension of traces, Third Workshop on Concurrency and Compositionality (1991 March) Goslar, Germany.

    Google Scholar 

  22. B. ROZOY, Le monoÏde distribué, un modèle de parallélisme, thèse d'état, université de Caen, 1987, Techn. Rep. L.I.U.C. 87-1.

    Google Scholar 

  23. B. ROZOY, P.S. THIAGARAJAN, Trace Monoids and Event Structures, Theor. Comp. Sci. (1991) nℴ2, p. 285–313.

    Google Scholar 

  24. M.W. SHIELDS, Concurrent Machines, The Computer Journal Vol. 28 nℴ5 (1985) p. 449–465.

    Google Scholar 

  25. M.W. SHIELDS, Deterministic asynchronous automata (1985) in Formal Methods in Programming, North Holland.

    Google Scholar 

  26. M.W. SHIELDS, Elements of a theory of parallelism (to be published).

    Google Scholar 

  27. P.H. STARKE, Traces and Semi-words, L.N.C.S. nℴ 208 (1985) p. 332–349.

    Google Scholar 

  28. W. VOGLER, A Generalization of Traces Theory, Tech. Rep. 9018 (1990) Technische Universität München, to appear in Theoretical Informatics and Applications.

    Google Scholar 

  29. G. WINSKEL, Categories of Models for Concurrency, Seminar on Concurrency, Pittsburgh, U.S.A. (1984) L.N.C.S. nℴ 197, p. 246–267.

    Google Scholar 

  30. G. WINSKEL, Event Structures, Advanced Course on Petri Nets, Bad Honnef, Germany (1987) L.N.C.S. nℴ 255, p. 325–392.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.R.I., Université de Paris XI et URA CNRS, Bât. 490, 91 405, Orsay Cedex, France

    Brigitte Rozoy

Authors
  1. Brigitte Rozoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rozoy, B. (1992). On distributed languages and models for concurrency. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_175

Download citation

  • DOI: https://doi.org/10.1007/3-540-55610-9_175

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47258-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation