Software Open Access

Artifact: Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata

André, Etienne; Arias, Jaime; Petrucci, Laure; van de Pol, Jaco

DataCite XML Export

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="" xmlns="" xsi:schemaLocation="">
  <identifier identifierType="DOI">10.5281/zenodo.4115919</identifier>
      <creatorName>André, Etienne</creatorName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="">0000-0001-8473-9555</nameIdentifier>
      <affiliation>Université de Lorraine, CNRS, Inria, LORIA, Nancy, France</affiliation>
      <creatorName>Arias, Jaime</creatorName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="">0000-0003-3019-4902</nameIdentifier>
      <affiliation>LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, France</affiliation>
      <creatorName>Petrucci, Laure</creatorName>
      <nameIdentifier nameIdentifierScheme="ORCID" schemeURI="">0000-0003-3154-5268</nameIdentifier>
      <affiliation>LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, France</affiliation>
      <creatorName>van de Pol, Jaco</creatorName>
      <familyName>van de Pol</familyName>
      <affiliation>Computer Science Department, University of Aarhus, Denmark</affiliation>
    <title>Artifact: Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata</title>
    <date dateType="Issued">2020-10-21</date>
  <resourceType resourceTypeGeneral="Software"/>
    <alternateIdentifier alternateIdentifierType="url"></alternateIdentifier>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.5281/zenodo.4115918</relatedIdentifier>
    <rights rightsURI="">GNU General Public License v3.0 only</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
    <description descriptionType="Abstract">&lt;p&gt;The artifact contains the latest version (3.0.0) of the imitator software ( which provides new implementation and heuristics for cycle detection in Parametric Timed Automata.&lt;br&gt;
The paper presents the different algorithms at stake, studies their termination and completeness properties, and compares them through experiments. The algorithms cover BFS (Breadth-First Search) and several variants of NDFS (Nested Depth First Search), including an iterative deepening approach, in the parametric setting. It finally tackles properties of the BRP (Bounded Retransmission Protocol) parametric model, synthesising more liberal constraints than previous works.&lt;/p&gt;

&lt;p&gt;This artifact contains the means to reproduce the experimental results from the paper. The scripts provided in the artifact allow for obtaining the cycle detection results in tables 1 and 2. An additional script launches the experiments on the BRP case study, in the same order as they are detailed in section 6 of the paper.&lt;br&gt;
The artifact also provides the source files as well as the necessary libraries for compilation, and a pre-compiled version of the tool.&lt;/p&gt;

&lt;p&gt;Zenodo link:;br&gt;
Gitlab link:;/p&gt;</description>
All versions This version
Views 5858
Downloads 99
Data volume 1.5 GB1.5 GB
Unique views 5151
Unique downloads 88


Cite as