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: Also, it is possible that you are overestimating the reach of random intelligence agencies, inasmuch as a lot of communication is now cryptographically secured.
gollark: <@!237554605762936834> You know you can try and *reduce* the amount of random spying you experience?
gollark: The meme of this decade is... probably the money printer ones or more general coronavirus ones, so far?
gollark: They may be being deliberately vague.
gollark: The announcement I read just said "not this academic year".

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.