<?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-04168937</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-21T21:40:12+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Symbolic Observation Graph-Based Generation of Test Paths</title>
            <author role="aut">
              <persName>
                <forename type="first">Kais</forename>
                <surname>Klai</surname>
              </persName>
              <email type="md5">60613fc84c592a4e3c73683b2d1347d8</email>
              <email type="domain">telecom-sudparis.eu</email>
              <idno type="idhal" notation="numeric">1007033</idno>
              <idno type="halauthorid" notation="string">428295-1007033</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5494-913X</idno>
              <affiliation ref="#struct-1000994"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohamed Taha</forename>
                <surname>Bennani</surname>
              </persName>
              <idno type="idhal" notation="numeric">1272240</idno>
              <idno type="halauthorid" notation="string">2867200-1272240</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6693-6352</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jaime</forename>
                <surname>Arias</surname>
              </persName>
              <email type="md5">e49d1bfa9f9443686cbb9b4aaf6298af</email>
              <email type="domain">lipn.univ-paris13.fr</email>
              <idno type="idhal" notation="string">jaime-arias</idno>
              <idno type="idhal" notation="numeric">1722</idno>
              <idno type="halauthorid" notation="string">11253-1722</idno>
              <idno type="IDREF">https://www.idref.fr/191751669</idno>
              <idno type="ARXIV">https://arxiv.org/a/arias_j_1</idno>
              <affiliation ref="#struct-441569"/>
              <affiliation ref="#struct-1000994"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jörg</forename>
                <surname>Desel</surname>
              </persName>
              <idno type="halauthorid">428296-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hanen</forename>
                <surname>Ochi</surname>
              </persName>
              <email type="md5">7260f53b8a8e4ae9f5085c29e5442f60</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">hanen-ochi</idno>
              <idno type="idhal" notation="numeric">1173555</idno>
              <idno type="halauthorid" notation="string">735331-1173555</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6364-1302</idno>
              <affiliation ref="#struct-1096019"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jaime</forename>
                <surname>ARIAS</surname>
              </persName>
              <email type="md5">e49d1bfa9f9443686cbb9b4aaf6298af</email>
              <email type="domain">lipn.univ-paris13.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-07-22 21:15:56</date>
              <date type="whenModified">2025-12-03 14:48:03</date>
              <date type="whenReleased">2023-07-24 15:09:21</date>
              <date type="whenProduced">2023-07-18</date>
              <date type="whenEndEmbargoed">2023-07-22</date>
              <ref type="file" target="https://hal.science/hal-04168937v1/document">
                <date notBefore="2023-07-22"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04168937v1/file/main.pdf" id="file-4168940-3631700">
                <date notBefore="2023-07-22"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="304931">
                <persName>
                  <forename>Jaime</forename>
                  <surname>ARIAS</surname>
                </persName>
                <email type="md5">e49d1bfa9f9443686cbb9b4aaf6298af</email>
                <email type="domain">lipn.univ-paris13.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04168937</idno>
            <idno type="halUri">https://hal.science/hal-04168937</idno>
            <idno type="halBibtex">klai:hal-04168937</idno>
            <idno type="halRefHtml">&lt;i&gt;7th International Conference on Tests and Proofs (TAP 2023) Held as Part of STAF 2023&lt;/i&gt;, Jul 2023, Leicester, United Kingdom. pp.127-146, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-031-38828-6_8"&gt;&amp;#x27E8;10.1007/978-3-031-38828-6_8&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">7th International Conference on Tests and Proofs (TAP 2023) Held as Part of STAF 2023, Jul 2023, Leicester, United Kingdom. pp.127-146, &amp;#x27E8;10.1007/978-3-031-38828-6_8&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4168940-3631700"/></licence>
            </availability>
          </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="LIPN" corresp="UNIV-PARIS13">Laboratoire d'Informatique de Paris-Nord</idno>
            <idno type="stamp" n="SORBONNE-PARIS-NORD">Université Sorbonne Paris Nord</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="PANTHEON-ASSAS-UNIVERSITE">Université Paris-Panthéon-Assas</idno>
            <idno type="stamp" n="UNIV-ASSAS" corresp="PANTHEON-ASSAS-UNIVERSITE">Université Paris-Panthéon-Assas</idno>
            <idno type="stamp" n="ACT-R" corresp="UNIV-PARIS13">Act'R </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">Symbolic Observation Graph-Based Generation of Test Paths</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Kais</forename>
                    <surname>Klai</surname>
                  </persName>
                  <email type="md5">60613fc84c592a4e3c73683b2d1347d8</email>
                  <email type="domain">telecom-sudparis.eu</email>
                  <idno type="idhal" notation="numeric">1007033</idno>
                  <idno type="halauthorid" notation="string">428295-1007033</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5494-913X</idno>
                  <affiliation ref="#struct-1000994"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohamed Taha</forename>
                    <surname>Bennani</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1272240</idno>
                  <idno type="halauthorid" notation="string">2867200-1272240</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6693-6352</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jaime</forename>
                    <surname>Arias</surname>
                  </persName>
                  <email type="md5">e49d1bfa9f9443686cbb9b4aaf6298af</email>
                  <email type="domain">lipn.univ-paris13.fr</email>
                  <idno type="idhal" notation="string">jaime-arias</idno>
                  <idno type="idhal" notation="numeric">1722</idno>
                  <idno type="halauthorid" notation="string">11253-1722</idno>
                  <idno type="IDREF">https://www.idref.fr/191751669</idno>
                  <idno type="ARXIV">https://arxiv.org/a/arias_j_1</idno>
                  <affiliation ref="#struct-441569"/>
                  <affiliation ref="#struct-1000994"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jörg</forename>
                    <surname>Desel</surname>
                  </persName>
                  <idno type="halauthorid">428296-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hanen</forename>
                    <surname>Ochi</surname>
                  </persName>
                  <email type="md5">7260f53b8a8e4ae9f5085c29e5442f60</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">hanen-ochi</idno>
                  <idno type="idhal" notation="numeric">1173555</idno>
                  <idno type="halauthorid" notation="string">735331-1173555</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6364-1302</idno>
                  <affiliation ref="#struct-1096019"/>
                </author>
              </analytic>
              <monogr>
                <idno type="isbn">978-3-031-38827-9</idno>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>7th International Conference on Tests and Proofs (TAP 2023) Held as Part of STAF 2023</title>
                  <date type="start">2023-07-18</date>
                  <date type="end">2023-07-19</date>
                  <settlement>Leicester</settlement>
                  <country key="GB">United Kingdom</country>
                </meeting>
                <editor>Virgile Prevosto</editor>
                <editor>Cristina Seceleanu</editor>
                <imprint>
                  <publisher>Springer Nature Switzerland</publisher>
                  <pubPlace>Cham</pubPlace>
                  <biblScope unit="serie">Tests and Proofs 17th International Conference, TAP 2023, Leicester, UK, July 18–19, 2023, Proceedings</biblScope>
                  <biblScope unit="volume">14066</biblScope>
                  <biblScope unit="pp">127-146</biblScope>
                  <date type="datePub">2023</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-031-38828-6_8</idno>
              <ref type="publisher">https://conf.researchr.org/home/tap-2023</ref>
            </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">transition coverage</term>
                <term xml:lang="en">model-based testing</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>The paper introduces a theoretical foundation for generating abstract test paths related to Petri net specifications. Based on the structure of the Petri net model of the system, we first define the notion of unobservable transition. Unless such a transition is unreachable, we prove that its firing is necessarily ensured by the firing of another transition (namely observable transition) of the Petri net. We show that the set of observable transitions is the smallest set that guarantees the coverage of all the transitions of the Petri net model, i.e., any set of firing sequences of the model, namely observable traces, involving all the observable transitions passes eventually through the unobservable transitions as well. If some unobservable transitions are mandatory to trigger the execution of a test sub-sequence, observable traces are completed with such transitions to enhance the controllability of the test scenario. In addition to structurally identifying observable (and unobservable) transitions, we mainly propose two algorithms: the first allows to generate a set of observable paths ensuring full coverage of all the system transitions. It is based on an on-the-fly construction of a hybrid graph called the symbolic observation graph. The second algorithm completes the observable paths in order to explicitly cover the whole set of system’s transitions. The approach is implemented within an available prototype, and the preliminary experiments are promising</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1000994" status="VALID">
          <idno type="IdRef">191907855</idno>
          <idno type="RNSR">200112433P</idno>
          <idno type="ROR">05g1zjw44</idno>
          <orgName>Laboratoire d'Informatique de Paris-Nord</orgName>
          <orgName type="acronym">LIPN</orgName>
          <date type="start">2020-01-01</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 name="UMR7030" active="#struct-441569" type="direct"/>
            <relation active="#struct-581146" type="direct"/>
          </listRelation>
        </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="laboratory" xml:id="struct-1096019" status="VALID">
          <orgName>Efrei Research Lab</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-416458" type="direct"/>
            <relation active="#struct-1091427" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-581146" status="VALID">
          <idno type="IdRef">02640463X</idno>
          <idno type="ISNI">0000000121496883</idno>
          <idno type="ROR">https://ror.org/0199hds37</idno>
          <orgName>Université Sorbonne Paris Nord</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>99, avenue Jean-Baptiste Clément, 93430 Villetaneuse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-paris13.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-416458" status="VALID">
          <idno type="ROR">https://ror.org/01h7hvj14</idno>
          <orgName>Efrei (Villejuif / Bordeaux)</orgName>
          <orgName type="acronym">Efrei</orgName>
          <desc>
            <address>
              <addrLine>30-32 avenue de la République, 94800 Villejuif, France83 Rue Lucien Faure, 33000 Bordeaux, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.efrei.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1091427" status="VALID">
          <idno type="IdRef">260745863</idno>
          <idno type="ISNI">0000 0001 2299 9829</idno>
          <idno type="ROR">https://ror.org/04qb2qm38</idno>
          <orgName>Université Paris-Panthéon-Assas</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>12 place du Panthéon - 75231 Paris Cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-paris2.fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>