Model Checking Games for the Quantitative mu-Calculus

Simple item page
dc.creatorFischer, Diana
dc.creatorGrädel, Erich
dc.creatorKaiser, Lukasz
dc.date2008-02-20
dc.date.accessioned2026-07-07T09:22:05Z
dc.date.available2026-07-07T09:22:05Z
dc.descriptionWe investigate quantitative extensions of modal logic and the modal mu-calculus, and study the question whether the tight connection between logic and games can be lifted from the qualitative logics to their quantitative counterparts. It turns out that, if the quantitative mu-calculus is defined in an appropriate way respecting the duality properties between the logical operators, then its model checking problem can indeed be characterised by a quantitative variant of parity games. However, these quantitative games have quite different properties than their classical counterparts, in particular they are, in general, not positionally determined. The correspondence between the logic and the games goes both ways: the value of a formula on a quantitative transition system coincides with the value of the associated quantitative game, and conversely, the values of quantitative parity games are definable in the quantitative mu-calculus.
dc.identifierhttps://arxiv.org/abs/0802.2871
dc.identifierhttp://arxiv.org/abs/0802.2871
dc.identifierDans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155254
dc.subjectLogic in Computer Science
dc.subjectComputer Science and Game Theory
dc.titleModel Checking Games for the Quantitative mu-Calculus
dc.typetext

Files

Collections

arXiv