<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01275991</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T20:37:36+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Ideal Decompositions for Vector Addition Systems</title>
            <author role="aut">
              <persName>
                <forename type="first">Jérôme</forename>
                <surname>Leroux</surname>
              </persName>
              <email type="md5">73a7ed78940ee7593dff1b9cff1c358d</email>
              <email type="domain">labri.fr</email>
              <idno type="idhal" notation="string">jerome-leroux</idno>
              <idno type="idhal" notation="numeric">1216</idno>
              <idno type="halauthorid" notation="string">2532-1216</idno>
              <idno type="IDREF">https://www.idref.fr/079082742</idno>
              <affiliation ref="#struct-3102"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sylvain</forename>
                <surname>Schmitz</surname>
              </persName>
              <email type="md5">47e63dd923234eec56209836ead9fff3</email>
              <email type="domain">irif.fr</email>
              <idno type="idhal" notation="string">sylvain-schmitz</idno>
              <idno type="idhal" notation="numeric">617</idno>
              <idno type="halauthorid" notation="string">12120-617</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4101-4308</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.com/citations?user=mMktcHwAAAAJ&amp;hl=en</idno>
              <idno type="IDREF">https://www.idref.fr/122252020</idno>
              <idno type="ARXIV">https://arxiv.org/a/schmitz_s_1</idno>
              <affiliation ref="#struct-56043"/>
              <affiliation ref="#struct-2571"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Sylvain</forename>
                <surname>Schmitz</surname>
              </persName>
              <email type="md5">47e63dd923234eec56209836ead9fff3</email>
              <email type="domain">irif.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-02-18 15:55:28</date>
              <date type="whenModified">2025-05-26 14:36:02</date>
              <date type="whenReleased">2016-02-18 15:55:28</date>
              <date type="whenProduced">2016</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="122471">
                <persName>
                  <forename>Sylvain</forename>
                  <surname>Schmitz</surname>
                </persName>
                <email type="md5">47e63dd923234eec56209836ead9fff3</email>
                <email type="domain">irif.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01275991</idno>
            <idno type="halUri">https://inria.hal.science/hal-01275991</idno>
            <idno type="halBibtex">leroux:hal-01275991</idno>
            <idno type="halRefHtml">&lt;i&gt;STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science&lt;/i&gt;, 2016, Orléans, France. pp.1--13, &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.STACS.2016.1"&gt;&amp;#x27E8;10.4230/LIPIcs.STACS.2016.1&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science, 2016, Orléans, France. pp.1--13, &amp;#x27E8;10.4230/LIPIcs.STACS.2016.1&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="ENSEIRB">Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="UNIV-BORDEAUX">Université de Bordeaux</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="TESTBORDEAUX">TESTBORDEAUX</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="INRIA-SACLAY-2015" corresp="UNIV-PARIS-SACLAY">INRIA-SACLAY-2015</idno>
            <idno type="stamp" n="ENS-CACHAN-SACLAY" corresp="UNIV-PARIS-SACLAY">ENS-CACHAN-SACLAY</idno>
            <idno type="stamp" n="LSV-AUTO">Laboratoire Spécification et Vérification</idno>
            <idno type="stamp" n="FARMAN">Institut Farman</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="UNIVERSITE-BORDEAUX">Université de Bordeaux</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="1">Yes</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Ideal Decompositions for Vector Addition Systems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jérôme</forename>
                    <surname>Leroux</surname>
                  </persName>
                  <email type="md5">73a7ed78940ee7593dff1b9cff1c358d</email>
                  <email type="domain">labri.fr</email>
                  <idno type="idhal" notation="string">jerome-leroux</idno>
                  <idno type="idhal" notation="numeric">1216</idno>
                  <idno type="halauthorid" notation="string">2532-1216</idno>
                  <idno type="IDREF">https://www.idref.fr/079082742</idno>
                  <affiliation ref="#struct-3102"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvain</forename>
                    <surname>Schmitz</surname>
                  </persName>
                  <email type="md5">47e63dd923234eec56209836ead9fff3</email>
                  <email type="domain">irif.fr</email>
                  <idno type="idhal" notation="string">sylvain-schmitz</idno>
                  <idno type="idhal" notation="numeric">617</idno>
                  <idno type="halauthorid" notation="string">12120-617</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4101-4308</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.com/citations?user=mMktcHwAAAAJ&amp;hl=en</idno>
                  <idno type="IDREF">https://www.idref.fr/122252020</idno>
                  <idno type="ARXIV">https://arxiv.org/a/schmitz_s_1</idno>
                  <affiliation ref="#struct-56043"/>
                  <affiliation ref="#struct-2571"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>STACS 2016 - 33rd Symposium on Theoretical Aspects of Computer Science</title>
                  <date type="start">2016</date>
                  <settlement>Orléans</settlement>
                  <country key="FR">France</country>
                </meeting>
                <editor>Nicolas Ollinger and Heribert Vollmer</editor>
                <imprint>
                  <publisher>Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik</publisher>
                  <biblScope unit="serie">Leibniz International Proceedings in Informatics (LIPIcs)</biblScope>
                  <biblScope unit="volume">47</biblScope>
                  <biblScope unit="pp">1--13</biblScope>
                  <date type="datePub">2016-02</date>
                </imprint>
              </monogr>
              <idno type="doi">10.4230/LIPIcs.STACS.2016.1</idno>
              <ref type="publisher">http://drops.dagstuhl.de/opus/volltexte/2016/5702</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">verification</term>
                <term xml:lang="en">reachability</term>
                <term xml:lang="en">well-quasi-order</term>
                <term xml:lang="en">ideal</term>
                <term xml:lang="en">Petri net</term>
              </keywords>
              <classCode scheme="acm" n="F.3.1">F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs</classCode>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Vector addition systems, or equivalently Petri nets, are one of the most popular formal models for the representation and the analysis of parallel processes. Many problems for vector addition systems are known to be decidable thanks to the theory of well-structured transition systems. Indeed, vector addition systems with configurations equipped with the classical point-wise ordering are well-structured transition systems. Based on this observation, problems like coverability or termination can be proven decidable. However, the theory of well-structured transition systems does not explain the decidability of the reachability problem. In this presentation, we show that runs of vector addition systems can also be equipped with a well quasi-order. This observation provides a unified understanding of the data structures involved in solving many problems for vector addition systems, including the central reachability problem. </p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-3102" status="VALID">
          <idno type="IdRef">155054465</idno>
          <idno type="ISNI">0000000122898198</idno>
          <idno type="RNSR">199511665F</idno>
          <idno type="ROR">https://ror.org/03adqg323</idno>
          <idno type="Wikidata">Q3214395</idno>
          <orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
          <orgName type="acronym">LaBRI</orgName>
          <date type="start">1988-01-01</date>
          <desc>
            <address>
              <addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.labri.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-259761" type="direct"/>
            <relation active="#struct-300366" type="direct"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-56043" status="OLD">
          <idno type="RNSR">200818998V</idno>
          <orgName>Verification in databases</orgName>
          <orgName type="acronym">DAHU</orgName>
          <date type="start">2009-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>LSV ENS de Cachan 61 avenue du Président Wilson 94235 CACHAN Cedex FRANCE</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/dahu</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2571" type="direct"/>
            <relation active="#struct-6862" type="indirect"/>
            <relation name="UMR8643" active="#struct-441569" type="indirect"/>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2571" status="OLD">
          <orgName>Laboratoire Spécification et Vérification [Cachan]</orgName>
          <orgName type="acronym">LSV</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment d'Alembert 61 Avenue du Président Wilson 94235 CACHAN CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lsv.ens-cachan.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6862" type="direct"/>
            <relation name="UMR8643" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-259761" status="VALID">
          <idno type="IdRef">175206562</idno>
          <idno type="ROR">https://ror.org/057qpr032</idno>
          <orgName>Université de Bordeaux</orgName>
          <orgName type="acronym">UB</orgName>
          <desc>
            <address>
              <addrLine>35, place Pey Berland - 33076 Bordeaux</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-bordeaux.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300366" status="VALID">
          <orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-6862" status="VALID">
          <orgName>École normale supérieure - Cachan</orgName>
          <orgName type="acronym">ENS Cachan</orgName>
          <desc>
            <address>
              <addrLine>61, avenue du Président Wilson - 94230 Cachan</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-cachan.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>