Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
The power of the future perfect in program logics
Information and Control
Modeling concurrency with partial orders
International Journal of Parallel Programming
Communication and concurrency
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Handbook of logic in computer science (vol. 4)
Theoretical Computer Science - Special volume on Petri nets
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Propositional Temporal Logics and Equivalences
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Categories of asynchronous systems
Categories of asynchronous systems
Hereditary History Preserving Bisimilarity Is Undecidable
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Logics and Bisimulation Games for Concurrency, Causality and Conflict
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
| Hi-index | 0.00 |
A categorical definition of bisimulation, applicable to a wide range of models in concurrency with an accompanying notion af observations, was recently suggested by Joyal, Nielsen and Winskel. The definition is in terms of span of open maps, and it coincides with Park and Milner's strong bisimulation for the standard model of labelled transition systems with sequential observations. Here, we briefly present the general set-up, and discuss its applications. For the model of transition systems with independence and nonsequential observations, the associated notion of bisimulation was shown to be a slight strengthening of the history preserving bisimulations of Rabinovich and Trakhtenbrot. Furthermore, it turns out that this bisimulation has game theoretic and logical characterizations in the form of pleasantly simple modifications of well-known characterizations of standard strong bisimulation.