<?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">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_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>Correct approximation of stationary distributions</dc:title>
   	<dc:title>LNCS</dc:title>
   	<dc:creator>Meggendorfer, Tobias ; https://orcid.org/0000-0002-1712-2165</dc:creator>
   	<dc:subject>ddc:000</dc:subject>
   	<dc:description>A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to large instances, and iterative solutions are desirable. It turns out that a naive approach, as used by current model checkers, may yield completely wrong results. We present a new approach, which utilizes recent advances in partial exploration and mean payoff computation to obtain a correct, converging approximation.</dc:description>
   	<dc:publisher>Springer Nature</dc:publisher>
   	<dc:date>2023</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/13139</dc:identifier>
   	<dc:identifier>https://research-explorer.ista.ac.at/download/13139/13148</dc:identifier>
   	<dc:source>Meggendorfer T. Correct approximation of stationary distributions. In: &lt;i&gt;TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems&lt;/i&gt;. Vol 13993. Springer Nature; 2023:489-507. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-031-30823-9_25&quot;&gt;10.1007/978-3-031-30823-9_25&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-031-30823-9_25</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0302-9743</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1611-3349</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/isbn/9783031308222</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/wos/001288688000025</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2301.08137</dc:relation>
   	<dc:rights>https://creativecommons.org/licenses/by/4.0/</dc:rights>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
