Synchronized Recursive Timed Automata


We present synchronized recursive timed automata (SRTA) that extend timed automata with a stack. Each frame of a stack is composed of rational-valued clocks, and SRTA synchronously increase the values of all the clocks within the stack. Our main contribution is to show that the reachability problem of SRTA is ExpTime-complete. This decidability contrasts… (More)
DOI: 10.1007/978-3-662-48899-7_18


Cite this paper

@inproceedings{Uezato2015SynchronizedRT, title={Synchronized Recursive Timed Automata}, author={Yuya Uezato and Yasuhiko Minamide}, booktitle={LPAR}, year={2015} }