Coalgebraic automata theory: Basic results

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

  Kupke, Clemens ^a   Venema, Yde ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

Automata; Coalgebra; Fixed point logics; Parity games

Indexed keywords

ABSTRACTION LEVEL; AUTOMATA; COALGEBRAS; EXPLICIT CONSTRUCTIONS; FIXED-POINT LOGIC; INFINITE OBJECTS; PARITY GAMES; RECOGNIZABLE LANGUAGES; UNIVERSAL THEORY;

COMPUTER SCIENCE; COMPUTERS;

AUTOMATA THEORY;

EID: 68549093468     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:10)2008     Document Type: Article

References (30)

1. J. Adámek and V. Trnková. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.
2. A. Arnold and D. Niwiński. Rudiments of μ-calculus, volume 146 of Studies in Logic. North-Holland, 2001.
3. A. Baltag. A logic for coalgebraic simulation. In H. Reichel, editor, Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science, pages 41-60, 2000.
4. R. Bird and O. de Moor. Algebra of Programming. Prentice Hall, 1997.
5. E. Clarke, O. Grumberg, and D. Peled, editors. Model Checking. The MIT Press, 2000.
6. G. d'Agostino and M. Hollenberg. Logical questions concerning the μ-calculus. Journal of Symbolic Logic, 65: 310-332, 2000.
7. E. P. de Vink and J. J. M. M. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science, 221(1-2): 271-293, 1999.
8. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FoCS'91), pages 368-377. IEEE Computer Society Press, 1991.
9. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logic, and Infinite Games, volume 2500 of LNCS. Springer, 2002.
10. H. P. Gumm and T. Schröder. Monoid-labeled transition systems. In Coalgebraic Methods in Computer Science (CMCS 2001), volume 44 of Eletronic Notes in Theoretical Computer Science, pages 1-20, 2001.
11. B. Jacobs. Distributive laws for the coinductive solution of recursive equations. Information and Computation, 204: 561-587, 2006.
12. D. Janin and I. Walukiewicz. Automata for the modal μ-calculus and related results. In Proc. MFCS'95, pages 552-562. Springer, 1995. LNCS 969.
13. V. King, O. Kupferman, and M. Vardi. On the complexity of parity word automata. In Proceedings of the International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2001, volume 2030 of LNCS, pages 276-286, 2001.
14. C. Kissig. Decidability of S2S. Master's thesis, ILLC, University of Amsterdam, 2007.
15. C. Kupke and Y. Venema. Closure properties of coalgebra automata. In Proceedings of the Twentieth Annual IEEE Symposium on Logic in Computer Science (LICS 2005), pages 199-208. IEEE Computer Society Press, 2005.
16. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1): 1-28, 1991.
17. D. Martin. Borel determinacy. Annals of Mathematics, 102: 363-371, 1975.
18. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and control, 9: 521-530, 1966.
19. L. Moss. Coalgebraic logic. Annals of Pure and Applied Logic, 96: 277-317, 1999. (Erratum published APAL 99: 241-259, 1999.
20. A. Mostowski. Games with forbidden positions. Technical Report 78, Instytut Matematyki, Uniwersytet Gdański, Poland, 1991.
21. D. Muller and P. Schupp. Simulating alternating tree automata by nondeterministic ones. Theoretical Computer Science, 141: 69-107, 1995.
22. D. Niwiński. Fixed point characterization of infinite behavior of finite-state systems. Theoretical Computer Science, 189: 1-69, 1997.
23. N. Piterman. From nondeterministic Büchi and Streett automata to deterministic parity automata. In Proceedings of the Twentyfirst Annual IEEE Symposium on Logic in Computer Science (LICS 2006), pages 255-264. IEEE Computer Society, 2006.
24. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141: 1-35, 1969.
25. J. Rutten. Universal coalgebra: A theory of systems. Theoretical Computer Science, 249: 3-80, 2000.
26. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symposium on the Foundations of Computer Science, pages 319-327, 1988.
27. V. Trnková. Some properties of set functors. Commentationes Mathematicae Universitatis Carolinae, 10(2), 1969.
28. V. Trnková. Relational automata in a category and theory of languages. In Proc. FCT 1977, pages 340-355. Springer, 1977. LNCS 56.
29. Y. Venema. Automata and fixed point logics for coalgebras. Electronic Notes in Theoretical Computer Science, 106: 355-375, 2004.
30. Y. Venema. Automata and fixed point logic: a coalgebraic perspective. Information and Computation, 204: 637-678, 2006.