Posets for configurations!
Families of posets, in contrast to families of configurations, are always prime algebraic; in fact the category FPos ⊑ is equivalent to the category of prime algebraic domains;
On the level of events, FPos is equivalent to the category of prime algebraic domains with an additional relation encoding event identity.
The (abstract) event identity relation can be used to characterize concrete relations between events such as binary conflict and causal flow;
One can characterize a wide range of event-based models existing in the literature as families of posets satisfying certain specific structural conditions formulated in terms of event identity.
KeywordsEvent Structure Event Base Event Identity Order Level Compact Element
Unable to display preview. Download preview PDF.
- 1.G. Boudol. Flow event structures and flow nets. In I. Guessarian, editor, Semantics of Systems of Concurrent Processes, volume 469 of Lecture Notes in Computer Science, pages 62–95. Springer-Verlag, 1990.Google Scholar
- 3.G. Boudol and I. Castellani. Permutations of transitions: An event structure semantics for CCS and SCCS. In de Bakker et al. , pages 411–427.Google Scholar
- 4.G. Boudol and I. Castellani. Flow models of distributed computations: Event structures and nets. Rapports de Recherche 1482, INRIA, July 1991.Google Scholar
- 5.B. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press, 1990.Google Scholar
- 6.J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science. Springer-Verlag, 1989.Google Scholar
- 7.P. Degano, R. De Nicola, and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In de Bakker et al. , pages 438–466.Google Scholar
- 9.J. Gunawardena. Geometric logic, causality and event structures. In J. C. M. Baeten and J. F. Groote, editors, Concur '91, volume 527 of Lecture Notes in Computer Science, pages 266–280. Springer-Verlag, 1991.Google Scholar
- 10.R. Langerak. Bundle event structures. Memoranda informatica, University of Twente, 1992.Google Scholar
- 12.A. Mazurkiewicz. Basic notions of trace theory. In de Bakker et al. , pages 285–363.Google Scholar
- 13.M. Nielsen, U. Engberg, and K. G. Larsen. Fully abstract models for a process language with refinement. In de Bakker et al. , pages 523–549.Google Scholar
- 14.M. Nielsen, G. Rozenberg, and P. S. Thiagarajan. Elementary transition systems. In , 1991.Google Scholar
- 15.M. Nielsen, G. Rozenberg, and P. S. Thiagarajan. Transition systems, event structures and unfoldings. In , 1991.Google Scholar
- 16.A. Rensink. Selection structures. Memoranda Informatica 90-71, University of Twente, Dec. 1990.Google Scholar
- 17.A. Rensink. Poset semantics, bisimulation. Memoranda informatica, University of Twente, 1992.Google Scholar
- 18.A. Rensink. Posets for configurations! Memoranda informatica, University of Twente, 1992.Google Scholar
- 19.E. W. Stark. Connections between a concrete and an abstract model of concurrent systems. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Semantics, volume 442 of Lecture Notes in Computer Science, pages 53–79. Springer-Verlag, 1990.Google Scholar
- 20.P. S. Thiagarajan. Some models and logics for concurrency. Course Notes of the Advanced School on Concurrency, Gargnano del Garda, Italy, Sept. 1991.Google Scholar
- 21.F. W. Vaandrager. A simple definition for parallel composition of prime event structures. Report ACMCS-R8903, Centre for Mathematics and Computer Science, 1989.Google Scholar
- 22.R. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University of Amsterdam, 1990.Google Scholar
- 23.R. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems — Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 267–300. Springer-Verlag, 1990.Google Scholar
- 24.G. Winskel. Event structure semantics for CCS and related languages. In M. Nielsen and E. M. Schmidt, editors, Automata, Languages and Programming, volume 140 of Lecture Notes in Computer Science, pages 561–576. Springer-Verlag, 1982.Google Scholar
- 25.G. Winskel. Categories of models for concurrency. In S. D. Brookes, A. W. Roscoe, and G. Winskel, editors, Seminar on Concurrency, volume 197 of Lecture Notes in Computer Science, pages 246–267. Springer-Verlag, 1985.Google Scholar
- 26.G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, volume 255 of Lecture Notes in Computer Science, pages 325–392. Springer-Verlag, 1987.Google Scholar
- 27.G. Winskel. An introduction to event structures. In de Bakker et al. , pages 364–397.Google Scholar
- 28.G. Winskel. Categories of models for concurrency. Course Notes of the Advanced School on Concurrency, Gargnano del Garda, Italy, Sept. 1991.Google Scholar