An introduction to event structures

  • Glynn Winskel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 354)


Event structures are models of processes as events constrained by relations of consistency and enabling. These notes are intended to introduce the mathematical theory of event structures, show how they are related to Petri nets and Scott domains, and how they can be used to provide semantics to programming languages for parallel processes as well as languages with higher types.

Key words

Event structures Petri nets traces concurrency nondeterminism parallel computation semantics communicating processes higher types lambda calculus 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Be]
    Berry, G., Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d'Etat, Université de Paris VII (1979).Google Scholar
  2. [B]
    Bednarczyk, M.A., Categories of asynchronous systems. PhD in Comp Sc, University of Sussex, report no.1/88 (1988).Google Scholar
  3. [BC]
    Berry, G., and Curien, P-L., Sequential algorithms on concrete data structures. TCS vol 20 (1982).Google Scholar
  4. [BoCa]
    Boudol, G., and Castellani,I., On the semantics of concurrency: partial orders and transition systems. Springer Lec Notes in Comp Sc vol 249 (1987).Google Scholar
  5. [C]
    Curien, P-L., Categorical combinators, sequential algorithms and functional programming. Research notes in theoretical comp. sc., Pitman, London (1986).Google Scholar
  6. [Ca]
    Castellani, I., Permutations of transitions. This volume.Google Scholar
  7. [EN]
    Engberg,U., Nielsen,M., and Larsen,K.S., Fully abstract models of a language with refinement. This volume.Google Scholar
  8. [CGW]
    Coquand, T., Gunter, C., and Winskel, G., Polymorphism and domain equations. In the proc of Third Workshop on the Mathematical Foundations of Programming Language Semantics, New Orleans, LA 1987.Google Scholar
  9. [CGW1]
    Coquand, T., Gunter, C., and Winskel, G., Domain theoretic models of polymorphism. To appear in Information and Computation, 1987.Google Scholar
  10. [G]
    Girard, J-Y., The system F of variable types, fifteen years later. TCS vol.45 (1986).Google Scholar
  11. [G1]
    Girard, J-Y., Linear logic. TCS 1987.Google Scholar
  12. [KP]
    Kahn, G., and Plotkin, G., Domaines Concrètes. Rapport IRIA Laboria No. 336 (1978).Google Scholar
  13. [YL]
    Lafont, Y., Linear logic and lazy computation. Springer Lec Notes in Comp Sc vol 249 (1987).Google Scholar
  14. [Lam]
    Lamport, L., Time clocks and the ordering of events in a distributed system. CACM 21, (1978).Google Scholar
  15. [Mac]
    Maclane, S., Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer (1971).Google Scholar
  16. [Maz]
    Mazurkiewicz, A., Traces. This volume.Google Scholar
  17. [Mil]
    Milner, R., A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sc. vol. 92 (1980).Google Scholar
  18. [MM]
    Meseguer, J., and Montanari, U., Petri nets are monoids: a new algebraic foundation for net theory. Proc of LICS, Computer Society Press (1988).Google Scholar
  19. [MDN]
    Degano, P., De Nicola,R. and Montanari, U., On the consistency of “truly concurrent” operational and denotational semantics. Proc of LICS, Computer Society Press (1988).Google Scholar
  20. [NPW]
    Nielsen, M., Plotkin, G., Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13 (1981).Google Scholar
  21. [P]
    Penczek,W., The temporal logic of event structures. Report 616, Inst of Comp Sc, Polish Academy of Science, Warsaw, 1987.Google Scholar
  22. [Rem]
    Rem, M., Partially ordered computations, with an application to VLSI design. In “Foundations of Computer Science IV, part 2”, Mathematical Centre, Amsterdam (1983)Google Scholar
  23. [TL]
    Lodaya,K., and Thiagarajan, P.S., A modal logic for a subclass of event structures. Proc of ICALP 1987 published in Springer Lecture Notes in C.S. (1987).Google Scholar
  24. [W]
    Winskel, G., Events in Computation. Ph.D. thesis, available as a technical report, Comp. Sc. Dept., University of Edinburgh (1980).Google Scholar
  25. [W1]
    Winskel, G., Event structures. Invited lectures for the Advanced Course on Petri nets, September 1986. Appears as a report of the Computer Laboratory, University of Cambridge, 1986, and in the proceedings of the school, published in Springer Lecture Notes in C.S., vol.255 (1987).Google Scholar
  26. [W2]
    Winskel, G., A category of labelled nets and compositional proof system. Proc of LICS, Computer Society Press (1988).Google Scholar
  27. [Z]
    Zhang, G.Q., Logic and semantics in computation. PhD in progress, Computer Laboratory, Cambridge University.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Glynn Winskel
    • 1
  1. 1.Computer Science DepartmentAarhus UniversityDenmark

Personalised recommendations