<?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-02153342</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-03T20:18:28+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Minimal-Time Synthesis for Parametric Timed Automata</title>
            <author role="aut">
              <persName>
                <forename type="first">Étienne</forename>
                <surname>André</surname>
              </persName>
              <email type="md5">c5cddd7679a0cba7b78850bd19da63cf</email>
              <email type="domain">lipn13.fr</email>
              <ptr type="url" target="https://lipn.univ-paris13.fr/~andre/"/>
              <idno type="idhal" notation="string">etienne-andre</idno>
              <idno type="idhal" notation="numeric">8289</idno>
              <idno type="halauthorid" notation="string">28031-8289</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8473-9555</idno>
              <idno type="ARXIV">https://arxiv.org/a/andre_e_2</idno>
              <affiliation ref="#struct-6501"/>
              <affiliation ref="#struct-542009"/>
              <affiliation ref="#struct-994"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Bloemen</surname>
              </persName>
              <idno type="halauthorid">1600876-0</idno>
              <affiliation ref="#struct-303060"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Laure</forename>
                <surname>Petrucci</surname>
              </persName>
              <email type="md5">ac7b5e2d0d6d1c9ca20731cac6e4ee94</email>
              <email type="domain">lipn.univ-paris13.fr</email>
              <idno type="idhal" notation="string">laure-petrucci</idno>
              <idno type="idhal" notation="numeric">178715</idno>
              <idno type="halauthorid" notation="string">323-178715</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3154-5268</idno>
              <idno type="IDREF">https://www.idref.fr/110965787</idno>
              <idno type="VIAF">https://viaf.org/viaf/69240071</idno>
              <idno type="ISNI">http://isni.org/isni/0000000002556687</idno>
              <affiliation ref="#struct-994"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jaco</forename>
                <surname>van de Pol</surname>
              </persName>
              <idno type="idhal" notation="numeric">793125</idno>
              <idno type="halauthorid" notation="string">1453028-793125</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4305-0625</idno>
              <affiliation ref="#struct-19908"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Étienne</forename>
                <surname>André</surname>
              </persName>
              <email type="md5">c5cddd7679a0cba7b78850bd19da63cf</email>
              <email type="domain">lipn13.fr</email>
            </editor>
            <funder ref="#projanr-41258"/>
            <funder>This work is partially supported by the ANR national research program PACS (ANR-14-CE28-0002) and PHC Van Gogh project PAMPAS.</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-06-12 10:39:10</date>
              <date type="whenWritten">2018</date>
              <date type="whenModified">2026-02-02 14:42:04</date>
              <date type="whenReleased">2019-06-12 10:39:10</date>
              <date type="whenProduced">2019-04-08</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1902.03013"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="145957">
                <persName>
                  <forename>Étienne</forename>
                  <surname>André</surname>
                </persName>
                <email type="md5">c5cddd7679a0cba7b78850bd19da63cf</email>
                <email type="domain">lipn13.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02153342</idno>
            <idno type="halUri">https://hal.science/hal-02153342</idno>
            <idno type="halBibtex">andre:hal-02153342</idno>
            <idno type="halRefHtml">&lt;i&gt;25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019)&lt;/i&gt;, Apr 2019, Prague, Czech Republic. pp.211--228, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-17465-1_12"&gt;&amp;#x27E8;10.1007/978-3-030-17465-1_12&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Apr 2019, Prague, Czech Republic. pp.211--228, &amp;#x27E8;10.1007/978-3-030-17465-1_12&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PARIS13">Université Paris-Nord - Paris XIII </idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="OCA">Observatoire de la Cote d'Azur</idno>
            <idno type="stamp" n="LIPN" corresp="UNIV-PARIS13">Laboratoire d'Informatique de Paris-Nord</idno>
            <idno type="stamp" n="USPC">Université Sorbonne Paris Cité</idno>
            <idno type="stamp" n="GALILE" corresp="UNIV-PARIS13">Institut Galilée Université Paris 13</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCI" corresp="SORBONNE-UNIVERSITE">Sciences - Sorbonne Université</idno>
            <idno type="stamp" n="UMI-3527" corresp="SORBONNE-UNIVERSITE">Japanese-French Laboratory for Informatics</idno>
            <idno type="stamp" n="SORBONNE-PARIS-NORD">Université Sorbonne Paris Nord</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="CONFRENCE-NATIONALE-SUR-LES-APPLICATIONS-PRATIQUES-DE-LINTELLIGENCE-ARTIFICIELLE" corresp="CNRS">Conférence Nationale sur les Applications Pratiques de l’Intelligence Artificielle </idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="ACT-R" corresp="UNIV-PARIS13">Act'R </idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">This is the author version of the paper of the same name published in the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019)</note>
            <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="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Minimal-Time Synthesis for Parametric Timed Automata</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Étienne</forename>
                    <surname>André</surname>
                  </persName>
                  <email type="md5">c5cddd7679a0cba7b78850bd19da63cf</email>
                  <email type="domain">lipn13.fr</email>
                  <ptr type="url" target="https://lipn.univ-paris13.fr/~andre/"/>
                  <idno type="idhal" notation="string">etienne-andre</idno>
                  <idno type="idhal" notation="numeric">8289</idno>
                  <idno type="halauthorid" notation="string">28031-8289</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8473-9555</idno>
                  <idno type="ARXIV">https://arxiv.org/a/andre_e_2</idno>
                  <affiliation ref="#struct-6501"/>
                  <affiliation ref="#struct-542009"/>
                  <affiliation ref="#struct-994"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Bloemen</surname>
                  </persName>
                  <idno type="halauthorid">1600876-0</idno>
                  <affiliation ref="#struct-303060"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Laure</forename>
                    <surname>Petrucci</surname>
                  </persName>
                  <email type="md5">ac7b5e2d0d6d1c9ca20731cac6e4ee94</email>
                  <email type="domain">lipn.univ-paris13.fr</email>
                  <idno type="idhal" notation="string">laure-petrucci</idno>
                  <idno type="idhal" notation="numeric">178715</idno>
                  <idno type="halauthorid" notation="string">323-178715</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3154-5268</idno>
                  <idno type="IDREF">https://www.idref.fr/110965787</idno>
                  <idno type="VIAF">https://viaf.org/viaf/69240071</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000002556687</idno>
                  <affiliation ref="#struct-994"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jaco</forename>
                    <surname>van de Pol</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">793125</idno>
                  <idno type="halauthorid" notation="string">1453028-793125</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4305-0625</idno>
                  <affiliation ref="#struct-19908"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019)</title>
                <meeting>
                  <title>25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019)</title>
                  <date type="start">2019-04-08</date>
                  <date type="end">2019-04-11</date>
                  <settlement>Prague</settlement>
                  <country key="CZ">Czech Republic</country>
                </meeting>
                <editor>Tomas Vojnar</editor>
                <editor>Lijun Zhang</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019)</biblScope>
                  <biblScope unit="volume">11428</biblScope>
                  <biblScope unit="pp">211--228</biblScope>
                  <date type="datePub">2019-04-03</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1902.03013</idno>
              <idno type="doi">10.1007/978-3-030-17465-1_12</idno>
              <ref target="https://github.com/utwente-fmt/OptTime-TACAS19" type="seeAlso"/>
              <ref type="publisher">https://conf.researchr.org/track/etaps-2019/tacas-2019-papers</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="info.info-es">Computer Science [cs]/Embedded Systems</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>Parametric timed automata (PTA) extend timed automata by allowing parameters in clock constraints. Such a formalism is for instance useful when reasoning about unknown delays in a timed system. Using existing techniques, a user can synthesize the parameter constraints that allow the system to reach a specified goal location, regardless of how much time has passed for the internal clocks. We focus on synthesizing parameters such that not only the goal location is reached, but we also address the following questions: what is the minimal time to reach the goal location? and for which parameter values can we achieve this? We analyse the problem and present an algorithm that solves it. We also discuss and provide solutions for minimizing a specific parameter value to still reach the goal. We empirically study the performance of these algorithms on a benchmark set for PTAs and show that minimal-time reachability synthesis is more efficient to compute than the standard synthesis algorithm for reachability.</p>
            </abstract>
            <particDesc>
              <org type="consortium">ANR PACS (ANR-14-CE28-0002)</org>
              <org type="consortium">ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603), JST</org>
              <org type="consortium">PHC Van Gogh project PAMPAS</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-6501" status="VALID">
          <idno type="ROR">https://ror.org/04ksd4g47</idno>
          <orgName>National Institute of Informatics</orgName>
          <orgName type="acronym">NII</orgName>
          <desc>
            <address>
              <addrLine>2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430</addrLine>
              <country key="JP"/>
            </address>
            <ref type="url">http://www.nii.ac.jp/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-542009" status="VALID">
          <idno type="RNSR">201220443Y</idno>
          <idno type="ROR">007xn7v02</idno>
          <orgName>Japanese French Laboratory for Informatics</orgName>
          <orgName type="acronym">JFLI</orgName>
          <desc>
            <address>
              <country key="JP"/>
            </address>
            <ref type="url">http://jfli.nii.ac.jp/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6501" type="direct"/>
            <relation active="#struct-304304" type="direct"/>
            <relation active="#struct-413221" type="direct"/>
            <relation name="IRL3527 / UMI3527" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-994" status="OLD">
          <orgName>Laboratoire d'Informatique de Paris-Nord</orgName>
          <orgName type="acronym">LIPN</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Institut Galilée, Université Paris 13, 99 avenue Jean-Baptiste Clément, F-93430, Villetaneuse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www-lipn.univ-paris13.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-15786" type="direct"/>
            <relation active="#struct-301340" type="direct"/>
            <relation active="#struct-303171" type="direct"/>
            <relation name="UMR7030" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-303060" status="VALID">
          <idno type="ROR">https://ror.org/006hf6230</idno>
          <orgName>University of Twente</orgName>
          <desc>
            <address>
              <addrLine>Drienerlolaan 5, 7522 NB Enschede</addrLine>
              <country key="NL"/>
            </address>
            <ref type="url">https://www.utwente.nl/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-19908" status="VALID">
          <idno type="IdRef">026461307</idno>
          <idno type="ROR">https://ror.org/01aj84f44</idno>
          <orgName>Aarhus University [Aarhus]</orgName>
          <desc>
            <address>
              <addrLine>Nordre Ringgade 1 DK-8000 Aarhus C</addrLine>
              <country key="DK"/>
            </address>
            <ref type="url">http://www.au.dk/en/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-304304" status="VALID">
          <idno type="IdRef">029909848</idno>
          <idno type="ROR">https://ror.org/057zh3y96</idno>
          <orgName>The University of Tokyo</orgName>
          <orgName type="acronym">UTokyo</orgName>
          <desc>
            <address>
              <addrLine>7 Chome-3-1 Hongo, Bunkyo, Tokyo 113-8654</addrLine>
              <country key="JP"/>
            </address>
            <ref type="url">https://www.u-tokyo.ac.jp/en/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </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-15786" status="VALID">
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris 13</orgName>
          <orgName type="acronym">UP13</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris13.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301340" status="VALID">
          <orgName>Institut Galilée</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-303171" status="VALID">
          <idno type="IdRef">19077990X</idno>
          <idno type="ROR">https://ror.org/001z21q04</idno>
          <orgName>Université Sorbonne Paris Cité</orgName>
          <orgName type="acronym">USPC</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>Université Sorbonne Paris Cité | 100-104, avenue de France | 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-paris-cite.fr/fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-41258" status="VALID">
          <idno type="anr">ANR-14-CE28-0002</idno>
          <idno type="program">Appel à projets générique</idno>
          <orgName>PACS</orgName>
          <desc>Analyses paramétrées de systèmes concurrents</desc>
          <date type="start">2014</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>