Event structure

In mathematics and computer science, an event structure represents a set of events, some of which can only be performed after another (there is a dependency between the events) and some of which might not be performed together (there is a conflict between the events).

Formal definition

An event structure $(E,\leq,\#)$ consists of

a set $E$ of events
a partial order relation on $E$ called causal dependency,
an irreflexive symmetric relation $\#$ called incompatibility (or conflict)

such that

finite causes: for every event $e\in E$ , the set $[e]=\{f\in E|f\leq e\}$ of predecessors of $e$ in $E$ is finite
hereditary conflict: for every events $d,e,f\in E$ , if $d\leq e$ and $d\# f$ then $e\# f$ .

See also

References

Winskel, Glynn (1987). "Event Structures" (PDF). Advances in Petri Nets. Lecture Notes in Computer Science. Springer.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.