An algebra for kripke polynomial coalgebras

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 49-58

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

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATIZATION; BISIMULATIONS; COALGEBRAIC; COALGEBRAS; COPRODUCT; DETERMINISTIC AUTOMATA; DETERMINISTIC FINITE AUTOMATA; EQUATIONAL SYSTEMS; KRIPKE POLYNOMIAL FUNCTORS; LABELLED TRANSITION SYSTEMS; REGULAR EXPRESSIONS;

COMPUTER SCIENCE; DYNAMICAL SYSTEMS; FINITE AUTOMATA; LINGUISTICS; POLYNOMIALS; SPECIFICATION LANGUAGES; SPECIFICATIONS; TRANSLATION (LANGUAGES);

ROBOTS;

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

References (16)

1. S. Abramsky. Domain Theory in Logical Form. Ann. Pure Appl. Logic, 51(1-2):1-77, 1991.
2. L. Aceto and M. Hennessy. Termination, Deadlock, and Divergence. J. ACM, 39(1):147-187, 1992.
3. P. Aczel and N. Mendler. A final coalgebra theorem. In CTCS, LNCS 389 , pp. 357-365, 1989.
4. M. Bonsangue, A. Kurz. Presenting Functors by Operations and Equations. In FoSSaCS, LNCS 3921, pp. 172-186, 2006.
5. M. Bonsangue, J. Rutten, and A. Silva. A Kleene theorem for polynomial coalgebras. In FoSSaCS, 2009. To appear.
6. B. Jacobs. Many-sorted coalgebraic modal logic: a model-theoretic study. ITA, 35(1):31-59, 2001.
7. B. Jacobs. A bialgebraic review of deterministic automata, regular expressions and languages. In Goguen Festschrift, LNCS 4060, pp. 375-404, 2006.
8. D. Lucanu and G. Rosu. CIRC : A Circular Coinductive Prover. In CALCO, LNCS 4624, pp. 372- 378, 2007.
9. D. Kozen. A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Inf. Comput. 110(2):366-390, 1994.
10. D. Kozen. On the coalgebraic theory of Kleene algebra with tests. Tech. Rep. 10173, CIS, Cornell University, 2008.
11. C. Kupke and Y. Venema, Coalgebraic Automata Theory: Basic Results. LMCS, 4(4), 2008.
12. D. Pattinson. Coalgebraic modal logic: soundness, completeness and decidability of local consequence. In TCS, 309(1-3):177-193, 2003.
13. M. Rößiger. Coalgebras and modal logic. In CMCS, ENTCS 33, pp. 294-315, 2000.
14. J. Rutten. Universal coalgebra: a theory of systems. TCS, 249(1):3-80, 2000.
15. L. SchRöder. A Finite Model Construction for Coalgebraic Modal Logic. In FoSSaCS, LNCS 3921, pp. 157-171, 2006.
16. D. Turi and G. Plotkin. Towards a Mathematical Operational Semantics. In LICS, pp. 280-291, IEEE, 1997.