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: ```javascriptconst roll = ({ numDice, die, offset }) => { let sum = offset for (let i = 0; i < numDice; i++) { sum += Math.floor(Math.random() * die) + 1 } return sum}```
gollark: The actual relevant dice rolling bit is about 10 lines.
gollark: I think the basic idea is that while rolling a single die results in each result having the same probability, with multiple dice more than one different individual roll combinations can add up to some results. So the distribution is spikier.
gollark: I don't. I just made a convenient thing to graph the probability of rolling each number a while ago.
gollark: How much of it, anyway?

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.