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

### Citation Style Language JSON Export

{
"publisher": "Zenodo",
"DOI": "10.5281/zenodo.4115919",
"author": [
{
"family": "Andr\u00e9, Etienne"
},
{
"family": "Arias, Jaime"
},
{
"family": "Petrucci, Laure"
},
{
"family": "van de Pol, Jaco"
}
],
"issued": {
"date-parts": [
[
2020,
10,
21
]
]
},
"abstract": "<p>The artifact contains the latest version (3.0.0) of the imitator software (https://www.imitator.fr) which provides new implementation and heuristics for cycle detection in Parametric Timed Automata.<br>\nThe 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.</p>\n\n<p>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.<br>\nThe artifact also provides the source files as well as the necessary libraries for compilation, and a pre-compiled version of the tool.</p>\n\n<p>Zenodo link: https://doi.org/10.5281/zenodo.4115919<br>\nGitlab link: https://depot.lipn.univ-paris13.fr/imitator/papers/tacas21</p>",
"title": "Artifact: Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata",
"type": "article",
"id": "4115919"
}
58
9
views