A Benchmark Library for Parametric Timed Model Checking

André, Étienne

doi:10.1007/978-3-030-12988-0_5

Cited by 12 publications

(14 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Alternative scheduler models: A natural future work will be to propose optimizations or variants in the translation, notably of the scheduler model, and test their practical efficiency on a set of benchmarks, such as the IMITATOR benchmarks library [And19]. Implementing other scheduling policies, such as earliest deadline first (EDF) or shortest job first (SJF), should be straightforward.…”

Section: Perspectivesmentioning

confidence: 99%

Formalizing Time4sys using parametric timed automata

André

2019

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)

View full text Add to dashboard Cite

Critical real-time systems must be verified to avoid the risk of dramatic consequences in case of failure. Thales developed an open formalism "Time4sys" to model real-time systems, with expressive features such as periodic or sporadic tasks, task dependencies, distributed systems, etc. However, Time4sys does not natively allow for a formal reasoning. In this work, we present a translation from Time4sys to (parametric) timed automata, so as to allow for a formal verification.

show abstract

Section: Perspectivesmentioning

confidence: 99%

Formalizing Time4sys using parametric timed automata

André

2019

2019 International Symposium on Theoretical Aspects of Software Engineering (TASE)

View full text Add to dashboard Cite

show abstract

“…For all stated problems we provide algorithms to solve them and empirically compare them with a set of benchmark experiments for PTAs, obtained from [5]. Interestingly, compared to standard reachability and synthesis, minimal-time reachability and synthesis is in general computed faster as fewer states have to be considered in the exploration.…”

Section: Example 1 Consider the Example Inmentioning

confidence: 99%

“…Benchmark models. We collected PTA models and properties from the IMITA-TOR benchmarks library [5] which contains numerous benchmark models from…”

Section: Algorithm 2: Mintimesynth(a T X Global ) Inputmentioning

confidence: 99%

Minimal-Time Synthesis for Parametric Timed Automata

André¹,

Bloemen²,

Petrucci³

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Parametric timed automata (PTA) extend timed automata by allowing parameters in clock constraints. Such a formalism is for instance useful when reasoning about unknown delays in a timed system. Using existing techniques, a user can synthesize the parameter constraints that allow the system to reach a specified goal location, regardless of how much time has passed for the internal clocks. We focus on synthesizing parameters such that not only the goal location is reached, but we also address the following questions: what is the minimal time to reach the goal location? and for which parameter values can we achieve this? We analyse the problem and present a semialgorithm to solve it. We also discuss and provide solutions for minimizing a specific parameter value to still reach the goal. We empirically study the performance of these algorithms on a benchmark set for PTAs and show that minimal-time reachability synthesis is more efficient to compute than the standard synthesis algorithm for reachability. Data or code related to this paper is available at: [26].

show abstract

“…However, most of the parameter synthesis problems are undecidable [6]. While symbolic algorithms without termination guarantees exist for some subclasses [25,39,12], these algorithms are computationally very expensive compared to model checking (see [5]). Moreover, minimizing the number of modified clock constraints is not straightforward.…”

Section: Introductionmentioning

confidence: 99%

Timed Automata Relaxation for Reachability

Bendík

Sencan

Göl

et al. 2021

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Timed automata (TA) have shown to be a suitable formalism for modeling real-time systems. Moreover, modern model-checking tools allow a designer to check whether a TA complies with the system specification. However, the exact timing constraints of the system are often uncertain during the design phase. Consequently, the designer is able to build a TA with a correct structure, however, the timing constraints need to be tuned to make the TA comply with the specification.In this work, we assume that we are given a TA together with an existential property, such as reachability, that is not satisfied by the TA. We propose a novel concept of a minimal sufficient reduction (MSR) that allows us to identify the minimal set S of timing constraints of the TA that needs to be tuned to meet the specification. Moreover, we employ mixed-integer linear programming to actually find a tuning of S that leads to meeting the specification.

show abstract

A Benchmark Library for Parametric Timed Model Checking

Cited by 12 publications

References 41 publications

Formalizing Time4sys using parametric timed automata

Formalizing Time4sys using parametric timed automata

Minimal-Time Synthesis for Parametric Timed Automata

Timed Automata Relaxation for Reachability

Contact Info

Product

Resources

About