Parametric Model Checking Timed Automata Under Non-Zenoness Assumption

André, Étienne; Nguyen, Hoang Gia; Petrucci, Laure; Sun, Jun

doi:10.1007/978-3-319-57288-8_3

Cited by 7 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other Algorithms. IMITATOR features a number of additional algorithms, including i) non-Zeno infinite run synthesis [27], ii) behavioral cartography [16] that partitions the parameter space into tiles where the discrete behavior is uniform, or iii) parametric reachability preservation, that takes as input a discrete state and a reference valuation, and synthesizes valuations for which this discrete state is reachable iff it is reachable for the reference valuation [25]. The two latter algorithms can be distributed over a cluster, showing interesting results, and can be used to perform reachability synthesis while being faster than the normal reachability synthesis algorithm for some benchmarks [14,15].…”

Section: # Synth Deadlockfreementioning

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 Deadlockfreementioning

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

“…the set {i | i ∈ F } is infinite. We ignore the problem of Zeno runs, which can be avoided by a syntactic transformation [9]. Example 1.…”

Section: Pta Parametric Zone Graphs and Accepted Runsmentioning

confidence: 99%

Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata

André

Arias

Petrucci

et al. 2021

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

We study semi-algorithms to synthesise the constraints under which a Parametric Timed Automaton satisfies some liveness requirement. The algorithms traverse a possibly infinite parametric zone graph, searching for accepting cycles. We provide new search and pruning algorithms, leading to successful termination for many examples. We demonstrate the success and efficiency of these algorithms on a benchmark. We also illustrate parameter synthesis for the classical Bounded Retransmission Protocol. Finally, we introduce a new notion of completeness in the limit, to investigate if an algorithm enumerates all solutions.

show abstract

“…This is considered as a modelling artefact as the behaviour it models cannot occur in any real system. These can be detected using model transformations such as in [6]. Therefore, w.l.o.g., we assume PTBAs are non-Zeno.…”

Section: (Symbolic Semantics)mentioning

confidence: 99%

Layered and Collecting NDFS with Subsumption for Parametric Timed Automata

Nguyen¹,

Petrucci²,

Pol³

2018

2018 23rd International Conference on Engineering of Complex Computer Systems (ICECCS)

Self Cite

View full text Add to dashboard Cite

This paper studies the analysis and parameter synthesis problems for Parametric Timed Automata (PTA) with properties in Linear-time Temporal Logic (LTL). It introduces a series of variations of Nested Depth-First Search (NDFS). We first study the LTL model checking problem for PTA. Based on a careful analysis of parametric zones, we introduce a new layered NDFS approach to LTL model checking. We integrate this with several techniques to prune the search space. In particular, we apply subsumption abstraction to PTA for the first time. We also propose heuristics on the search order to improve the performance. Next, we study parameter synthesis. To this end, this new layered approach and subsumption are added to a Collecting NDFS scheme. We implemented all algorithms in the IMITATOR tool and analyse their efficiency in a number of experiments.

show abstract

Parametric Model Checking Timed Automata Under Non-Zenoness Assumption

Cited by 7 publications

References 23 publications

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata

Layered and Collecting NDFS with Subsumption for Parametric Timed Automata

Contact Info

Product

Resources

About