Event Structures as Presheaves -Two Representation Theorems
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Theoretical Computer Science - Category theory and computer science
A fully abstract model for the π-calculus
Information and Computation
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Presheaf models for CCS-like languages
Theoretical Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Reversibility and Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
New Bisimulation Semantics for Distributed Systems
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Concise Graphs and Functional Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Open maps bisimulations for higher dimensional automata models
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Observational Equivalences for Timed Stable Event Structures
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Open Maps and Observational Equivalences for Timed Partial Order Models
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
A categorical observation of timed testing equivalence
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
| Hi-index | 0.03 |
A systematic treatment of weak bisimulation and observational congruence on presheaf models is presented. The theory is developed with respect to a "hiding" functor from a category of paths to observable paths. Via a view of processes as bundles, we are able to account for weak morphisms (roughly only required to preserve observable paths) and to derive a saturation monad (on the category of presheaves over the category of paths). Weak morphisms may be encoded as strong ones via the Kleisli construction associated to the saturation monad. A general notion of weak open-map bisimulation is introduced, and results relating various notions of strong and weak bisimulation are provided. The abstract theory is accompanied by the concrete study of two key models for concurrency, the interleaving model of synchronisation trees and the independence model of labelled event structures.