Improved Undecidability Results for Reachability Games on Recursive Timed Automata

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...

Full description

Bibliographic Details
Main Authors: Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi
Format: Article
Language:English
Published: Open Publishing Association 2014-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1408.5968v1

Internet

http://arxiv.org/pdf/1408.5968v1

Similar Items