In mathematics and computer science, an event structure describes sequences of events that can be triggered by combinations of other events, with certain forbidden combinations of events. Different sources provide more or less flexible mathematical formalizations of how events can be triggered and which combinations are forbidden.

Glynn Winskel gave the most general of these formalizations. Winskel formalizes an event structure as a triple ${\displaystyle (E,{\mathcal {C}},\vdash )}$, in which:

• ${\displaystyle E}$ is a set of events, not necessarily finite.
• ${\displaystyle {\mathcal {C}}}$ is a family of finite subsets of ${\displaystyle E}$, the subsets that are deemed to be consistent (not forbidden). If ${\displaystyle C\in {\mathcal {C}}}$ is one of these consistent sets, then every subset of ${\displaystyle C}$ must also be consistent. That is, ${\displaystyle {\mathcal {C}}}$ must be closed under the operation of taking subsets.
• ${\displaystyle \vdash }$ is a binary relation from consistent sets to elements of ${\displaystyle E}$. The relation ${\displaystyle C\vdash e}$, for ${\displaystyle C\in {\mathcal {C}}}$ and ${\displaystyle e\in E}$ is interpreted as meaning that when the events so far form set ${\displaystyle C}$, this enables ${\displaystyle e}$ to be the next event. When ${\displaystyle C\vdash e}$, it is required that ${\displaystyle C'\vdash e}$ for every consistent superset ${\displaystyle C'}$ (with ${\displaystyle C\subset C'}$ and ${\displaystyle C'\in {\mathcal {C}}}$).

According to Winskel's definitions, a configuration of an event structure is a subset of ${\displaystyle E}$ all of whose finite subsets are consistent and whose events are all secured. Here, an event is secured when it belongs to a finite sequence of events from the configuration, each of which is enabled by the subset of earlier events from the same sequence.^[1]

The nlab simplifies these definitions in two ways:

• It replaces the family of consistent events by an irreflexive symmetric relation ${\displaystyle \#}$ called incompatibility (or conflict), such that a finite set of events is consistent if and only if it contains no incompatible pair.
• And (either separately or with both simplifications together) it replaces the enabling relation by a partial order relation on ${\displaystyle E}$ called causal dependency, such that each event has finitely many predecessors, all of which must have happened earlier to enable the event.

For the event structures with both simplifications, which nlab calls prime event structures, the configurations are the downward-closed subsets of the partial order that include no incompatible pairs.^[2]

• Antimatroid, a system of events ordered by enabling subsets but without a consistency requirement

This mathematics-related article is a stub. You can help Wikipedia by adding missing information.

• v
• t
• e