Exemplaric Expressivity of Modal Logics

This article investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains and Markov processes, as coalgebras of the powerset, finitely supported multiset, finitely supported distribution and measure functor, respectively. Expressivity means that logically indistinguishable states, satisfying the same formulas, are behaviourally indistinguishable. The investigation is based on the framework of dual adjunctions between spaces and logics and focuses on a crucial injectivity property. The approach is generic both in the choice of systems and modalities, and in the choice of a ‘base logic’. Most of these expressivity results are already known, but the applicability of the uniform setting of dual adjunctions to these particular examples is what constitutes the contribution of the article.

[1]  Erik P. de Vink,et al.  Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach , 1997, Theor. Comput. Sci..

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

[3]  Yde Venema,et al.  Stone Coalgebras , 2004, CMCS.

[4]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[5]  Bartek Klin,et al.  Coalgebraic Modal Logic Beyond Sets , 2007, MFPS.

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

[7]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[8]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[9]  Claudio Hermida,et al.  Fibrations, logical predicates and indeterminates , 1993, CST.

[10]  Alexander Kurz,et al.  Algebraic Semantics for Coalgebraic Logics , 2004, CMCS.

[11]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

[12]  Roman Fric,et al.  A Categorical Approach to Probability Theory , 2010, Stud Logica.

[13]  R. Blute,et al.  Bisimulation for Labeled Markov Processes , 1997 .

[14]  Alexander Kurz,et al.  Specifying Coalgebras with Modal Logic , 1998, CMCS.

[15]  James Worrell,et al.  Testing Semantics: Connecting Processes and Process Logics , 2006, AMAST.

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

[17]  Alexander Kurz,et al.  Coalgebraic modal logic of finite rank , 2005, Math. Struct. Comput. Sci..

[18]  Marcello M. Bonsangue,et al.  Duality for Logics of Transition Systems , 2005, FoSSaCS.

[19]  Vincent Danos,et al.  Bisimulation and cocongruence for probabilistic systems , 2006, Inf. Comput..

[20]  Corina Cîrstea,et al.  Modular construction of complete coalgebraic logics , 2007, Theor. Comput. Sci..

[21]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

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

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

[24]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[25]  Marcello M. Bonsangue,et al.  Presenting Functors by Operations and Equations , 2006, FoSSaCS.

[26]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[27]  P. Spreij.  Probability and Measure , 1996 .

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

[29]  Ernst-Erich Doberkat,et al.  Eilenberg-Moore algebras for stochastic relations , 2006, Inf. Comput..

[30]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[31]  Abbas Edalat,et al.  A logical characterization of bisimulation for labeled Markov processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[32]  Lawrence S. Moss,et al.  Coalgebraic Logic , 1999, Ann. Pure Appl. Log..

[33]  Lutz Schröder.  A Finite Model Construction for Coalgebraic Modal Logic , 2006, FoSSaCS.