<?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-08-16T20:27:28Z</responseDate>
  <request identifier="2323" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2323</identifier>
        <datestamp>2024-03-06T10:33:17Z</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>Verification and Refutation of Probabilistic Specifications via Games</dc:title>
          <dc:creator>Kattenbelt, Mark</dc:creator>
          <dc:creator>Huth, Michael</dc:creator>
          <dc:subject>Probabilistic model checking</dc:subject>
          <dc:subject>Markov decision processes</dc:subject>
          <dc:subject>Abstraction preorder</dc:subject>
          <dc:subject>Stochastic two-player games</dc:subject>
          <dc:description>We develop an abstraction-based framework&#13;
to check probabilistic specifications of Markov Decision Processes (MDPs) using&#13;
the stochastic two-player game abstractions (\ie ``games'') developed by&#13;
Kwiatkowska et al.\ as a foundation.&#13;
&#13;
We define an abstraction preorder for these game abstractions which&#13;
enables us to identify many new game abstractions for each MDP ---&#13;
ranging from compact and imprecise to complex and precise.&#13;
This added ability to trade precision for efficiency&#13;
is crucial for scalable software model&#13;
checking, as precise abstractions are expensive to construct in&#13;
practice.&#13;
&#13;
Furthermore, we develop a four-valued probabilistic computation tree&#13;
logic (PCTL) semantics for game abstractions.&#13;
&#13;
Together, the preorder and PCTL semantics comprise a powerful verification and&#13;
refutation framework for arbitrary PCTL properties of MDPs.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Mark Kattenbelt and Michael Huth</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)</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.FSTTCS.2009.2323</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-23233</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2323</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
