<?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-20T14:48:41Z</responseDate>
  <request identifier="4612" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4612</identifier>
        <datestamp>2024-03-06T10:26:11Z</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>Reachability Problems for Infinite-State Systems (Dagstuhl Seminar 14141)</dc:title>
          <dc:creator>Esparza, Javier</dc:creator>
          <dc:creator>Finkel, Alain</dc:creator>
          <dc:creator>McKenzie, Pierre</dc:creator>
          <dc:creator>Ouaknine, Joel</dc:creator>
          <dc:subject>Infinite-State Systems</dc:subject>
          <dc:subject>Reachability Problems</dc:subject>
          <dc:subject>Formal Verification</dc:subject>
          <dc:subject>Well-Structured Transition Systems</dc:subject>
          <dc:subject>Counter Machines</dc:subject>
          <dc:subject>Vector Addition Systems</dc:subject>
          <dc:subject>Timed Systems</dc:subject>
          <dc:description>This report documents the program and the outcomes of Dagstuhl Seminar 14141 "Reachability Problems for Infinite-State Systems", held from March 30th until April 4th, 2014. The seminar gathered 44 participants and the program consisted of 34 presentations. Participants were asked to contribute open questions prior and&#13;
during the seminar. A list of these open questions appears in a separate section of the present report. This list generated collaborations among participants and gave rise to research publications solving (partially), for example, question 5.13, namely "what functions are computable by VASS?"</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Javier Esparza and Alain Finkel and Pierre McKenzie and Joel Ouaknine</dc:contributor>
          <dc:date>2014</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 4, Issue 3 (2014)</dc:relation>
          <dc:type>Article</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/DagRep.4.3.153</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-46121</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.3.153</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
