A finite model construction for coalgebraic modal logic

Journal of Logic and Algebraic Programming

Volumn 73, Issue 1-2, 2007, Pages 97-110

  Schröder, Lutz ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

Coalgebra; Decidability; finite models; Modal logic; Weak completeness

Indexed keywords

AXIOMATISATION; COALGEBRAIC MODAL; FINITE MODELS; HENNESSY-MILNER LOGIC; MODAL LOGIC; WEAK COMPLETENESS;

ALGEBRA; MODAL ANALYSIS; PROBABILISTIC LOGICS;

MATHEMATICAL MODELS;

EID: 34447338838     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2006.11.004     Document Type: Article

References (36)

1. Bartels F., Sokolova A., and de Vink E. A hierarchy of probabilistic system types. In: Gumm H.P. (Ed). Coalgebraic Methods in Computer Science, CMCS 03. Electron. Notes Theoret. Comput. Sci vol. 82 (2003), Elsevier
2. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2001), Cambridge University Press
3. Carlyle J.W., and Paz A. Realizations by stochastic finite automata. J. Comput. System Sci. 5 (1971) 26-40
4. Chellas B. Modal Logic (1980), Cambridge University Press
5. Cîrstea C., and Pattinson D. Modular construction of modal logics. In: Rutkowski L., Siekmann J., Tadeusiewicz R., and Zadeh L.A. (Eds). Concurrency Theory, CONCUR 04. Lect. Notes Comput. Sci. vol. 3170 (2004), Springer 258-275
6. D'Agostino G., and Visser A. Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic 41 (2002) 267-298
7. Demri S., and Lugiez D. Presburger modal logic is only PSPACE-complete. In: Furbach U., and Shankar N. (Eds). Automated Reasoning, IJCAR 06. Lect. Notes Art. Intell. vol. 4130 (2006), Springer 541-556
8. Fagin R., and Halpern J.Y. Reasoning about knowledge and probability. J. ACM 41 (1994) 340-367
9. Halava V., and Harju T. Undecidability in integer weighted finite automata. Fund. Inform. 38 (1999) 189-200
10. Heifetz A., and Mongin P. Probabilistic logic for type spaces. Games Econom. Behav. 35 (2001) 31-53
11. Hennessy M., and Milner R. Algebraic laws for non-determinism and concurrency. J. ACM 32 (1985) 137-161
12. Jacobs B. Towards a duality result in the modal logic of coalgebras. In: Reichel H. (Ed). Coalgebraic Methods in Computer Science, CMCS 00. Electron. Notes Theoret. Comput. Sci. vol. 33 (2000), Elsevier
13. Kupke C., Kurz A., and Pattinson D. Algebraic semantics for coalgebraic logics. In: Adámek J., and Milius S. (Eds). Coalgebraic Methods in Computer Science, CMCS 04. Electron. Notes Theoret. Comput. Sci. vol. 106 (2004), Elsevier 219-241
14. Kurz A. Specifying coalgebras with modal logic. Theoret. Comput. Sci. 260 (2001) 119-138
15. Larsen K., and Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 94 (1991) 1-28
16. Moss L. Coalgebraic logic. Ann. Pure Appl. Logic 96 (1999) 277-317
17. Mossakowski T., Schröder L., Roggenbach M., and Reichel H. Algebraic-co-algebraic specification in CoCasl. J. Logic Algebr. Program. 67 (2006) 146-197
18. Pacuit E., and Salame S. Majority logic. In: Dubois D., Welty C.A., and Williams M.-A. (Eds). Principles of Knowledge Representation and Reasoning, KR 04 (2004), AAAI Press, Menlo Park, CA 598-604
19. Pattinson D. Semantical principles in the modal logic of coalgebras. In: Ferreira A., and Reichel H. (Eds). Symposium on Theoretical Aspects of Computer Science, STACS 01. Lect. Notes Comput. Sci. vol. 2010 (2001), Springer 514-526
20. Pattinson D. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci. 309 (2003) 177-193
21. Pattinson D. Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic 45 (2004) 19-33
22. Rößiger M. Coalgebras and modal logic. In: Reichel H. (Ed). Coalgebraic Methods in Computer Science, CMCS 00. Electron. Notes Theoret. Comput. Sci. vol. 33 (2000), Elsevier
23. Rothe J., Tews H., and Jacobs B. The Coalgebraic Class Specification Language CCSL. J. Univ. Comput. Sci. 7 (2001) 175-193
24. Rutten J. Universal coalgebra: A theory of systems. Theoret. Comput. Sci. 249 (2000) 3-80
25. Schrijver A. Theory of Linear and Integer Programming (1986), Wiley Interscience
26. L. Schröder, Expressivity of coalgebraic modal logic: the limits and beyond, Theoret. Comput. Sci., to appear. Earlier version in V. Sassone (Ed.), Foundations of Software Science and Computation Structures, FOSSACS 05, Lect. Notes Comput. Sci., vol. 3441, Springer, 2005, pp. 440-454.
27. Schröder L. A finite model construction for coalgebraic modal logic. In: Aceto L., and Ingólfsdóttir A. (Eds). Foundations of Software Science and Computation Structures, FOSSACS 06. Lect. Notes Comput. Sci. vol. 3921 (2006), Springer 157-171
28. L. Schröder, A semantic PSPACE-criterion for rank 1 modal logic, Technical report, Universität Bremen, 2006.
29. L. Schröder, D. Pattinson, work in progress.
30. L. Schröder, D. Pattinson, Compositional algorithms for heterogeneous modal logics, Technical report, Universität Bremen, 2006.
31. Schröder L., and Pattinson D. PSPACE reasoning for rank-1 modal logics. Logic in Computer Science, LICS 06 (2006), IEEE 231-240. Presentation slides available under www.informatik.uni-bremen.de/~lschrode/slides/rank1pspace.pdf
32. L. Schröder, D. Pattinson, Rank 1 modal logics are coalgebraic, Technical report, Universität Bremen, 2006.
33. Tobies S. PSPACE reasoning for graded modal logics. J. Logic Comput. 11 (2001) 85-106
34. Turakainen P. On the minimization of linear space automata. Ann. Acad. Sci. Fenn. Ser. A I 506 (1972) 15 pp
35. W. van der Hoek, Modalities for reasoning about knowledge and quantities, Ph.D. thesis, Vrije Universiteit van Amsterdam, 1992.
36. Viglizzo I. Final sequences and final coalgebras for measurable spaces. In: Fiadeiro J.L., Harman N., Roggenbach M., and Rutten J. (Eds). Algebra and Coalgebra in Computer Science, CALCO 05. Lect. Notes Comput. Sci. vol. 3629 (2005), Springer 395-407