EXPTIME Tableaux for the Coalgebraic Mu-Calculus

Cirstea, Corina, Kupke, Clemens and Pattinson, Dirk, (2009) EXPTIME Tableaux for the Coalgebraic Mu-Calculus Grädel, Erich and Kahle, Reinhard (eds.) At Computer Science Logic 2009. , pp. 179-193.


[img] PDF csl2009final.pdf - Accepted Manuscript
Download (216kB)


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: Conference or Workshop Item (Paper)
Venue - Dates: Computer Science Logic 2009, 2009-01-01
Organisations: Electronic & Software Systems
ePrint ID: 267695
Date :
Date Event
Date Deposited: 22 Jul 2009 12:57
Last Modified: 17 Apr 2017 18:43
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/267695

Actions (login required)

View Item View Item