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
.
Advances in Parametric Real-Time Reasoning
[chapter]
2014
Lecture Notes in Computer Science
We study the decidability and complexity of the reachability problem in parametric timed automata. The problem was introduced 20 years ago by Alur, Henzinger, and Vardi in [1], where they showed decidability in the case of a single parametric clock, and undecidability for timed automata with three or more parametric clocks. By translating such problems as reachability questions in certain extensions of parametric one-counter machines, we show that, in the case of two parametric clocks (and
doi:10.1007/978-3-662-44522-8_11
fatcat:lpm5mihzdrfernwuon6xqgeaxi