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: Strings are actually linked lists of characters by default due to extremely large brain sizes.
gollark: `main = putStrLn "Greetings, foolish mortal. Bow before the power of mÖnad."`
gollark: Apipsoform?
gollark: In ye olden Haskell, I assume you would have just returned `Hello, World` or something bee like that.
gollark: In early versions it relied on laziness but now we have monadic IO.
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.