On parametric timed automata and one-counter machines
<p>Two decades ago, Alur, Henzinger, and Vardi introduced the reachability problem for parametric timed automata in the seminal paper. Their main results are that reachability is decidable for timed automata with a single parametric clock, and undecidable for timed automata with three or more...
| Autors principals: | , |
|---|---|
| Format: | Journal article |
| Publicat: |
Elsevier
2016
|