Modal Logics for Coalgebras -A Survey

The notion of coalgebra is an abstraction of state-based systems such as automata, labelled transition systems and Kripke models. It has proved that in order to state about behaviors of coalgebras, some kinds of modal logics are useful. This survey is to summarize several different ways of defining such modal languages.

[1]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[2]  Alexander Kurz.  Specifying coalgebras with modal logic , 2001, Theor. Comput. Sci..

[3]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[4]  Martin Rößiger,et al.  Coalgebras and Modal Logic , 2000, CMCS.

[5]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[6]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

[7]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[8]  Dirk Pattinson.  Expressive Logics for Coalgebras via Terminal Sequence Induction , 2004, Notre Dame J. Formal Log..

[9]  Dirk Pattinson,et al.  An Introduction to the Theory of Coalgebras , 2003 .

[10]  Krister Segerberg,et al.  An essay in classical modal logic , 1971 .

[11]  G. M. Kelly,et al.  A $2$-categorical approach to change of base and geometric morphisms I , 1991 .

[12]  Martin Rößiger.  From modal logic to terminal coalgebras , 2001 .

[13]  Bart Jacobs,et al.  Structural Induction and Coinduction in a Fibrational Setting , 1998, Inf. Comput..

[14]  M. Hollenberg.  Hennessy-Milner Classes and Process Algebra , 1994 .

[15]  Jan J. M. M. Rutten.  Relators and Metric Bisimulations , 1998, CMCS.

[16]  Dirk Pattinson,et al.  Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..