<?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-04698650</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-09T13:50:27+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On the Length of Strongly Monotone Descending Chains over ℕᵈ</title>
            <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-1005016"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Lia</forename>
                <surname>Schütze</surname>
              </persName>
              <idno type="idhal" notation="numeric">1415580</idno>
              <idno type="halauthorid" notation="string">3233328-1415580</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4002-5491</idno>
              <affiliation ref="#struct-1145127"/>
            </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">2024-09-16 11:48:06</date>
              <date type="whenModified">2025-12-19 10:22:02</date>
              <date type="whenReleased">2024-09-16 11:48:06</date>
              <date type="whenProduced">2024-07</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2310.02847"/>
            </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-04698650</idno>
            <idno type="halUri">https://hal.science/hal-04698650</idno>
            <idno type="halBibtex">schmitz:hal-04698650</idno>
            <idno type="halRefHtml">&lt;i&gt;ICALP 2024, 51st International Colloquium on Automata, Languages and Programming&lt;/i&gt;, Jul 2024, Tallinn, Estonia. &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.ICALP.2024.153"&gt;&amp;#x27E8;10.4230/LIPIcs.ICALP.2024.153&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ICALP 2024, 51st International Colloquium on Automata, Languages and Programming, Jul 2024, Tallinn, Estonia. &amp;#x27E8;10.4230/LIPIcs.ICALP.2024.153&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="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS" corresp="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="UP-SCIENCES">Université Paris Cité - Faculté des Sciences</idno>
            <idno type="stamp" n="IRIF">Institut de Recherche en Informatique Fondamentale</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</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">On the Length of Strongly Monotone Descending Chains over ℕᵈ</title>
                <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-1005016"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Lia</forename>
                    <surname>Schütze</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1415580</idno>
                  <idno type="halauthorid" notation="string">3233328-1415580</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4002-5491</idno>
                  <affiliation ref="#struct-1145127"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">LIPIcs</title>
                <meeting>
                  <title>ICALP 2024, 51st International Colloquium on Automata, Languages and Programming</title>
                  <date type="start">2024-07</date>
                  <settlement>Tallinn</settlement>
                  <country key="EE">Estonia</country>
                </meeting>
                <imprint>
                  <publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</publisher>
                  <biblScope unit="volume">297</biblScope>
                  <date type="datePub">2024</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2310.02847</idno>
              <idno type="doi">10.4230/LIPIcs.ICALP.2024.153</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">affine net</term>
                <term xml:lang="en">order ideal</term>
                <term xml:lang="en">well-quasi-order</term>
                <term xml:lang="en">coverability</term>
                <term xml:lang="en">Vector addition system</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>A recent breakthrough by Künnemann, Mazowiecki, Schütze, Sinclair-Banks, and Węgrzycki (ICALP 2023) bounds the running time for the coverability problem in d-dimensional vector addition systems under unary encoding to n^{2^{O(d)}}, improving on Rackoff’s n^{2^{O(dlg d)}} upper bound (Theor. Comput. Sci. 1978), and provides conditional matching lower bounds. In this paper, we revisit Lazić and Schmitz' "ideal view" of the backward coverability algorithm (Inform. Comput. 2021) in the light of this breakthrough. We show that the controlled strongly monotone descending chains of downwards-closed sets over ℕ^d that arise from the dual backward coverability algorithm of Lazić and Schmitz on d-dimensional unary vector addition systems also enjoy this tight n^{2^{O(d)}} upper bound on their length, and that this also translates into the same bound on the running time of the backward coverability algorithm. Furthermore, our analysis takes place in a more general setting than that of Lazić and Schmitz, which allows to show the same results and improve on the 2EXPSPACE upper bound derived by Benedikt, Duff, Sharad, and Worrell (LICS 2017) for the coverability problem in invertible affine nets.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1005016" status="VALID">
          <idno type="IdRef">193993007</idno>
          <idno type="RNSR">201621976X</idno>
          <idno type="ROR">https://ror.org/02krdtz55</idno>
          <idno type="Wikidata">Q51783269</idno>
          <orgName>Institut de Recherche en Informatique Fondamentale</orgName>
          <orgName type="acronym">IRIF (UMR_8243)</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Université Paris CitéBâtiment Sophie Germain, Case courrier 70148 Place Aurélie Nemours75205 Paris Cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.irif.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR8243" active="#struct-441569" type="direct"/>
            <relation name="UMR_8243" active="#struct-557826" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-1145127" status="INCOMING">
          <orgName>MPI-SWS, Saarbrücken</orgName>
          <orgName type="acronym">MPI-SWS, Saarbrücken</orgName>
          <desc>
            <address>
              <addrLine>MPI-SWS, Saarbrücken</addrLine>
              <country key="DE"/>
            </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-557826" status="VALID">
          <idno type="IdRef">236453505</idno>
          <idno type="ISNI">0000 0004 7885 7602</idno>
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris Cité</orgName>
          <orgName type="acronym">UPCité</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>85 boulevard Saint-Germain75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://u-paris.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>