Decision Problems for Lower/Upper Bound Parametric Timed Automata [chapter]

Laura Bozzelli, Salvatore La Torre
2007 Lecture Notes in Computer Science  
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 un upper bound. For such automata, we show that checking if for a parameter valuation (resp., all parameter valuations) there is an infinite accepting run 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
more » ... roblems are still PSPACE-complete, if the lower bound parameters are not compared to 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.
doi:10.1007/978-3-540-73420-8_79 fatcat:qfzxsku6o5h77irx5a5tcma67q