Recursive timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6252 LNCS, Issue , 2010, Pages 306-324

  Trivedi, Ashutosh ^a   Wojtczak, Dominik ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE SET; REACHABILITY; REACHABILITY PROBLEM; REAL-VALUED VARIABLES; RECURSIONS; TIMED AUTOMATA; TWO-PLAYER GAMES;

CLOCKS; REAL VARIABLES; TRANSLATION (LANGUAGES); GAME THEORY;

AUTOMATA THEORY; CLOCKS;

EID: 78049349192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15643-4_23     Document Type: Conference Paper

References (22)

1. Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T., Yannakakis, M.: Analysis of recursive state machines. ACM Transactions on Programming Languages and Systems 27, 786-818 (2005)
2. Alur, R., Dill, D.: A theory of timed automata. Theor. Comput. Sci. 126 (1994)
3. Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. In: ACM SIGSOFT 1998, pp. 175-188 (1998)
4. Ball, T., Rajamani, S.: The slam toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 260-264. Springer, Heidelberg (2001)
5. Bouajjani, A., Echahed, R., Robbana, R.: On the automatic verification of systems with continuous variables and unbounded discrete data structures. In: Antsaklis, P. J., Kohn, W., Nerode, A., Sastry, S. S. (eds.) HS 1994. LNCS, vol. 999, pp. 64-85. Springer, Heidelberg (1995)
6. Bouajjani, A., Echahed, R., Robbana, R.: Verification of context-free timed systems using linear hybrid observers. In: Dill, D. L. (ed.) CAV 1994. LNCS, vol. 818, pp. 118-131. Springer, Heidelberg (1994)
7. Bouchy, F., Finkel, A., Sangnier, A.: Reachability in timed counter systems. Electronic Notes in Theoretical Computer Science 239, 167-178 (2009); Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008)
8. Buttazzo, G. C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, Santa Clara (2004)
9. Cassez, F., Jessen, J. J., Larsen, K. G., Raskin, J.-F., Reynier, P.-A.: Automatic synthesis of robust and optimal controllers - an industrial case study. In: Majumdar, R., Tabuada, P. (eds.) HSCC 2009. LNCS, vol. 5469, pp. 90-104. Springer, Heidelberg (2009)
10. Dang, Z.: Binary reachability analysis of pushdown timed automata with dense clocks. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 506-517. Springer, Heidelberg (2001)
11. Dang, Z.: Pushdown timed automata: a binary reachability characterization and safety verification. Theor. Comput. Sci. 302 (1-3), 93-121 (2003)
12. Demri, S., Gascon, R.: The Effects of Bounding Syntactic Resources on Presburger LTL. J. Logic Computation 19(6), 1541-1575 (2009)
13. Emmi, M., Majumdar, R.: Decision problems for the verification of real-time software. In: Hybrid Systems: Computation and Control, pp. 200-211 (2006)
14. Etessami, K., Yannakakis, M.: Recursive markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G. F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 891-903. Springer, Heidelberg (2005)
15. Etessami, K.: Analysis of recursive game graphs using data flow equations. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 282-296. Springer, Heidelberg (2004)
16. Etessami, K., Wojtczak, D., Yannakakis, M.: Quasi-Birth-Death processes, Tree-like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. Performance Evaluation 67(9), 837-857 (2010); Special Issue of QEST 2008 (2008)
17. Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
18. Jancar, P., Sawa, Z.: A note on emptiness for alternating finite automata with a one-letter alphabet. Inf. Process. Lett. 104(5), 164-167 (2007)
19. Minsky, M. L.: Computation: finite and infinite machines. Prentice-Hall, Inc., Englewood Cliffs (1967)
20. Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 337-351. Springer, Heidelberg (2006)
21. Trivedi, A., Wojtczak, D.: Recursive timed automata. Oxford University Computing Laboratory technical report, RR-10-09 (2010)
22. Walukiewicz, I.: Pushdown processes: Games and model checking, pp. 62-74 (1996)