A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Decision Problems for Lower/Upper Bound Parametric Timed Automata
[chapter]
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
doi:10.1007/978-3-540-73420-8_79
fatcat:qfzxsku6o5h77irx5a5tcma67q