References

1. Parosh Aziz Abdulla, Mohamed Faouzi Atig & Jari Stenman (2012): Dense-Timed Pushdown Automata. In: LICS, pp. 35–44. Available at http://dx.doi.org/10.1109/LICS.2012.15.
2. Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps & Mihalis Yannakakis (2005): Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27(4), pp. 786–818. Available at http://doi.acm.org/10.1145/1075382.1075387.
3. Rajeev Alur & David L. Dill (1990): Automata For Modeling Real-Time Systems. In: ICALP, pp. 322–335. Available at http://dx.doi.org/10.1007/BFb0032042.
4. Rajeev Alur & David L. Dill (1994): A Theory of Timed Automata 126, pp. 183–235. Available at http://dx.doi.org/10.1016/0304-3975(94)90010-8.
5. Kousha Etessami (2004): Analysis of Recursive Game Graphs Using Data Flow Equations. In: VMCAI, pp. 282–296. Available at http://dx.doi.org/10.1007/978-3-540-24622-0_23.
6. Shankara Narayanan Krishna, Lakshmi Manasa & Ashutosh Trivedi (2014): On The Reachability Problem for Recursive Hybrid Automata with One and Two Players. In: Manuscript abs/1406.7289. Available at http://arxiv.org/abs/1406.7289.
7. Marvin L. Minsky (1967): Computation: finite and infinite machines. Prentice-Hall, Inc..
8. Joël Ouaknine & James Worrell (2010): Towards a Theory of Time-Bounded Verification. In: ICALP (2), pp. 22–37. Available at http://dx.doi.org/10.1007/978-3-642-14162-1_3.
9. Ashutosh Trivedi & Dominik Wojtczak (2010): Recursive Timed Automata. In: ATVA, pp. 306–324. Available at http://dx.doi.org/10.1007/978-3-642-15643-4_23.
10. Igor Walukiewicz (1996): Pushdown Processes: Games and Model Checking. In: CAV, pp. 62–74. Available at http://dx.doi.org/10.1007/3-540-61474-5_58.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org