Modular Algorithms for Heterogeneous Modal Logics

State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show that the combination of features can be reflected algorithmically and develop modular decision procedures for heterogeneous modal logics. The modularity is achieved by formalising the underlying state-based systems as multi-sorted coalgebras and associating both a logical and an algorithmic description to a number of basic building blocks. Our main result is that logics arising as combinations of these building blocks can be decided in polynomial space provided that this is the case for the components. By instantiating the general framework to concrete cases, we obtain PSPACE decision procedures for a wide variety of structurally different logics, describing e.g. Segala systems and games with uncertain information.

[1]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[2]  Frank Wolter,et al.  Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.

[3]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[4]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

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

[6]  Markus Roggenbach,et al.  Algebraic-coalgebraic specification in CoCasl , 2006, J. Log. Algebraic Methods Program..

[7]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

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

[9]  Lutz Schröder DFKI-Lab.  A Semantic PSPACE Criterion for the Next 700 Rank-0-1 Modal Logics , 2007 .

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

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

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

[13]  Aviad Heifetz,et al.  Probability Logic for Type Spaces , 2001, Games Econ. Behav..

[14]  Edith Hemaspaandra.  Complexity transfer for modal logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[15]  Corina Cîrstea,et al.  Modular Construction of Modal Logics , 2004, CONCUR.

[16]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

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

[18]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[19]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[20]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..

[21]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, LICS.

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

[23]  Joseph Y. Halpern.  Reasoning about uncertainty , 2003 .

[24]  Albert Visser,et al.  Finality regained: A coalgebraic study of Scott-sets and multisets , 1999, Arch. Math. Log..

[25]  Carsten Lutz,et al.  E-connections of abstract description systems , 2004, Artif. Intell..

[26]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[27]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[28]  Frank Wolter,et al.  Fusions of Modal Logics Revisited , 1996, Advances in Modal Logic.

[29]  Stephan Tobies.  PSPACE Reasoning for Graded Modal Logics , 2001, J. Log. Comput..

[30]  Agi Kurucz,et al.  Combining modal logics , 2007, Handbook of Modal Logic.