LTL Parameter Synthesis of Parametric Timed Automata

Bezděk, Peter; Beneš, Nikola; Barnat, Jǐŕı; Černá, Ivana

doi:10.1007/978-3-319-41591-8_12

Cited by 15 publications

(14 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We study the emptiness and related synthesis problem for Parametric Timed Büchi Automata with unrestricted use of rational parameters and real-valued clocks. In this general case, the model checking problem is undecidable [2] and therefore exact synthesis is out of reach (in contrast to the setting with bounded integers [20,11]). Decidability of liveness properties for a subclass of PTA, where the occurrence of parameters is restricted, is discussed in [8].…”

Section: Introductionmentioning

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

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

Section: Introductionmentioning

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

View full text Add to dashboard Cite

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

Self Cite

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

“…The same problem becomes decidable when a finite upper bound is given for each parameter. Nevertheless, symbolic algorithms without termination guarantees exist for variations of the synthesis problem [12][13][14], including reachability specifications. While parametric models provide considerable flexibility in the design, the synthesis algorithms are computationally very expensive, for example, see [15] for benchmark examples.…”

Section: Introductionmentioning

confidence: 99%

Control synthesis for parametric timed automata under reachability

Göl¹

2021

Turkish Journal of Electrical Engineering and Computer Sciences

View full text Add to dashboard Cite

Timed automata is a fundamental modeling formalism for real-time systems. During the design of such real-time systems, often the system information is incomplete, and design choices can vary. These uncertainties can be integrated to the model via parameters and labelled transitions. Then the design can be completed by tuning the parameters and restricting the transitions via controller synthesis. These problems, namely parameter synthesis and controller synthesis, are studied separately in the literature. Here, these are combined to generate an automaton satisfying the given specification by both parameter tuning and controller synthesis, thus exploring all design choices. First, it is shown that the negative decidability results derived for the parameter synthesis problem apply to the proposed problem. Then a specific version of the problem is studied, where the specification is to reach a target set and parameters can take values from bounded integer sets. An algorithm based on depth first analysis combined with an iterative feasibility check is presented to solve the proposed problem. The correctness and the completeness (under mild assumptions) of the developed algorithm are proven. The findings of the paper are illustrated on an example drawn from scheduling.

show abstract

LTL Parameter Synthesis of Parametric Timed Automata

Cited by 15 publications

References 24 publications

Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata

Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata

Timed Automata Relaxation for Reachability

Control synthesis for parametric timed automata under reachability

Contact Info

Product

Resources

About