Event structure - Alchetron, The Free Social Encyclopedia

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 , ≤ , # ) 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 ∈ E , the set [ e ] = { f ∈ E | f ≤ e } of predecessors of e in E is finite

hereditary conflict: for every events d , e , f ∈ E , if d ≤ e and d # f then e # f .

References

Event structure Wikipedia

(Text) CC BY-SA