Non-deterministic kleene coalgebras

Logical Methods in Computer Science

Volumn 6, Issue 3, 2010, Pages 1-39

  Silva, Alexandra ^a   Bonsangue, Marcello ^b   Rutten, Jan ^a,c,d  

^a CWI   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

^d RUN   (Netherlands)

Author keywords

Axiomatization; Coalgebra; Kleene's theorem

Indexed keywords

AXIOMATI-SATION; COALGEBRAS; COMPLETE AXIOMATIZATIONS; DETERMINISTIC FINITE AUTOMATA; DETERMINISTICS; KLEENE'S THEOREM; LABELLED TRANSITION SYSTEMS; MEALY MACHINES; REGULAR EXPRESSIONS; SOUND AND COMPLETE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 77957603491     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-6(3:23)2010     Document Type: Article

References (36)

1. Luca Aceto and Matthew Hennessy. Termination, deadlock, and divergence. J. ACM, 39(1):147-187, 1992. pages 21, 31
2. Jirí Adámek, Dominik Lücke, and Stefan Milius. Recursive coalgebras of finitary functors. ITA, 41(4):447-462, 2007. pages 32
3. Jirí Adámek, Stefan Milius, and Jiri Velebil. Free iterative theories: A coalgebraic view. MathematicalStructures in Computer Science, 13(2):259-320, 2003. pages 36
4. Jirí Adámek, Stefan Milius, and Jiri Velebil. Iterative algebras at work. Mathematical Structures inComputer Science, 16(6):1085-1131, 2006. pages 36
5. S.L. Bloom and Z. Ésik. Iteration theories: the equational logic of iterative processes. EATCS Monographson Theoretical Computer Science. Springer, 1993. pages 36
6. Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, and Alexandra Silva. Deriving syntaxand axioms for quantitative regular behaviours. In Mario Bravetti and Gianluigi Zavattaro, editors,CONCUR, volume 5710 of Lecture Notes in Computer Science, pages 146-162. Springer, 2009. pages 37
7. Marcello M. Bonsangue and Alexander Kurz. Duality for logics of transition systems. In VladimiroSassone, editor, FoSSaCS, volume 3441 of Lecture Notes in Computer Science, pages 455-469. Springer, 2005. pages 37
8. Marcello M. Bonsangue and Alexander Kurz. Presenting functors by operations and equations. In LucaAceto and Anna Ingólfsdóttir, editors, FoSSaCS, volume 3921 of LNCS, pages 172-186. Springer, 2006.pages 37
9. Marcello M. Bonsangue, Jan J. M. M. Rutten, and Alexandra Silva. Coalgebraic logic and synthesis ofMealy machines. In Roberto M. Amadio, editor, FoSSaCS, volume 4962 of Lecture Notes in ComputerScience, pages 231-245. Springer, 2008. pages 1, 4, 35, 37
10. Marcello M. Bonsangue, Jan J. M. M. Rutten, and Alexandra Silva. An algebra for Kripke polynomialcoalgebras. In LICS, pages 49-58. IEEE Computer Society, 2009. pages 2, 37, 38
11. Marcello M. Bonsangue, Jan J. M. M. Rutten, and Alexandra Silva. A Kleene theorem for polynomialcoalgebras. In Luca de Alfaro, editor, FOSSACS, volume 5504 of Lecture Notes in Computer Science,pages 122-136. Springer, 2009. pages 2, 37
12. Franck van Breugel and James Worrell. Approximating and computing behavioural distances in probabilistictransition systems. Theor. Comput. Sci., 360(1-3):373-385, 2006. pages 36
13. Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11(4):481-494, 1964.pages 8, 10, 15, 27, 37
14. Corina Cîrstea and Dirk Pattinson. Modular construction of modal logics. In Philippa Gardner andNobuko Yoshida, editors, CONCUR, volume 3170 of Lecture Notes in Computer Science, pages 258-275. Springer, 2004. pages 37
15. C.C. Elgot. Monadic computation and iterative algebraic theories. In H.E. Rose and J.C. Shepherdson,editors, Logic Colloquium '73. North-Holland Publishers, 1975. pages 36
16. Rob J. van Glabbeek, Scott A. Smolka, and Bernhard Steffen. Reactive, generative and stratified modelsof probabilistic processes. Inf. Comput., 121(1):59-80, 1995. pages 38
17. Robert Goldblatt. Equational logic of polynomial coalgebras. In Philippe Balbiani, Nobu-Yuki Suzuki,Frank Wolter, and Michael Zakharyaschev, editors, Advances in Modal Logic 4, pages 149-184. King'sCollege Publications, 2002. pages 37
18. Claudio Hermida and Bart Jacobs. Structural induction and coinduction in a fibrational setting. Inf.Comput., 145(2):107-152, 1998. pages 5
19. Bart Jacobs. Many-sorted coalgebraic modal logic: a model-theoretic study. ITA, 35(1):31-59, 2001.pages 37
20. Bart Jacobs. A bialgebraic review of deterministic automata, regular expressions and languages. InKokichi Futatsugi, Jean-Pierre Jouannaud, and José Meseguer, editors, Essays Dedicated to Joseph A.Goguen, volume 4060 of Lecture Notes in Computer Science, pages 375-404. Springer, 2006. pages 36
21. Stephen Kleene. Representation of events in nerve nets and finite automata. Automata Studies, pages3-42, 1956. pages 1, 36
22. Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In Logicin Computer Science, pages 214-225, 1991. pages 1, 36
23. Dexter Kozen. On the coalgebraic theory of Kleene algebra with tests. Technical Reporthttp://hdl.handle.net/1813/10173, Computing and Information Science, Cornell University, March2008. pages 31, 37, 38
24. Clemens Kupke and Yde Venema. Coalgebraic automata theory: Basic results. Logical Methods inComputer Science, 4(4), 2008. pages 37
25. Alexander Kurz, Marina Lenisa, and Andrzej Tarlecki, editors. Algebra and Coalgebra in Computer Sci-ence, Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings,volume 5728 of Lecture Notes in Computer Science. Springer, 2009. pages 39
26. Dorel Lucanu, Eugen-Ioan Goriac, Georgiana Caltais, and Grigore Rosu. Circ: A behavioral verificationtool based on circular coinduction. In Kurz et al. [25], pages 433-442. pages 38
27. Stefan Milius. A sound and complete calculus for finite stream circuits. In LICS, 2010. To appear. pages36
28. Robin Milner. A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci., 28(3):439-466, 1984. pages 1, 7, 36
29. Larry Moss. Coalgebraic logic. Annals of Pure and Applied Logic, 96, 1999. pages 37
30. Martin Rößiger. Coalgebras and modal logic. Electronic Notes in Theoretical Computer Science, 33, 2000. pages 37
31. Jan J. M. M. Rutten. Universal coalgebra: a theory of systems. Theor. Comput. Sci., 249(1):3-80, 2000.pages 2, 4, 5, 6, 25
32. Jan J.M.M. Rutten. Automata and coinduction (an exercise in coalgebra). In D. Sangiorgi and R. de Simone,editors, Proceedings of CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages194-218, 1998. pages 8, 36, 37
33. Arto Salomaa. Two complete axiom systems for the algebra of regular events. J. ACM, 13(1):158-169, 1966. pages 36
34. Lutz Schröder and Dirk Pattinson. Modular algorithms for heterogeneous modal logics. In Lars Arge,Christian Cachin, Tomasz Jurdzinski, and Andrzej Tarlecki, editors, ICALP, volume 4596 of LectureNotes in Computer Science, pages 459-471. Springer, 2007. pages 37
35. Sam Staton. Relating coalgebraic notions of bisimulation. In Kurz et al. [25], pages 191-205. pages 5
36. Daniele Turi and Jan J. M. M. Rutten. On the foundations of final coalgebra semantics: non-wellfoundedsets, partial orders, metric spaces. Mathematical Structures in Computer Science, 8(5):481-540, 1998. pages 36