Decision Problems for Lower/Upper Bound Parametric Timed Automata
نویسندگان
چکیده
We investigate a class of parametric timed automata, called lower bound/upper bound (L/U) automata, where each parameter occurs in the timing constraints either as a lower bound or as an upper bound. For such automata, we show that basic decision problems, such as emptiness, finiteness and universality of the set of parameter valuations for which there is a corresponding infinite accepting run of the automaton, is PSPACE-complete. We extend these results by allowing the specification of constraints on parameters as a linear system. We show that the considered decision problems are still PSPACE-complete, if the lower bound parameters are not compared with the upper bound parameters in the linear system, and are undecidable in general. Finally, we consider a parametric extension of MITL0,∞, and prove that the related satisfiability and model checking (w.r.t. L/U automata) problems are PSPACE-complete.
منابع مشابه
Parametric Interrupt Timed Automata
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 decid...
متن کاملSMT-based parameter synthesis for L/U automata
We present and evaluate a straightforward method of representing finite runs of a parametric timed automaton (PTA) by means of formulae accepted by satisfiability modulo theories (SMT)-solvers. Our method is applied to the problem of parametric reachability, i.e., the synthesis of a set of the parameter substitutions under which a state satisfying a given property is reachable. While the proble...
متن کاملModelling and Analysis of Asynchronous Circuits and Timing Diagrams Using Parametric Timed Automata
Many successful model checking methods have been applied to hardware design in real-time applications. In this paper, we apply Parametric Timed Automata (PTA) to model the delays of asynchronous circuits. The PTAs modelling the delays of asynchronous circuits fall into the so-called lower bound and upper bound automata (L/U automata) which are subclasses of general PTAs with a decidable reachab...
متن کاملDecision Problems for Parametric Timed Automata
Parametric timed automata (PTAs) allow to reason on systems featuring concurrency and timing constraints making use of parameters. Most problems are undecidable for PTAs, including the parametric reachability emptiness problem, i. e., whether at least one parameter valuation allows to reach some discrete state. In this paper, we first exhibit a subclass of PTAs (namely integer-points PTAs) with...
متن کاملTowards Scenario-Based Synthesis for Parametric Timed Automata
A number of approaches exists that permit to synthesize the operational state-based behavior of a set of components for a set of scenarios. In this paper we explore how to extend these approaches to also tackle the problem for scenarios with parametric timing constraints in form of upper and lower time bounds. The resulting time consistency problems are identified and ideas for an algorithmic h...
متن کامل