Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra

  • Authors:

  • Lutz Schr??der;Dirk Pattinson

  • Affiliations:

  • Dfki bremen and dept. of comput. sci., univ. bremen, cartesium, enrique-schmidt-str. 5, 28359 bremen, germany email: lutz.schroeder@dfki.de;Department of computing, imperial college london, 180 queen's gate, london sw7 2az, uk email: dirk@doc.ic.ac.uk

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. In this paper, we show that the combination of features can be reflected algorithmically, and we 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 algorithmic description with 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 this is also 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, for example, Segala systems and games with uncertain information.