Lesson plan

event structure

In mathematics and computer science, an event structure describes sequences of events that can be triggered by combinations of other events, with certain forbidden combinations of events. Different sources provide more or less flexible mathematical formalizations of how events can be triggered and which combinations are forbidden. Glynn Winskel gave the most general of these formalizations. Winskel formalizes an event structure as a triple (E,\mathcal{C},\vdash) , in which: * E is a set of events, not necessarily finite. * \mathcal{C} is a family of finite subsets of E , the subsets that are deemed to be consistent (not forbidden). If C\in\mathcal{C} is one of these consistent sets, then every subset of C must also be consistent. That is, \mathcal{C} must be closed under the operation of taking subsets. * \vdash is a binary relation from consistent sets to elements of E . The relation C\vdash e , for C\in\mathcal{C} and e\in E is interpreted as meaning that when the events so far form set C , this enables e to be the next event. When C\vdash e , it is required that C'\vdash e for every consistent superset C' (with C\subset C' and C'\in\mathcal{C} ). According to Winskel's definitions, a configuration of an event structure is a subset of E all of whose finite subsets are consistent and whose events are all secured.…

Back to article

Article summary

In mathematics and computer science, an event structure describes sequences of events that can be triggered by combinations of other events, with certain forbidden combinations of events. Different sources provide more or less flexible mathematical formalizations of how events can be triggered and which combinations are forbidden. Glynn Winskel gave the most general of these formalizations. Winskel formalizes an event structure as a triple (E,\mathcal{C},\vdash) , in which: * E is a set of events, not necessarily finite. * \mathcal{C} is a family of finite subsets of E , the subsets that are deemed to be consistent (not forbidden). If C\in\mathcal{C} is one of these consistent sets, then every subset of C must also be consistent. That is, \mathcal{C} must be closed under the operation of taking subsets. * \vdash is a binary relation from consistent sets to elements of E . The relation C\vdash e , for C\in\mathcal{C} and e\in E is interpreted as meaning that when the events so far form set C , this enables e to be the next event. When C\vdash e , it is required that C'\vdash e for every consistent superset C' (with C\subset C' and C'\in\mathcal{C} ). According to Winskel's definitions, a configuration of an event structure is a subset of E all of whose finite subsets are consistent and whose events are all secured.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.