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 consists of

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

such that

  • finite causes: for every event , the set of predecessors of in is finite
  • hereditary conflict: for every events , if and then .

See also

References

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



Share this article:

This article uses material from the Wikipedia article Event structure, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.