Modeling concurrency with partial orders
International Journal of Parallel Programming
Handbook of logic in computer science (vol. 4)
Theoretical Computer Science - Special volume on Petri nets
Axiomatic domain theory in categories of partial maps
Axiomatic domain theory in categories of partial maps
Open maps, behavioural equivalences, and congruences
Theoretical Computer Science - Special issue: trees in algebra and programming
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
A Relational Model of Non-deterministic Dataflow
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Presheaf Semantics of Value-Passing Processes
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Complete Cuboidal Sets in Axiomatic Domain Theory
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Theory of Recursive Domains with Applications to Concurrency
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
Modal event-clock specifications for timed component-based design
Science of Computer Programming
| Hi-index | 5.23 |
The aim of this paper is to harness the mathematical machinery around presheaves for the purposes of process calculi. Joyal, Nielsen and Winskel proposed a general definition of bisimulation from open maps. Here we show that open-map bisimulations within a range of presheaf models are congruences for a general process language, in which CCS and related languages are easily encoded. The results are then transferred to traditional models for processes. By first establishing the congruence results for presheaf models, abstract, general proofs of congruence properties can be provided and the awkwardness caused through traditional models not always possessing the cartesian liftings, used in the breakdown of process operations, are side stepped. The abstract results are applied to show that hereditary history-preserving bisimulation is a congruence for CCS-like languages to which is added a refinement operator on event structures as proposed by van Glabbeek and Goltz.