Modular construction of complete coalgebraic logics

Theoretical Computer Science

Volumn 388, Issue 1-3, 2007, Pages 83-108

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

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Coalgebra; Completeness; Modal logic; Probabilistic systems

Indexed keywords

MODULAR CONSTRUCTION; PROBABILISTIC LOGICS; SEMANTICS; SYNTACTICS;

AXIOMATISATION; COALGEBRA; COMPLETENESS; MODAL LOGIC; MODULAR FASHION; PROBABILISTIC SYSTEMS;

ALGEBRA;

EID: 35748944837     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.06.002     Document Type: Article

References (32)

1. Aczel P., and Mendler N. A final coalgebra theorem. In: Pitt D.H., et al. (Ed). Category Theory and Computer Science. LNCS vol. 389 (1989), Springer
2. F. Bartels, On generalised coinduction and probabilistic specification formats, Ph.D. Thesis, CWI, Amsterdam, 2004
3. Bartels F., Sokolova A., and de Vink E. A hierarchy of probabilistic system types. In: Gumm H.P. (Ed). Proc. CMCS 2003. ENTCS vol. 82 (2003), Elsevier
4. Blackburn P., de Rijke M., and Venema Y. Modal Logic (2000), Cambridge University Press
5. Cǐrstea C. On expressivity and compositionality in logics for coalgebras. In: Gumm H.P. (Ed). Proc. CMCS 2003. ENTCS vol. 82 (2003), Elsevier
6. Cǐrstea C. A compositional approach to defining logics for coalgebras. Theoretical Computer Science 327 1-2 (2004) 45-69
7. Clarke E., and Emerson E. Synthesis of synchronisation skeletons for branching temporal logics. Workshop on Logics of Programs. LNCS vol. 131 (1981), Springer
8. de Vink E., and Rutten J. Bisimulation for probabilistic transition systems: A coalgebraic approach. Theoretical Computer Science 221 (1999) 271-293
9. Desharnais J., Edalat A., and Panangaden P. Bisimulation for labelled Markov processes. Information and Computation 179 (2002) 163-193
10. Heifetz A., and Mongin P. Probability logic for type spaces. Games and Economic Behaviour 35 (2001) 31-53
11. Jacobs B. Many-sorted coalgebraic modal logic: A model-theoretic study. Theoretical Informatics and Applications 35 1 (2001) 31-59
12. Jacobs B. Categorical logic and type theory. Studies in Logic and the Foundations of Mathematics vol. 141 (1999), North Holland
13. Jonsson B., Larsen K.G., and Yi W. Probabilistic extensions of process algebras. In: Bergstra J.A., et al. (Ed). Handbook of Process Algebra (2001), Elsevier 685-710 (Chapter 11)
14. Kick M. Bialgebraic modelling of timed processes. In: Widmayer P., et al. (Ed). Proc. ICALP 2002. LNCS vol. 2380 (2002), Springer
15. Klin B. Coalgebraic modal logic beyond sets. In: Fiore M. (Ed). Proc. MFPS XXIII. ENTCS vol. 173 (2007), Elsevier
16. Kozen D. Results on the propositional mu-calculus. Theoretical Computer Science 27 (1983) 333-354
17. Kurz A. Specifying coalgebras with modal logic. Theoretical Computer Science 260 1-2 (2001) 119-138
18. Kupke C., Kurz A., and Pattinson D. Algebraic semantics for coalgebraic modal logic. Electronic Notes in Theoretical Computer Science 106 (2004) 219-241
19. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 (1991) 1-28
20. Milner R. Communication and Concurrency. International Series in Computer Science (1989), Prentice Hall
21. Moss L.S. Coalgebraic logic. Annals of Pure and Applied Logic 96 (1999) 277-317
22. P. Naur, B. Randell (Eds.), Software Engineering: Report of a Conference Sponsored by the NATO Science Committee, Garmisch, Germany, 7-11 Oct., 1968. Scientific Affairs Division, NATO, 1969
23. Park D. Concurrency and automata on infinite sequences. Proceedings of the 5th GI Conference. LNCS vol. 104 (1981), Springer
24. Pattinson D. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoretical Computer Science 309 1-3 (2003) 177-193
25. Pattinson D. Expressive logics for coalgebras via terminal sequence induction. Notre Dame Journal of Formal Logic 45 1 (2004) 19-33
26. Rockafellar R.T. Convex Analysis (1970), Princeton University Press
27. Rößiger M. From modal logic to terminal coalgebras. Theoretical Computer Science 260 (2001) 209-228
28. Rutten J.J.M.M. Universal coalgebra: A theory of systems. Theoretical Computer Science 249 (2000) 3-80
29. R. Segala, Modelling and verification of randomized distributed real-time systems, Ph.D. Thesis, Massachusetts Institute of Technology, 1995
30. Turi D., and Plotkin G. Towards a mathematical operational semantics. Proc. 12th LICS Conference (1999), IEEE, Computer Society Press 280-291
31. van Glabbeek R.J., Smolka S.A., and Steffen B. Reactive, generative, and stratified models of probabilistic processes. Information and Computation 121 (1995) 59-80
32. Worrell J. On the final sequence of a finitary set functor. Theoretical Computer Science 338 (2005) 184-199