<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-010-10-1469</article-id>
      <article-id pub-id-type="publisher-id">28314</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>C.2.2 - Network Protocols</subject>
          <subject>F.4.3 - Formal Languages</subject>
          <subject>I.6.3 - Applications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Tools for Parametric Verification. A Comparison on a Case Study</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Matoušek</surname>
            <given-names>Petr</given-names>
          </name>
          <email xlink:type="simple">matousp@fit.vutbr.cz</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Brno University of Technology, , Czech Republic</addr-line>
        <institution>Brno University of Technology</institution>
        <country>Czech Republic</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Petr Matoušek (<email xlink:type="simple">matousp@fit.vutbr.cz</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2004</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>10</month>
        <year>2004</year>
      </pub-date>
      <volume>10</volume>
      <issue>10</issue>
      <fpage>1469</fpage>
      <lpage>1494</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/5DF69ACF-6E00-5314-8A8D-14979286DA49">5DF69ACF-6E00-5314-8A8D-14979286DA49</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6996649">6996649</uri>
      <permissions>
        <copyright-statement>Petr Matoušek</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Protocol analysis involves several parameters in model specification, for instance, transmission delay or the length of the transmitting window. Verification of the model with parameters is a semi-decision process that depends on the number of clocks, parameters and counters in the model. Using combination of different verification tools for timed models as HyTech, TReX and UPPaal we are able to find relation between parameters satisfying desired property. The paper gives a report on the synthesis of parameters of PGM protocol. We built a formal model based on extended time automata with parameters and verified the reliability property. Our results automatically obtained from the model are consistent with previous results derived manually. The paper describes our experience with parametric verification of multicast protocol PGM. Results mentioned in the work were made with collaboration with Mihaela Sighireanu (Mihaela.Sighireanu@liafa.jussieu.fr) from LIAFA, Paris.</p>
      </abstract>
    </article-meta>
  </front>
</article>
