A DiGraph Model for Extended Event Structures
A geometric model for concurrency has been described by Pratt in . While the intuition is easily understood the formal description using n-complexes requires some mathematical maturity. The purpose of this paper is two fold. The first is to construct a model directly based on 3d which is described informally in . This model is based on directed graphs and should be easier to understand than a model based on algebraic topology though we still incorporate the notions of tears, holes, persistent choice etc. The second is to study a few extensions. We make explicit the notion of transience, i.e., an event has start transient and end phases. We also add a notion of resources. Before we develop our model, we present a quick overview of some of the issues in concurrency and its handling in a geometric framework.
SubjectsFields of Research::230000 Mathematical Sciences::230100 Mathematics::230101 Mathematical logic, set theory, lattices and combinatorics
- Engineering: Reports