Minimal-Time Synthesis for Parametric Timed Automata

André, Étienne; Bloemen, Vincent; Petrucci, Laure; Pol, Jaco van de

doi:10.1007/978-3-030-17465-1_12

Cited by 9 publications

(4 citation statements)

References 26 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Minimum-Time Reachability. Minimal-time synthesis [12] aims at synthesizing parameter valuations minimizing the time needed to reach a discrete state. Here, we can ask for the valuations for which it is possible to finish an article after drinking at least 2 coffees:…”

Section: # Synth Ef ( Loc [ Researcher ] = Coffee and Nb >= 5)mentioning

confidence: 99%

“…Acknowledgement. While the author has been the main developer of IMITATOR since 2008, several colleagues brought very valuable enhancements, notably Camille Coti and Sami Evangelista [14] (on distributed algorithms), Nguy Hoàng Gia [27] (on non-Zeno algorithms), Vincent Bloemen [12] (on minimal-time synthesis), Laure Petrucci and Jaco van de Pol [11] (on NDFS-based cycle synthesis), and Jaime Arias for multiple practical enhancements. Many thanks to Dylan Marinho for a careful rereading of this paper, and to Stephan Merz for useful suggestions.…”

mentioning

confidence: 99%

See 1 more Smart Citation

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

André

2021

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Real-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by 3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.

show abstract

Section: # Synth Ef ( Loc [ Researcher ] = Coffee and Nb >= 5)mentioning

confidence: 99%

mentioning

confidence: 99%

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

André

2021

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

show abstract

“…Parameters can be used both in the model and in the properties. Verification capabilities include reachability-synthesis, deadlock-freeness-synthesis [And16], non-Zeno model checking [And+17], minimal-time synthesis [And+19], and tracepreservation-synthesis. IMITATOR is fully written in OCaml, and makes use of the Parma Polyhedra Library [BHZ08].…”

Section: Imitatormentioning

confidence: 99%

Parametric Verification: An Introduction

André,

Knapik,

Lime

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

This paper constitutes a short introduction to parametric verification of concurrent systems. It originates from two 1-day tutorial sessions held at the Petri nets conferences in Toruń (2016) and Zaragoza (2017). A video of the presentation is available at youtube.com/playlist?list=PL9SOLKoGjbeqNcdQVqFpUz7HYqD1fbFIg, consisting of 14 short sequences. The paper presents not only the basic formal concepts tackled in the video version, but also an extensive literature to provide the reader with further references covering the area. We first introduce motivation behind parametric verification in general, and then focus on different models and approaches, for verifying several kinds of systems. They include Parametric Timed Automata, for modelling real-time systems, where the timing constraints are not necessarily known a priori. Similarly, Parametric Interval Markov Chains allow for modelling systems where probabilities of events occurrences are intervals with parametric bounds. Parametric Petri Nets allow for compact representation of systems, and cope with different types of parameters. Finally, Action Synthesis aims at enabling or disabling actions in a concurrent system to guarantee some of its properties. Some tools implementing these approaches were used during hands-on sessions at the tutorial. The corresponding practicals are freely available on the Web.

show abstract

“…Parametric timed automata (PTA) [1] allow clocks to be tested against parameters, which may allow simulation of parametric weights to some extent. The optimal time reachability problem has recently been studied for PTA [2]. Similarly, the bounded-cost reachability problem has been addressed for a formalism related to PTA called parametric time Petri nets in [7].…”

Section: Introductionmentioning

confidence: 99%

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs

Sérée

Jezequel

Lime

2021

Language and Automata Theory and Applications

View full text Add to dashboard Cite

We consider weighted graphs with parameterized weights and we propose an algorithm that, given such a graph and a source node, builds a collection of trees, each one describing the shortest paths from the source to all the other nodes of the graph for a particular zone of the parameter space. Moreover, the union of these zones covers the full parameter space: given any valuation of the parameters, one of the trees gives the shortest paths from the source to all the other nodes of the graph when the weights are computed using this valuation.

show abstract

Minimal-Time Synthesis for Parametric Timed Automata

Cited by 9 publications

References 26 publications

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

Parametric Verification: An Introduction

An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs

Contact Info

Product

Resources

About