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

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.
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.

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.
The artifact also provides the source files as well as the necessary libraries for compilation, and a pre-compiled version of the tool.

Zenodo link: https://doi.org/10.5281/zenodo.4115919
Gitlab link: https://depot.lipn.univ-paris13.fr/imitator/papers/tacas21

Files (170.3 MB)
Name Size
tacas21-artifact.zip
md5:2af048a0bfd9c686211e2d29e7b88618
170.3 MB Download
61
9
views
downloads
All versions This version
Views 6161
Downloads 99
Data volume 1.5 GB1.5 GB
Unique views 5454
Unique downloads 88

Share

Cite as