Improved Undecidability Results for Reachability Games on Recursive Timed Automata
We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clo...
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artikulua |
| Hizkuntza: | English |
| Argitaratua: |
Open Publishing Association
2014-08-01
|
| Saila: | Electronic Proceedings in Theoretical Computer Science |
| Sarrera elektronikoa: | http://arxiv.org/pdf/1408.5968v1 |