Open maps, behavioural equivalences, and congruences
Spans of open maps have been proposed by Joyal, Nielsen, and Winskel as a way of adjoining an abstract equivalence, P-bisimilarity, to a category of models of computation M, where P is an arbitrary sub-category of observations. Part of the motivation was to recast and generalise Milner's well-known strong bisimulation in this categorical setting. An issue left open was the congruence properties of P-bisimilarity. We address the following fundamental question: given a category of models of computation M and a category of observations P, are there any conditions under which algebraic constructs viewed as functors preserve P-bisimilarity? We define the notion of functors being P-factorisable, show how this ensures that P-bisimilarity is a congruence with respect to such functors. Guided by the definition of P-factorisability we show how it is possible to parametrise proofs of functors being P-factorisable with respect to the category of observations P, i.e., with respect to a behavioural equivalence.
KeywordsOpen maps P-bisimilarity P-factorisability congruences process algebra category theory
Unable to display preview. Download preview PDF.
- [BIM88]Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation Can't be Traced. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 229–239, 1988.Google Scholar
- [CN95]Allan Cheng and Mogens Nielsen. Open maps (at) work. Research Series RS-95-23, BRICS, Department of Computer Science, University of Aarhus, April 1995. 33 pp.Google Scholar
- [CN96]Allan Cheng and Mogens Nielsen. Open maps, behavioural equivalences, and congruences. Research Series RS-96-2, BRICS, Department of Computer Science, University of Aarhus, jan 1996. A short version of this paper is to appear in the proceedings of CAAP '96.Google Scholar
- [CW96]G-L. Cattani and G. Winskel. Presheaf models for concurrency. Technical report, BRICS, 1996. In preparation.Google Scholar
- [Hen88]Matthew Hennessy. Algebraic Theory of Processes. MIT Press series in the foundations of computing, 1988.Google Scholar
- [JM94]A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, (70):51–86, 1994.Google Scholar
- [JNW93]André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation and open maps. In Proc. LICS'93, Eighth Annual Symposium on Logic in Computer Science, pages 418–427, 1993.Google Scholar
- [Mil89]Robin Milner. Communication and Concurrency. Prentice Hall International Series In Computer Science, C. A. R. Hoare series editor, 1989.Google Scholar
- [NC95]Mogens Nielsen and Allan Cheng. Observe behaviour categorically. In Proc. FST&TCS 15, Fifteenth Conference on the Foundations of Software Technology & Theoretical Computer Science, pages 263–278. Springer-Verlag (LNCS 1026), Bangalore, India, December 1995.Google Scholar
- [Plo81]Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, September 1981.Google Scholar
- [Tau89]D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Springer-Verlag (LNCS 369), 1989.Google Scholar
- [WN95]Glynn Winskel and Mogens Nielsen. Models for Concurrency, volume 4, chapter 1, pages 1–148. Oxford University Press, 1995. eds. S. Abramsky, D. M. Gabbay, and T. S. E. Gabbay.Google Scholar