A syntactical approach to weak (bi-)simulation for coalgebras

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 1, 2002, Pages 270-285

  Rothe, Jan ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; DATA STRUCTURES; FUNCTIONS; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SYNTACTICS;

BISIMULATIONS; COALGEBRA; FUNCTORS;

ALGEBRA;

EID: 18944395435     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80368-2     Document Type: Conference Paper

References (22)

1. R. Goldblatt. A calculus of terms for coalgebras of polynomial functors. In A. Corradini, M. Lenisa, and U. Montanari, editors, Coalgebraic Methods in Computer Science, volume 44 of ENTCS, pages 160-183, April 2001.
2. Gumm H.P. Birkhoffs variety theorem for coalgebras. Contributions to General Algebra. 13:2000;159-173
3. Hennessy M., Milner R. Algebraic laws for nondeterminism and concurrency. Journal of the ACM. 32:(1):January 1985;137-161
4. B. Jacobs. The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computing Science Institute, University of Nijmegen, 1999. To appear in Mathematical Structures in Computer Science.
5. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. EATCS Bulletin. 62:1997;222-259
6. A. Kurz. A co-variety-theorem for modal logic. In Proceedings of Advances in Modal Logic, Uppsala. CSLI, Stanford, 1998. Revised Version.
7. A. Kurz. Specifying coalgebras with modal logic. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, Proceedings of CMCS, volume 11 of ENTCS, Lisbon, March 1998.
8. D. Mašulović. Towards coalgebraic behaviourism. In L. Moss, editor, Proceedings of CMCS, volume 65.1 of ENTCS, 2002.
9. Milner R.A. Communicating and Concurrency. 1989;Prentice Hall, New York
10. D. Pattinson. Semantical principles in the modal logic of coalgebras. Technical report, Institut Informatik, LMU München, 2000.
11. D. Pattinson. Semantical principles in the modal logic of coalgebras. In A. Ferreira and H. Reichel, editors, Proceedings of STACS, volume 2010 of LNCS. Springer, 2001.
12. Reichel H. An approach to object semantics based on terminal coalgebras. Mathematical Structures in Computer Science. 5:1995;129-152
13. Rößiger M. Languages for coalgebras on datafunctors. ENTCS. 19:1999;55-76
14. M. Rößiger. Coalgebras, Clone Theory and Modal Logic. PhD thesis, Univ. of Dresden, Germany, 2000.
15. J. Rothe. Modal logics for coalgebraic class specification. Master's thesis, Inst. Theor. Informatik, TU Dresden, D-01062 Dresden, Germany, 2000.
16. J. Rothe and D. Mašulović. Towards weak bisimulation for coalgebras. In A. Kurz, editor, Proceedings of CMCIM, volume 68.1 of ENTCS, 2002. Submitted.
17. Rothe J., Tews H., Jacobs B. The coalgebraic class specification language. CCSL. Journal of Universal Computer Science (JUCS). 7:(2):2001;175-193
18. J. Rutten. Universal coalgebra: a theory of systems. Report CS-R9652, Centrum voor Wiskunde en Informatica, CWI, P.O. Box 94079, 1090GB Amsterdam, The Netherlands, 1996.
19. Rutten J. A note on coinduction and weak bisimilarity for while programs. Theoretical Informatics and Applications. 33:1999;393-400
20. H. Tews. Coalgebraic Specification and Verification. PhD thesis, Dresden University of Technology, 2002. Forthcomming.
21. R.J. van Glabbeek. Bounded nondeterminism and the approximation induction principle in process algebra. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proceedings of STACS 1987, number 247 in LNCS, pages 336-347. Springer, 1987. Extended Abstract.
22. Winskel G., Nielsen M. Models for concurrency. Abramsky S., Gabbay D., Maibaum T.S.E. Handbook of Logic in Computer Science. 1995;1-148 Oxford University Press