Event structure

Different sources provide more or less flexible mathematical formalizations of the way events can be triggered and which combinations are forbidden.

The most general of these formalizations is given by Glynn Winskel.

, in which: According to Winskel's definitions, a configuration of an event structure is a subset of

all of whose finite subsets are consistent and whose events are all secured.

[1] The nlab simplifies these definitions in two ways: 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.