Modular construction of modal logics

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

Volumn 3170, Issue , 2004, Pages 258-275

  Cîrstea, Corina ^a   Pattinson, Dirk ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MODULAR CONSTRUCTION; SEMANTICS;

COALGEBRAS; MODAL LOGIC; MODULAR APPROACH; PROBABILISTIC SYSTEMS; PROOF SYSTEM; STATE BASED;

FORMAL LOGIC;

EID: 35048865778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_17     Document Type: Article

References (32)

1. P. Aczel and N. Mendier. A final coalgebra theorem. In D. H. Pitt et al, editor, Category Theory and Computer Science, volume 389 of LNCS. Springer, 1989.
2. F. Bartels. On generalised coinduction and probabilistic specification formats. PhD thesis, CWI, Amsterdam, 2004.
3. F. Bartels, A. Sokolova, and E. de Vink. A hierarchy of probabilistic system types. In H.P. Gumm, editor, Proc. CMCS 2003, volume 82 of ENTCS. Elsevier, 2003.
4. M. Bidoit, M. V. Cengarle, and R. Hennicker. Proof systems for structured specifications and their refinements. In H. J. Kreowski, E. Astesiano, and B. Krieg-Brückner, editors, Algebraic Foundations of Systems Specification, IFIP State-of-the-Art Reports, pages 385-434. Springer, 1999.
5. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2000.
6. T. Borzyszkowski. Logical systems for structured specifications. Theoret. Comput. Sci., 286(2):197-245, 2002.
7. C. Caleiro. Combining Logics. PhD thesis, 2002.
8. C. Cîrstea. On expressivity and compositionality in logics for coalgebras. In H.P. Gumm, editor, Proc. CMCS 2003, volume 82 of ENTCS. Elsevier, 2003.
9. E. Clarke and E. Emerson. Synthesis of synchronisation skeletons for branching temporal logics. In Workshop on Logics of Programs, volume 131 of LNCS. Springer, 1981.
10. E. de Vink and J. Rutten. Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoret. Comput. Sci., 221:271-293, 1999.
11. D. Gabbay. Fibring Logics. Oxford University Press, 1998.
12. A. Heifetz and P. Mongin. Probability logic for type spaces. Games and Economic Behaviour, 35:31-53, 2001.
13. B. Jacobs. Many-sorted coalgebraic modal logic: a model-theoretic study. Theor. Inform. Appl., 35(1):31-59, 2001.
14. M. Kick. Bialgebraic modelling of timed processes. In P. Widmayer, F. Ruiz, R. Bueno, M. Hennessy, S. Eidenbenz, and R. Conejo, editors, Proc. ICALP 2002, volume 2380 of LNCS. Springer, 2002.
15. D. Kozen. Results on the prepositional mu-calculus. Theoret. Comput. Sci., 27:333-354, 1983.
16. A. Kurz. Specifying Coalgebras with Modal Logic. Theoret. Comput. Sci., 260(1-2):119-138, 2001.
17. A. Kurz and D. Pattinson. Definability, canonical models, and compactness for finitary coalgebraic modal logic. In L.S. Moss, editor, Proc. CMOS 2002, volume 65 of ENTCS. Elsevier, 2002.
18. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Inform. and Comput., 94:1-28, 1991.
19. R. Milner. Communication and Concurrency. International series in computer science. Prentice Hall, 1989.
20. L.S. Moss. Coalgebraic logic. Ann. Pure Appl. Logic, 96:277-317, 1999.
21. P. Naur and B. Randell, editors. Software Engineering: Report of a conference sponsored by the NATO Science Committee, Garmisch, Germany, 7-11 Oct. 1968. Scientific Affairs Division, NATO, 1969.
22. D. Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI Conference, volume 104 of LNCS. Springer, 1981.
23. D. Pattinson. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci., 309(1-3):177-193, 2003.
24. D. Pattinson. Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic, 2004. To appear.
25. R.T. Rockafellar. Convex Analysis. Princeton University Press, 1970.
26. M. Rößiger. From Modal Logic to Terminal Coalgebras. Theoret. Comput. Sci., 260:209-228, 2001.
27. J.J.M.M. Rutten. Universal coalgebra: A theory of systems. Theoret. Comput. Sci., 249:3-80, 2000.
28. R. Segala. Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
29. th LICS Conference, pages 280-291. IEEE, Computer Society Press, 1999.
30. M. Wirsing. Algebraic specification. In J. van Leuween, editor, Handbook of Theoretical Computer Science. Elsevier, 1990.
31. J. Worrell. On the Final Sequence of an Accessible Set Functor. Theoret. Comput. Sci., 2003. To appear.
32. A. Zanardo, A. Sernadas, and C. Sernadas. Fibring: Completeness preservation. J. Symbolic Logic, 66(1):414-439, 2001.