Abstract
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.
This work has been supported by The Danish Research Foundation, The Danish Research Academy, and BRICS
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
G-L. Cattani and G. Winskel. Presheaf models for concurrency. Technical report, BRICS, 1996. In preparation.
Matthew Hennessy. Algebraic Theory of Processes. MIT Press series in the foundations of computing, 1988.
A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, (70):51–86, 1994.
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.
Robin Milner. Communication and Concurrency. Prentice Hall International Series In Computer Science, C. A. R. Hoare series editor, 1989.
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.
Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, September 1981.
D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Springer-Verlag (LNCS 369), 1989.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, A., Nielsen, M. (1996). Open maps, behavioural equivalences, and congruences. In: Kirchner, H. (eds) Trees in Algebra and Programming — CAAP '96. CAAP 1996. Lecture Notes in Computer Science, vol 1059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61064-2_42
Download citation
DOI: https://doi.org/10.1007/3-540-61064-2_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61064-9
Online ISBN: 978-3-540-49944-2
eBook Packages: Springer Book Archive