Refinement of actions in event structures and causal trees
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Handbook of logic in computer science (vol. 4)
Model checking
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Minimal Transition Systems for History-Preserving Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
On Relating Some Models for Concurrency
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Controllers for Discrete Event Systems via Morphisms
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Obseving Behaviour Categorically
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Causal Trees: Interleaving + Causality
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Unifying Equivalences for Higher Dimensional Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 5.23 |
Category theory has been successfully employed to structure the confusing set-up of models and equivalences for concurrency: Winskel and Nielsen have related the standard models via adjunctions and (co)reflections while Joyal et al. have defined an abstract notion of equivalence, known as open map bisimilarity. One model has not been integrated into this framework: the causal trees of Darondeau and Degano. Here we fill this gap. In particular, we show that there is an adjunction from causal trees to event structures, which we bring to light via a mediating model, that of event trees. Further, we achieve an open map characterization of history preserving bisimilarity: the latter is captured by the natural instantiation of the abstract bisimilarity for causal trees.