Event structures were introduced by Nielsen, Plotkin and Winskel [5] as a model for computational processes. These were essentially sets of events with relations expressing causal dependence and conflicts between them. These structures, also called prime event structures, were shown to be connected both with a class of acyclic Petri nets (called by the authors occurrence nets) and with a class of domains (finitary prime algebraic coherent domains). Though a very pleasant model of computation, prime event structures can lead to tedious definitions for more sophisticated constructions such as parallel product or exponentiation. In subsequent papers [8,9], Winskel introduced a more general class of event structures called stable event structures, for which such constructions are defined categorically. Although stable event structures themselves are slightly more complicated than prime event structures, constructions on them can be defined in an elegant way. In general, category theory has proven very useful for computer science. When constructions are formulated in categorical terms, not only can the required universal properties provide some guideline in the definitions, the associated morphisms may contain suggestions of computational interest as well. Moving to more general structures, however, can sometimes shield the intuitions about the model. In the case of stable event structures, the causality relation on events is not explicitly given, but is derived from an enabling relation on events. This makes such event structures a little hard to visualize, and one may wonder whether a more manageable notion could be devised. Moreover, unlike prime event structures, it is not clear if stable event structures correspond to a class of Petri nets, in the sense of [5]. Flow event structures were proposed in [2] as an intermediate between prime event structures and stable event structures, suitable both for graphical representation and for an easy definition of process operators. Among these operators the critical one is the
[1]
Frits W. Vaandrager.
A simple definition for parallel composition of prime event structures
,
1989
.
[2]
Wolfgang Reisig,et al.
Petri Nets: Applications and Relationships to Other Models of Concurrency
,
1986,
Lecture Notes in Computer Science.
[3]
Gérard Boudol.
Flow Event Structures and Flow Nets
,
1990,
Semantics of Systems of Concurrent Processes.
[4]
Glynn Winskel,et al.
Petri Nets, Event Structures and Domains
,
1979,
Semantics of Concurrent Computation.
[5]
Rocco De Nicola,et al.
On the consistency of 'truly concurrent' operational and denotational semantics
,
1988,
[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[6]
Ilaria Castellani,et al.
Permutation of transitions: An event structure semantics for CCS and SCCS
,
1988,
REX Workshop.
[7]
Glynn Winskel,et al.
Event Structures
,
1986,
Advances in Petri Nets.
[8]
Glynn Winskel,et al.
Petri Nets, Event Structures and Domains, Part I
,
1981,
Theor. Comput. Sci..
[9]
Rita Loogen,et al.
Modelling nondeterministic concurrent processes with event structures
,
1991,
Fundam. Informaticae.
[10]
Glynn Winskel,et al.
Event Structure Semantics for CCS and Related Languages
,
1982,
ICALP.
[11]
Glynn Winskel,et al.
Events in computation
,
1980
.