Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
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).
Bednarczyk, M.A., Categories of asynchronous systems. PhD in Comp Sc, University of Sussex, report no.1/88 (1988).
Berry, G., and Curien, P-L., Sequential algorithms on concrete data structures. TCS vol 20 (1982).
Boudol, G., and Castellani,I., On the semantics of concurrency: partial orders and transition systems. Springer Lec Notes in Comp Sc vol 249 (1987).
Curien, P-L., Categorical combinators, sequential algorithms and functional programming. Research notes in theoretical comp. sc., Pitman, London (1986).
Castellani, I., Permutations of transitions. This volume.
Engberg,U., Nielsen,M., and Larsen,K.S., Fully abstract models of a language with refinement. This volume.
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.
Coquand, T., Gunter, C., and Winskel, G., Domain theoretic models of polymorphism. To appear in Information and Computation, 1987.
Girard, J-Y., The system F of variable types, fifteen years later. TCS vol.45 (1986).
Girard, J-Y., Linear logic. TCS 1987.
Kahn, G., and Plotkin, G., Domaines Concrètes. Rapport IRIA Laboria No. 336 (1978).
Lafont, Y., Linear logic and lazy computation. Springer Lec Notes in Comp Sc vol 249 (1987).
Lamport, L., Time clocks and the ordering of events in a distributed system. CACM 21, (1978).
Maclane, S., Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer (1971).
Mazurkiewicz, A., Traces. This volume.
Milner, R., A Calculus of Communicating Systems. Springer Lecture Notes in Comp. Sc. vol. 92 (1980).
Meseguer, J., and Montanari, U., Petri nets are monoids: a new algebraic foundation for net theory. Proc of LICS, Computer Society Press (1988).
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).
Nielsen, M., Plotkin, G., Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13 (1981).
Penczek,W., The temporal logic of event structures. Report 616, Inst of Comp Sc, Polish Academy of Science, Warsaw, 1987.
Rem, M., Partially ordered computations, with an application to VLSI design. In “Foundations of Computer Science IV, part 2”, Mathematical Centre, Amsterdam (1983)
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).
Winskel, G., Events in Computation. Ph.D. thesis, available as a technical report, Comp. Sc. Dept., University of Edinburgh (1980).
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).
Winskel, G., A category of labelled nets and compositional proof system. Proc of LICS, Computer Society Press (1988).
Zhang, G.Q., Logic and semantics in computation. PhD in progress, Computer Laboratory, Cambridge University.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winskel, G. (1989). An introduction to event structures. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. REX 1988. Lecture Notes in Computer Science, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013026
Download citation
DOI: https://doi.org/10.1007/BFb0013026
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51080-2
Online ISBN: 978-3-540-46147-0
eBook Packages: Springer Book Archive