<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T14:17:08Z</responseDate>
  <request identifier="1352" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1352</identifier>
        <datestamp>2024-03-06T10:32:59Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Model Checking Games for the Quantitative µ-Calculus</dc:title>
          <dc:creator>Fischer, Diana</dc:creator>
          <dc:creator>Grädel, Erich</dc:creator>
          <dc:creator>Kaiser, Lukasz</dc:creator>
          <dc:subject>Games</dc:subject>
          <dc:subject>logic</dc:subject>
          <dc:subject>model checking</dc:subject>
          <dc:subject>quantitative logics</dc:subject>
          <dc:description>We investigate quantitative extensions of modal logic and the modal&#13;
   $mu$-calculus, and study the question whether the tight connection&#13;
   between logic and games can be lifted from the qualitative logics&#13;
   to their quantitative counterparts.  It turns out that, if the&#13;
   quantitative $mu$-calculus is defined in an appropriate way&#13;
   respecting the duality properties between the logical operators,&#13;
   then its model checking problem can indeed be characterised by a&#13;
   quantitative variant of parity games.  However, these quantitative&#13;
   games have quite different properties than their classical&#13;
   counterparts, in particular they are, in general, not positionally&#13;
   determined.  The correspondence between the logic and the games&#13;
   goes both ways: the value of a formula on a quantitative transition&#13;
   system coincides with the value of the associated quantitative&#13;
   game, and conversely, the values of quantitative parity games are&#13;
   definable in the quantitative $mu$-calculus.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Diana Fischer and Erich Grädel and Lukasz Kaiser</dc:contributor>
          <dc:date>2008</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.STACS.2008.1352</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-13525</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1352</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
