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 .
gollark: It's just not optimized for GUI management, and haven't you yourself complained about Wine being bad?
gollark: Well, it's much more stable, you can manage it with a GUI, all your favourite Windows programs run on it, it has good things like IIS, etc.
gollark: Well, not not doing that.
gollark: That is your fault. Try not doing that.
gollark: https://media.discordapp.net/attachments/426116061415342080/966709740505800834/unknown.png
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.