Modular Algorithms for Heterogeneous Modal Logics

Abstract. 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.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Lutz Schröder, Dirk Pattinson
• Keywords: Heterogeneous Modal Logics, ICALP 2007, Modal Logics, State-based Systems, Theoretical Computer Science