A finite model construction for coalgebraic modal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3921 LNCS, Issue , 2006, Pages 157-171

  Schröder, Lutz ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; MODAL ANALYSIS; PROBABILISTIC LOGICS;

COALGEBRAIC MODAL LOGIC; GENERIC DECIDABILITY; GENERIC TRANSITION SYSTEMS;

FORMAL LOGIC;

EID: 33745793376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_11     Document Type: Conference Paper

References (27)

1. F. Bartels, A. Sokolova, and E. de Vink. A hierarchy of probabilistic system types. In Coalgebraic Methods in Computer Science, volume 82 of ENTCS. Elsevier, 2003.
2. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge, 2001.
3. J. W. Carlyle and A. Paz. Realizations by stochastic finite automata. J. Comput. System Sci., 5:26-40, 1971.
4. B. Chellas. Modal Logic. Cambridge, 1980.
5. C. Cîrstea and D. Pattinson. Modular construction of modal logics. In Concurrency Theory, volume 3170 of LNCS, pages 258-275. Springer, 2004.
6. G. D'Agostino and A. Visser. Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic, 41:267-298, 2002.
7. A. Heifeitz and P. Mongin. The modal logic of probability. In Theoretical Aspects of Rationality and Knowledge, pages 175-186. Morgan Kaufmann, 1998.
8. A. Heifetz and P. Mongin. Probabilistic logic for type spaces. Games and Economic Behavior, 35:31-53, 2001.
9. M. Hennessy and R. Milner. Algebraic laws for non-determinism and concurrency. J. ACM, 32:137-161, 1985.
10. B. Jacobs. Towards a duality result in the modal logic of coalgebras. In Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000.
11. C. Kupke, A. Kurz, and D. Pattinson. Algebraic semantics for coalgebraic logics. In Coalgebraic Methods in Computer Science, volume 106 of ENTCS, pages 219-241. Elsevier, 2004.
12. A. Kurz. Specifying coalgebras with modal logic. Theoret. Comput. Sci., 260: 119-138, 2001.
13. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Inform. Comput., 94:1-28, 1991.
14. T. Mossakowski, L. Schröder, M. Roggenbach, and H. Reichel. Algebraic-co-algebraic specification in CoCASL. J. Logic Algebraic Programming. To appear.
15. D. Pattinson. Semantical principles in the modal logic of coalgebras. In Symposium on Theoretical Aspects of Computer Science, volume 2010 of LNCS, pages 514-526. Springer, 2001.
16. D. Pattinson. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci., 309:177-193, 2003.
17. D. Pattinson. Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic, 45:19-33, 2004.
18. S. Popkorn. First Steps in Modal Logic. Cambridge, 1994.
19. M. Rößiger. Coalgebras and modal logic. In Coalgebraic Methods in Computer Science, volume 33 of ENTCS. Elsevier, 2000.
20. J. Rothe, H. Tews, and B. Jacobs. The Coalgebraic Class Specification Language CCSL. J. Universal Comput. Sci., 7:175-193, 2001.
21. J. Rutten. Universal coalgebra: A theory of systems. Theoret. Comput. Sci., 249:3-80, 2000.
22. A. Schrijver. Theory of linear and integer programming. Wiley Interscience, 1986.
23. L. Schröder. Expressivity of coalgebraic modal logic: the limits and beyond. In Foundations of Software Science And Computation Structures, volume 3441 of LNCS, pages 440-454. Springer, 2005.
24. L. Schröder and D. Pattinson. PSPACE reasoning for coalgebraic modal logic. In preparation.
25. S. Tobies. PSPACE reasoning for graded modal logics. J. Logic Computation, 11:85-106, 2001.
26. P. Turakainen. On the minimization of linear space automata. Ann. Acad. Sci. Fenn. Ser. A I, 506, 1972. 15 pp.
27. I. Viglizzo. Final sequences and final coalgebras for measurable spaces. In Algebra and Coalgebra in Computer Science, volume 3629 of LNCS, pages 395-407. Springer, 2005.