Open maps, behavioural equivalences, and congruences

Theoretical Computer Science

Volumn 190, Issue 1, 1998, Pages 87-112

  Cheng, Allan ^a   Nielsen, Mogens ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Bisimulation; Category theory; Congruences; Open maps; Process algebra

Indexed keywords

EID: 0038726197     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00085-6     Document Type: Article

References (15)

1. P. Aczel, P.F. Mendler, A final coalgebra theorem, in: Category and Computer Science, Lecture Notes in Computer Science, vol. 389, Springer, Berlin, 1989, pp. 357-365.
2. B. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be Traced, in: conf. Record of the 15th Ann. ACM Symp. on Principles of Programming Languages, 1988, pp. 229-239.
3. G-L. Cattani, G. Winskel, Presheaf models for concurrency, Tech. Report, BRICS, 1996, to appear.
4. M. Fiore, A coinduction principle for recursive data types based on bisimulation, in: Proc. LICS'93, 8th Ann. Symp. on Logic in Computer Science, 1993, pp. 110-119.
5. M. Hennessy, Algebraic Theory of Processes, Series in the Foundations of Computing, MIT Press, Cambridge, MA, 1988.
6. A. Joyal, I. Moerdijk, A completeness theorem for open maps, Ann. Pure App. Logic 70 (1994) 51-86.
7. A. Joyal, M. Nielsen, G. Winskel, Bisimulation and open maps, Inform. Comput. 127 (1996) 164-185.
8. S. MacLane, Categories for the working mathematician, Graduate Texts in Mathematics, Springer, Berlin, 1971.
9. R. Milner, Communication and Concurrency, in: C.A.R. Hoare (Ed.), Prentice-Hall International Series in Computer Science, 1989.
10. M. Nielsen, A. Cheng, Observe behaviour categorically, in: Proc. FST&TCS 15, 15th Conf. on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, vol. 1026, Springer, Berlin, 1995, pp. 263-278.
11. A. Pitts, A co-induction principle for recursively defined domains, Theoret. Comput. Sci. 124 (1994) 195-219.
12. G.D. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI FN-19, Computer Science Department, Aarhus University, September 1981.
13. J. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: Proc. REX Workshop A Decade of Concurrency - Reflections and Perspectives, Lecture Notes in Computer Science, vol. 803, Springer, Berlin, 1994, pp. 229-239.
14. D. Taubner, Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Lecture Notes in Computer Science, vol. 369, Springer, Berlin, 1989.
15. G. Winskel, M. Nielsen, in: S. Abramsky, D.M. Gabbay, T.S.E. Gabbay (Eds.), Handbook of Logic and the Foundations of Computer Science, vol. 4, Chapter 1, Models for Concurrency, Oxford University Press, Oxford, 1995, pp. 1-148.