An axiomatics for categories of transition systems as coalgebras

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 207-213

  Johnstone, Peter ^a   Power, John ^b   Tsujishita, Toru ^c   Watanabe, Hiroshi ^d   Worrell, James ^e  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c HOKKAIDO UNIVERSITY   (Japan)

^d ELECTROTECHNICAL LABORATORY   (Japan)

^e UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE;

AXIOMATICS; BISIMULATIONS; BRANCHING TRANSITION SYSTEM; COALGEBRAS; ENDOFUNCTORS; TRANSITION SYSTEM;

COMPUTER CIRCUITS;

EID: 47249146816     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705657     Document Type: Conference Paper

References (24)

1. P. Aczel, Non-well-founded sets, CSLI Lecture Notes 14, Stanford University (1988).
2. P. Aczel and P.F. Mendler, A final coalgebra theorem, Proc. CTCS, Springer Lecture Notes in Computer Science 389 (1989) 357-365.
3. J. Adamek and J. Rosicky, Locally presentable and accessible categories, L.M.S. Lecture Notes Series 189, Cambridge University Press (1994).
4. M. Barr, Terminal coalgebras in well-founded set theory, Theoretical Computer Science 114 (1993) 299-315.
5. S. Eilenberg and G.M. Kelly, Closed categories, Proc. Conf. on Categorical Algebra (La Jolla 1965), Springer-Verlag (1966) 421-562.
6. S. Eilenberg and J.C. Moore, Adjoint functors and triples, Illinois J. Math. 9 (1965) 381-398.
7. M. Fiore, A coinduction principle based on recursive datatypes based on bisimulation, Infor-mation and Computation 127 (1996) 186-198.
8. B. Jacobs and J. Rutten, A tutorial on (Co)Algebras and (Co)Induction, EATCS Bulletin 62 (1997) 222-259.
9. P.T. Johnstone, Topos Theory, L.M.S. Mathematical Monographs 10, Academic Press (1977).
10. P.T. Johnstone, A.J. Power, T. Tsujishita, H. Watanabe and J. Worrell, The structure of categories of coalgebras, in preparation.
11. A. Joyal, M. Nielsen and G. Winskel, Bisimulation and open maps, Information and Computa-Tion 127 (1996) 164-185.
12. G.M. Kelly, Basic concepts of enriched category theory, L.M.S. Lecture Notes Series 64, Cam-bridge University Press (1982).
13. G.M. Kelly, Structures defined by finite limits in the enriched context 1, Cahiers Top. et Geom. Diff. 23 (1982) 3-42.
14. S. MacLane, Categories for the working mathematician, Graduate Texts in Mathematics 5, Springer-Verlag (1971).
15. M. Makkai and R. Pare, Accessible categories: The foundations of categorical model theory, Contemporary Mathematics 104, Amer. Math Soc. (1989).
16. R. Milner, Communication and Concurrency, Prentice-Hall (1989).
17. A.J. Power and H. Watanabe, An axiomatics for categories of coalgebras, Proc. CMCS, Electronic Notes in Theoretical Computer Science 11 (to appear).
18. T. Tsujishita, Hypersets as truth values (draft).
19. T. Tsujishita and H. Watanabe, Monoidal closed- ness of the category of simulations, Hokkaido University Preprint Series in Mathematics 392 (1997).
20. D. Turi, Functorial operational semantics and its denotational dual, Ph.D. thesis, Vrije Universiteit te Amsterdam (1995).
21. H. Watanabe, A criterion for the existence of sub- object classifiers (draft).
22. H. Watanabe, The subobject classifier of the category of functional bisimulations (draft).
23. H. Watanabe, The category of functional bisimulations (in preparation).
24. J. Worrell, Toposes of coalgebras and hidden algebras, Proc. CMCS, Electronic Notes in Theo-retical Computer Science 11 (to appear).