<?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-01852119</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-22T02:12:46+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Complexity of Diagnosability and Opacity Verification for Petri Nets</title>
            <author role="aut">
              <persName>
                <forename type="first">Béatrice</forename>
                <surname>Bérard</surname>
              </persName>
              <email type="md5">c8f5f5e7dae68065d538d083be96e7bc</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">beatrice-berard</idno>
              <idno type="idhal" notation="numeric">9360</idno>
              <idno type="halauthorid" notation="string">25835-9360</idno>
              <idno type="IDREF">https://www.idref.fr/029892740</idno>
              <affiliation ref="#struct-541717"/>
              <affiliation ref="#struct-2571"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Stefan</forename>
                <surname>Haar</surname>
              </persName>
              <idno type="idhal" notation="numeric">1003557</idno>
              <idno type="halauthorid" notation="string">17391-1003557</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-157663"/>
              <affiliation ref="#struct-2571"/>
            </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-2571"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Stefan</forename>
                <surname>Schwoon</surname>
              </persName>
              <idno type="halauthorid">594665-0</idno>
              <affiliation ref="#struct-157663"/>
              <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">2018-07-31 17:13:12</date>
              <date type="whenModified">2025-02-26 15:22:03</date>
              <date type="whenReleased">2018-08-01 08:48:27</date>
              <date type="whenProduced">2018-07-06</date>
              <date type="whenEndEmbargoed">2018-07-31</date>
              <ref type="file" target="https://inria.hal.science/hal-01852119v1/document">
                <date notBefore="2018-07-31"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01852119v1/file/bhss-fi.pdf" id="file-1852119-1877364">
                <date notBefore="2018-07-31"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-01484476/file/bhss-fi.pdf"/>
            </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-01852119</idno>
            <idno type="halUri">https://inria.hal.science/hal-01852119</idno>
            <idno type="halBibtex">berard:hal-01852119</idno>
            <idno type="halRefHtml">&lt;i&gt;Fundamenta Informaticae&lt;/i&gt;, 2018, 161 (4), pp.317--349. &lt;a target="_blank" href="https://dx.doi.org/10.3233/FI-2018-1706"&gt;&amp;#x27E8;10.3233/FI-2018-1706&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Fundamenta Informaticae, 2018, 161 (4), pp.317--349. &amp;#x27E8;10.3233/FI-2018-1706&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1852119-1877364"/></licence>
            </availability>
          </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="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</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="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</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="INRIA-300009">Inria 300009</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="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</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="LMF">Laboratoire Méthodes Formelles</idno>
            <idno type="stamp" n="LMF-CDS">Concurrence et distribué</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INRIAARTDOI">INRIAARTDOI</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The Complexity of Diagnosability and Opacity Verification for Petri Nets</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Béatrice</forename>
                    <surname>Bérard</surname>
                  </persName>
                  <email type="md5">c8f5f5e7dae68065d538d083be96e7bc</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">beatrice-berard</idno>
                  <idno type="idhal" notation="numeric">9360</idno>
                  <idno type="halauthorid" notation="string">25835-9360</idno>
                  <idno type="IDREF">https://www.idref.fr/029892740</idno>
                  <affiliation ref="#struct-541717"/>
                  <affiliation ref="#struct-2571"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Stefan</forename>
                    <surname>Haar</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1003557</idno>
                  <idno type="halauthorid" notation="string">17391-1003557</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-157663"/>
                  <affiliation ref="#struct-2571"/>
                </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-2571"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Stefan</forename>
                    <surname>Schwoon</surname>
                  </persName>
                  <idno type="halauthorid">594665-0</idno>
                  <affiliation ref="#struct-157663"/>
                  <affiliation ref="#struct-2571"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">20891</idno>
                <idno type="issn">0169-2968</idno>
                <idno type="eissn">1875-8681</idno>
                <title level="j">Fundamenta Informaticae</title>
                <imprint>
                  <publisher>Polskie Towarzystwo Matematyczne</publisher>
                  <biblScope unit="volume">161</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">317--349</biblScope>
                  <date type="datePub">2018-07-06</date>
                </imprint>
              </monogr>
              <idno type="doi">10.3233/FI-2018-1706</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Petri nets</term>
                <term xml:lang="en">Complexity</term>
                <term xml:lang="en">Verification</term>
                <term xml:lang="en">Opacity</term>
                <term xml:lang="en">Diagnosability</term>
              </keywords>
              <classCode scheme="acm" n="D.2.4.3">D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification/D.2.4.3: Formal methods</classCode>
              <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="acm" n="F.4.3.3">F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.3: Decision problems</classCode>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Diagnosability and opacity are two well-studied problems in discrete-event systems.  We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity.  We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general Petri nets and to opacity questions.  Second, we provide a global picture of complexity results for the verification of diagnosability and opacity.  We show that diagnosability is NL-complete for finite state systems, PSPACE-complete for safe Petri nets (even with fairness), and EXPSPACE-complete for general Petri nets without fairness, while non diagnosability is inter-reducible with reachability when fault events are not weakly fair.  Opacity is ESPACE-complete for safe Petri nets (even with fairness) and undecidable for general Petri nets already without fairness.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541717" status="VALID">
          <orgName>Modélisation et Vérification</orgName>
          <orgName type="acronym">MoVe</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" 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="researchteam" xml:id="struct-157663" status="OLD">
          <idno type="RNSR">200920937Y</idno>
          <orgName>Modeling and Exploitation of Interaction and Concurrency</orgName>
          <orgName type="acronym">MEXICO</orgName>
          <date type="start">2009-03-01</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LSV, ENS Cachan 61 av président Wilson 94235 Cachan cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/mexico</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-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </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-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>