<?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-00116950</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-24T16:46:59+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Periodicity Based Decidable Classes in a First Order Timed Logic</title>
            <author role="aut">
              <persName>
                <forename type="first">Danièle</forename>
                <surname>Beauquier</surname>
              </persName>
              <email type="md5">5e9b75d20d019d5fb945c38f444bb95b</email>
              <email type="domain">univ-paris12.fr</email>
              <idno type="idhal" notation="numeric">836857</idno>
              <idno type="halauthorid" notation="string">106756-836857</idno>
              <affiliation ref="#struct-1662"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Anatol</forename>
                <surname>Slissenko</surname>
              </persName>
              <idno type="halauthorid">164689-0</idno>
              <affiliation ref="#struct-1662"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Danièle</forename>
                <surname>Beauquier</surname>
              </persName>
              <email type="md5">5e9b75d20d019d5fb945c38f444bb95b</email>
              <email type="domain">univ-paris12.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2006-11-28 21:28:45</date>
              <date type="whenModified">2023-03-24 14:52:48</date>
              <date type="whenReleased">2006-11-29 01:02:33</date>
              <date type="whenProduced">2006</date>
              <date type="whenEndEmbargoed">2006-11-28</date>
              <ref type="file" target="https://hal.science/hal-00116950v1/document">
                <date notBefore="2006-11-28"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://hal.science/hal-00116950v1/file/DcdblPeriod04FebTechCorr.pdf" id="file-116950-114152">
                <date notBefore="2006-11-28"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="114838">
                <persName>
                  <forename>Danièle</forename>
                  <surname>Beauquier</surname>
                </persName>
                <email type="md5">5e9b75d20d019d5fb945c38f444bb95b</email>
                <email type="domain">univ-paris12.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00116950</idno>
            <idno type="halUri">https://hal.science/hal-00116950</idno>
            <idno type="halBibtex">beauquier:hal-00116950</idno>
            <idno type="halRefHtml">&lt;i&gt;Annals of Pure and Applied Logic&lt;/i&gt;, 2006, 139, pp.43--73</idno>
            <idno type="halRef">Annals of Pure and Applied Logic, 2006, 139, pp.43--73</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-116950-114152"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LACL" corresp="UPEC">Laboratoire d'Algorithmique Complexité et Logique</idno>
            <idno type="stamp" n="UPEC" corresp="CV_UPEC">Université Paris-Est Créteil Val-de-Marne</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">Periodicity Based Decidable Classes in a First Order Timed Logic</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Danièle</forename>
                    <surname>Beauquier</surname>
                  </persName>
                  <email type="md5">5e9b75d20d019d5fb945c38f444bb95b</email>
                  <email type="domain">univ-paris12.fr</email>
                  <idno type="idhal" notation="numeric">836857</idno>
                  <idno type="halauthorid" notation="string">106756-836857</idno>
                  <affiliation ref="#struct-1662"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Anatol</forename>
                    <surname>Slissenko</surname>
                  </persName>
                  <idno type="halauthorid">164689-0</idno>
                  <affiliation ref="#struct-1662"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">10502</idno>
                <idno type="issn">0168-0072</idno>
                <title level="j">Annals of Pure and Applied Logic</title>
                <imprint>
                  <publisher>Elsevier Masson</publisher>
                  <biblScope unit="volume">139</biblScope>
                  <biblScope unit="pp">43--73</biblScope>
                  <date type="datePub">2006</date>
                </imprint>
              </monogr>
            </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="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>We describe a decidable class of formulas in a first order timed logic that covers a good amount of properties of real-time distributed systems. Earlier we described a decidable class based on some finiteness properties, and sketched a decidable class in a weaker logic that captures periodicity properties, though without complete proof. The new feature of the decidable class presented here is to be able to treat parametric properties, in particular, properties that concern an arbitrary number of processes as compared to the just mentioned class that could express only properties for a fixed, explicitly given number of processes. As before the properties may use non-trivial arithmetics. We also state another important feature of the class: if a verification formula is not true then our algorithm gives a quantifier-free description of all its counter-models of the complexity involved in the definition of the decidable class and that is quite representative. In conclusion we discuss theoretical and practical issues of the complexity and some open questions.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1662" status="OLD">
          <orgName>Laboratoire d'Algorithmique Complexité et Logique</orgName>
          <orgName type="acronym">LACL</orgName>
          <desc>
            <address>
              <addrLine>Dép.d'informatique Bat.P2 61,avenue du général de Gaulle 94010 CRETEIL CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris12.fr/lacl</ref>
          </desc>
          <listRelation>
            <relation active="#struct-420786" type="direct"/>
            <relation name="FRE2673" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-420786" status="VALID">
          <idno type="IdRef">028021037</idno>
          <idno type="ISNI">0000000121497878</idno>
          <idno type="ROR">https://ror.org/05ggc9x40</idno>
          <orgName>Université Paris-Est Créteil Val-de-Marne - Paris 12</orgName>
          <orgName type="acronym">UPEC UP12</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>61 avenue du Général de Gaulle - 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-pec.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>
      </listOrg>
    </back>
  </text>
</TEI>