Timed pushdown automata revisited

Proceedings - Symposium on Logic in Computer Science

Volumn 2015-July, Issue , 2015, Pages 738-749

  Clemente, Lorenzo ^a   Lasota, Slawomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Orbit finite; Pushdown automata; Sets with atoms; Timed automata

Indexed keywords

AUTOMATA THEORY; ROBOTS;

COMPLEXITY BOUNDS; EMPTINESS PROBLEM; EXPTIME; FIRST ORDER; GENERAL MODEL; PUSH-DOWN AUTOMATA; TIMED AUTOMATA; TURING-COMPLETE;

COMPUTER CIRCUITS;

EID: 84945910812     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2015.73     Document Type: Conference Paper

References (15)

1. R. Alur and D. L. Dill, "A theory of timed automata, " Theor. Comput. Sci., vol. 126, pp. 183-235, April 1994.
2. A. Bouajjani, R. Echahed, and R. Robbana, "On the automatic verification of systems with continuous variables and unbounded discrete data structures, " in Hybrid Systems'94, 1994, pp. 64-85.
3. A. Trivedi and D. Wojtczak, "Recursive timed automata, " in Proc. of ATVA'10. Springer, 2010, pp. 306-324.
4. M. Benerecetti, S. Minopoli, and A. Peron, "Analysis of timed recursive state machines, " in Proc. of TIME'10, sept. 2010, pp. 61-68.
5. P. A. Abdulla, M. F. Atig, and J. Stenman, "Dense-timed pushdown automata, " in Proc. of LICS'12, june 2012, pp. 35-44.
6. M. Kaminski and N. Francez, "Finite-memory automata, " Theor. Comput. Sci., vol. 134, no. 2, pp. 329-363, 1994.
7. M. Bojánczyk, B. Klin, and S. Lasota, "Automata theory in nominal sets, " Logical Methods in Computer Science, vol. 10, no. 3:4, 2013.
8. E. Y. C. Cheng and M. Kaminski, "Context-free languages over infinite alphabets, " Acta Inf., vol. 35, no. 3, pp. 245-267, 1998.
9. M. Bojanczyk and S. Lasota, "A machine-independent characterization of timed languages, " in In Proc. of ICALP'12. Springer, 2012, pp. 92-103.
10. A. Je?z and A. Okhotin, "Complexity of equations over sets of natural numbers, " Theory Comput. Syst., vol. 48, no. 2, pp. 319-342, 2011.
11. L. Clemente and S. Lasota, "Timed pushdown automata revisited, " University of Warsaw, Tech. Rep., 2015. [Online]. Available: Http://arxiv. org/abs/1503. 02422
12. B. Bérard, A. Petit, V. Diekert, and P. Gastin, "Characterization of the expressive power of silent transitions in timed automata, " Fundam. Inf., vol. 36, no. 2-3, pp. 145-182, Nov. 1998.
13. A. Je?z and A. Okhotin, "Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth, " Theory Comput. Syst., vol. 46, no. 1, pp. 27-58, 2010.
14. L. Clemente and S. Lasota, "Reachability analysis of first-order definable pushdown systems, " University of Warsaw, Tech. Rep., 2015, submitted to CSL'15. [Online]. Available: Http://arxiv. org/abs/1504. 02651
15. D. Macpherson, "A survey of homogeneous structures, " Discrete Mathematics, vol. 311, no. 15, p. 15991634, 2011.