EXPTIME Tableaux for the Coalgebraic Mu-Calculus


Cirstea, Corina, Kupke, Clemens and Pattinson, Dirk (2011) EXPTIME Tableaux for the Coalgebraic Mu-Calculus. Logical Methods in Computer Science

Download

[img] PDF - Submitted Version
Restricted to Registered users only

Download (311Kb) | Request a copy

Description/Abstract

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this paper, we introduce the coalgebraic Mu-calculus, an extension of the general (coalgebraic) framework with fixpoint operators. Our main results are completeness of the associated tableau calculus and EXPTIME decidability. Technically, this is achieved by reducing satisfiability to the existence of non-wellfounded tableaux, which is in turn equivalent to the existence of winning strategies in parity games. Our results are parametric in the underlying class of models and yield, as concrete applications, previously unknown complexity bounds for the probabilistic Mu-calculus and for an extension of coalition logic with fixpoints.

Item Type: Article
Divisions: Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems
Item ID: 271027
Date Deposited: 07 May 2010 10:28
Last Modified: 02 Mar 2012 13:01
Contributors: Cirstea, Corina (Author)
Kupke, Clemens (Author)
Pattinson, Dirk (Author)
Date: 2011
Status: Published
Contact Email Address: cc2@ecs.soton.ac.uk
Further Information:Google Scholar
ISI Citation Count:0
URI: http://eprints.soton.ac.uk/id/eprint/271027

Actions (login required)

View Item View Item