Bisimulation and Open Maps (1993)

Cached

Download Links

by André Joyal , Mogens Nielsen , Glynn Winskel
Venue:In Proc. LICS'93, Eighth Annual Symposium on Logic in Computer Science
Citations:36 - 7 self

Active Bibliography

Gunnar Schröter – Der Technischen Universität Berlin, Doktor Der Ingenieurwissenschaften, Berichter Prof, Dr. H. Ehrig - 2004
Towards a Categorical Axiomatics of Bisimulation – Gian Luca Cattani, A. John Power, Glynn Winskel - 1999
5 Categories in Concurrency – Glynn Winskel, Mogens Nielsen - 1997
16 Petri Nets and Bisimulations – Mogens Nielsen, Glynn Winskel - 1995
116 Bisimulation from Open Maps – André Joyal, Mogens Nielsen, Mogens Nielsen, Glynn Winskel, Glynn Winskel - 1994
1 Convenient Category of Processes and Simulations I: Modulo Strong Bisimilarity – Dusko Pavlovic, Strong Bisimilarity - 1995
9 On The Specification Of Concurrent Systems – Ross Thomas Casley, Vaughan Pratt, John C. Mitchell - 1991
3 Equivalence semantics for concurrency: comparison and application – Vashti Christina Galpin - 1998
The Topos of Labelled Trees: A Categorical Semantics for SCCS – Stefano Kasangian, Sebastiano Vigna - 1997
2 A Non-well-founded Sets Semantics for Observation Congruence over Full CCS – Michael Baldamus - 1994
4 Weak Bisimulation and Open Maps (Extended Abstract) – Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel - 1999
1 Twenty years on: Reflections on the CEDISYS project. Combining true concurrency with – Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
1 An extension of Rabin's tree theorem to tree-like structures – Igor Walukiewicz
29 History Dependent Automata – Ugo Montanari, Marco Pistore - 2001
14 History-Dependent Automata – Ugo Montanari, Marco Pistore - 1998
65 On the Expressive Completeness of the Propositional Mu-Calculus With Respect to Monadic Second Order Logic – David Janin, Igor Walukiewicz - 1996
1 History Preserving Bisimulation for Contextual Nets ⋆ – Paolo Baldan, Andrea Corradini, Ugo Montanari