<?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-01767323</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-11T00:29:08+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Difference Bound Constraint Abstraction for Timed Automata Reachability Checking</title>
            <author role="aut">
              <persName>
                <forename type="first">Weifeng</forename>
                <surname>Wang</surname>
              </persName>
              <email type="md5">56ddc2517e23bc697ef1a22fbc8c873f</email>
              <email type="domain">ios.ac.cn</email>
              <idno type="idhal" notation="numeric">1030892</idno>
              <idno type="halauthorid" notation="string">1351535-1030892</idno>
              <affiliation ref="#struct-351138"/>
              <affiliation ref="#struct-469160"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Li</forename>
                <surname>Jiao</surname>
              </persName>
              <email type="md5">d67700af4d52be31eaf393be5c963df0</email>
              <email type="domain">ios.ac.cn</email>
              <idno type="idhal" notation="numeric">1030893</idno>
              <idno type="halauthorid" notation="string">1351536-1030893</idno>
              <affiliation ref="#struct-351138"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-04-16 10:18:31</date>
              <date type="whenModified">2024-11-12 11:34:03</date>
              <date type="whenReleased">2018-04-16 10:20:28</date>
              <date type="whenProduced">2015-06-02</date>
              <date type="whenEndEmbargoed">2018-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01767323v1/document">
                <date notBefore="2018-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01767323v1/file/978-3-319-19195-9_10_Chapter.pdf" id="file-1767323-1798534">
                <date notBefore="2018-01-01"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-01767323/file/978-3-319-19195-9_10_Chapter.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01767323</idno>
            <idno type="halUri">https://inria.hal.science/hal-01767323</idno>
            <idno type="halBibtex">wang:hal-01767323</idno>
            <idno type="halRefHtml">&lt;i&gt;35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)&lt;/i&gt;, Jun 2015, Grenoble, France. pp.146-160, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-19195-9_10"&gt;&amp;#x27E8;10.1007/978-3-319-19195-9_10&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2015, Grenoble, France. pp.146-160, &amp;#x27E8;10.1007/978-3-319-19195-9_10&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1767323-1798534"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-WG6-1" corresp="IFIP-WG">Architectures and Protocols for Distributed Systems</idno>
            <idno type="stamp" n="IFIP-FORTE">IFIP-FORTE</idno>
            <idno type="stamp" n="IFIP-LNCS-9039" corresp="IFIP-LNCS">Formal Techniques for Distributed Objects, Components, and Systems</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 3: Real Time Systems</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="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Difference Bound Constraint Abstraction for Timed Automata Reachability Checking</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Weifeng</forename>
                    <surname>Wang</surname>
                  </persName>
                  <email type="md5">56ddc2517e23bc697ef1a22fbc8c873f</email>
                  <email type="domain">ios.ac.cn</email>
                  <idno type="idhal" notation="numeric">1030892</idno>
                  <idno type="halauthorid" notation="string">1351535-1030892</idno>
                  <affiliation ref="#struct-351138"/>
                  <affiliation ref="#struct-469160"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Li</forename>
                    <surname>Jiao</surname>
                  </persName>
                  <email type="md5">d67700af4d52be31eaf393be5c963df0</email>
                  <email type="domain">ios.ac.cn</email>
                  <idno type="idhal" notation="numeric">1030893</idno>
                  <idno type="halauthorid" notation="string">1351536-1030893</idno>
                  <affiliation ref="#struct-351138"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>35th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)</title>
                  <date type="start">2015-06-02</date>
                  <date type="end">2015-06-05</date>
                  <settlement>Grenoble</settlement>
                  <country key="FR">France</country>
                </meeting>
                <editor>Susanne Graf</editor>
                <editor>Mahesh Viswanathan</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Formal Techniques for Distributed Objects, Components, and Systems</biblScope>
                  <biblScope unit="volume">LNCS-9039</biblScope>
                  <biblScope unit="pp">146-160</biblScope>
                  <date type="datePub">2015</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-19195-9_10</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Predicate Abstraction</term>
                <term xml:lang="en">Time Automaton</term>
                <term xml:lang="en">Reachability Problem</term>
                <term xml:lang="en">Negative Cycle</term>
                <term xml:lang="en">Model Check</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</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>We consider the reachability problem for timed automata. One of the most well-known solutions for this problem is the zone-based search method. Max bound abstraction and LU-bound abstraction on zones have been proposed to reduce the state space for zone based search. These abstractions use bounds collected from the timed automata structure to compute an abstract state space. In this paper we propose a difference bound constraint abstraction for zones. In this abstraction, sets of difference bound constraints collected from the symbolic run are used to compute the abstract states. Based on this new abstraction scheme, we propose an algorithm for the reachability checking of timed automata. Experiment results are reported on several timed automata benchmarks.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
              <org type="consortium">WG 6.1</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-351138" status="VALID">
          <orgName>Institute of Software Chinese Academy of Sciences [Beijing]</orgName>
          <desc>
            <address>
              <addrLine>4# South Fourth Street, Zhong Guan Cun, Beijing 100190</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.is.cas.cn/</ref>
          </desc>
        </org>
        <org type="regrouplaboratory" xml:id="struct-469160" status="VALID">
          <idno type="ROR">https://ror.org/05qbk4x57</idno>
          <orgName>University of Chinese Academy of Sciences [Beijing]</orgName>
          <orgName type="acronym">UCAS</orgName>
          <date type="start">2016-10-20</date>
          <desc>
            <address>
              <addrLine>No.19(A) Yuquan Road, Shijingshan District, Beijing, P.R.China 100049</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.ucas.ac.cn/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-303369" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-303369" status="VALID">
          <idno type="ROR">https://ror.org/034t30j35</idno>
          <orgName>Chinese Academy of Sciences [Beijing]</orgName>
          <orgName type="acronym">CAS</orgName>
          <desc>
            <address>
              <addrLine>52 Sanlihe Rd., Beijing, 100864</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.cas.cn/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>