Integer Parameter Synthesis for Timed Automata

Jovanovic, Aleksandra; Lime, Didier; Roux, Olivier H.

doi:10.1007/978-3-642-36742-7_28

Cited by 40 publications

(70 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [20], the authors apply the bounded model checking procedure to solve the synthesis problem for the existential fragment of CTL without the next operator. In [7], the authors show PSPACE-completeness of the emptiness problem in parametric L/U timed automata for properties on infinite runs, while [18] consider the same class of automata for TCTL properties, also showing PSPACEcompleteness. A parametric extension of timed I/O automata is given in [23], where it is shown how to construct an implementation of the specification that is robust under a given timed perturbation.…”

Section: Contributionsmentioning

confidence: 99%

See 1 more Smart Citation

Synthesising optimal timing delays for timed I/O automata

Diciolla

Kim

Kwiatkowska

et al. 2014

Proceedings of the 14th International Conference on Embedded Software

View full text Add to dashboard Cite

In many real-time embedded systems, the choice of values for the timing delays can crucially affect the safety or quantitative characteristics of their execution. We propose a parameter synthesis algorithm that finds optimal timing delays guaranteeing that the system satisfies a given quantitative property. As a modelling framework we consider networks of Timed Input/Output Automata (TIOA) with priorities and parametric guards. To express system properties we extend Metric Temporal Logic (MTL) with counting formulas. We implement the algorithm using constraint solving and Monte Carlo sampling, and demonstrate the feasibility of our approach on a simplified model of a pacemaker. We are able to synthesise timing delays that ensure with high probability that energy usage is minimised, while maintaining the basic safety property of the pacemaker.

show abstract

Section: Contributionsmentioning

confidence: 99%

“…for reachability and branching-time logic specifications, but suffers from undecidability when parameters are real-valued. Most recent work has focused on identifying subclasses of models or parameter domains where the problem is tractable [18].…”

Section: Introductionmentioning

confidence: 99%

Synthesising optimal timing delays for timed I/O automata

Diciolla

Kim

Kwiatkowska

et al. 2014

Proceedings of the 14th International Conference on Embedded Software

View full text Add to dashboard Cite

show abstract

“…Relaxing completeness requirement or guaranteed termination, several methods and tools have been developed for parameter synthesis in timed automata [6,7,8], as well as in hybrid automata [9,10]. Another research direction consists in defining subclasses of parametric timed models for which some problems become decidable [11,12,13].…”

Section: Introductionmentioning

confidence: 99%

Parametric Interrupt Timed Automata

Bérard¹,

Haddad²,

Jovanovic³

et al. 2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Parametric reasoning is particularly relevant for timed models, but very often leads to undecidability of reachability problems. We propose a parametrised version of Interrupt Timed Automata (an expressive model incomparable to Timed Automata), where polynomials of parameters can occur in guards and updates. We prove that different reachability problems, including robust reachability, are decidable for this model, and we give complexity upper bounds for a fixed or variable number of clocks and parameters.

show abstract

“…The reachability-emptiness problem, which asks whether there exists a parameter valuation such that the automaton has an accepting run, is undecidable. Subsequent research has thus concentrated on finding subclasses for which certain problems would be decidable by restricting the use of parameters [9] or by restricting the parameter domain [11]. In [6], the authors consider fully deterministic networks of timed automata with priorities and parametric guards, and extended MTL with counting formulas.…”

Section: Contributionsmentioning

confidence: 99%

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions

Jovanovic

Kwiatkowska

2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a method to synthesise optimal values of timing parameters for probabilistic timed automata, in the sense that the probability of reaching some set of states is either maximised or minimised. Our first algorithm, based on forward exploration of the symbolic states, can only guarantee parameter values that correspond to upper (resp. lower) bounds on maximum (resp. minimum) reachability probability. To ensure precise reachability probabilities, we adapt the game-based abstraction refinement method. In the parametric setting, our method is able to determine all the possible maximum (or minimum) reachability probabilities that arise for different values of timing parameters, and yields optimal valuations represented as a set of symbolic constraints between parameters.

show abstract

Integer Parameter Synthesis for Timed Automata

Cited by 40 publications

References 18 publications

Synthesising optimal timing delays for timed I/O automata

Synthesising optimal timing delays for timed I/O automata

Parametric Interrupt Timed Automata

Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions

Contact Info

Product

Resources

About