Alternating timed automata over bounded time

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 60-69

  Jenkins, Mark ^a   Ouaknine, Joël ^a   Rabinovich, Alexander ^b   Worrell, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Alternation; Church's problem; Timed automata

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; MODEL CHECKING; SPECIFICATIONS;

ALTERNATION; BOOLEAN OPERATIONS; BOUNDED MODEL CHECKING; EMPTINESS PROBLEM; METRIC TEMPORAL LOGIC; TIMED AUTOMATA; VERIFICATION ALGORITHMS; WINNING CONDITIONS;

ROBOTS;

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

References (37)

1. R. Alur and D. Dill, "A theory of timed automata," Theoret. Comp. Sci., vol. 126, pp. 183-235, 1994.
2. R. Alur, C. Courcoubetis, and D. Dill, "Model-checking for real-time systems," in Proc. LICS'90. IEEE, 1990.
3. P. Herrmann, "Timed automata and recognizability," Information Processing Letters, vol. 65, pp. 313-318, 1998.
4. A. K. Chandra, D. Kozen, and L. J. Stockmeyer, "Alternation," J. ACM, vol. 28, no. 1, pp. 114-133, 1981.
5. O. Kupferman and M. Y. Vardi, "Weak alternating automata are not that weak," ACM Trans. Comput. Log., vol. 2, no. 3, pp. 408-429, 2001.
6. M. Y. Vardi, "Alternating automata and program verification," in Computer Science Today, ser. LNCS. Springer, 1995, vol. 1000.
7. C. Löding and W. Thomas, "Alternating automata and logics over infinite words," in Proc. IFIP TCS'00, ser. LNCS, vol. 1872. Springer, 2000.
8. E. A. Emerson and C. S. Jutla, "Tree automata, mu-calculus and determinacy (extended abstract)," in Proc. FOCS'91. IEEE, 1991.
9. J. Ouaknine and J. Worrell, "On the decidability of metric temporal logic," in Proc. LICS'05. IEEE, 2005.
10. S. Lasota and I. Walukiewicz, "Alternating timed automata," ACM Trans. on Computational Logic, vol. 9, no. 2, pp. 1-27, 2008.
11. J. Ouaknine and J. Worrell, "On the decidability and complexity of metric temporal logic over finite words," Logicical Methods in Computer Science, vol. 3, no. 1, pp. 1-27, Mar. 2007.
12. M. Dickhöfer and T. Wilke, "Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem," in Proc. ICALP'99, vol. 1644. Springer, 1999.
13. J. Ouaknine and J. Worrell, "Safety metric temporal logic is fully decidable," in Proc. TACAS'06, ser. LNCS, vol. 3920. Springer, 2006.
14. P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell, "The cost of punctuality," in Proc. LICS'07. IEEE, 2007.
15. O. Roux and V. Rusu, "Verifying time-bounded properties for ELECTRE reactive programs with stopwatch automata," in Hybrid Systems, ser. LNCS, vol. 999. Springer, 1994.
16. C. Baier, H. Hermanns, J.-P. Katoen, and B. R. Haverkort, "Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes," Theor. Comput. Sci., vol. 345, no. 1, 2005.
17. J.-P. Katoen and I. S. Zapreev, "Safe on-the-fly steady-state detection for time-bounded reachability," in Proc. QEST'06. IEEE, 2006.
18. J. R. Büchi, "On a decision method in restricted second-order arithmetic," in Proc. 1960 International Congress on Logic, Methodology and Philosophy of Science. Stanford University Press, 1962.
19. M. Rabin, "Decidability of second order theories and automata on infinite trees," Transaction of the AMS, vol. 141, pp. 1-35, 1969.
20. R. McNaughton, "Testing and generating infinite sequences by a finite automaton," Inf. Contr., vol. 9, pp. 521-530, 1966.
21. A. Church, "Applications of recursive arithmetic to the problem of circuit synthesis," in Summaries of the Summer Institute of Symbolic Logic, vol. 1. Cornel Univ, Ithaca, 1957.
22. J. R. Büchi and L. H. Landweber, "Solving sequential conditions by finite-state strategies," Transactions of the AMS, vol. 138, no. 27, pp. 295-311, 1969.
23. W. Thomas, "Church's problem and a tour through automata theory," in Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, ser. LNCS, vol. 4800. Springer, 2008.
24. R. Alur, L. Fix, and T. A. Henzinger, "Event-clock automata: A determinizable class of timed automata," Theoret. Comp. Sci., vol. 211, pp. 253-273, 1999.
25. T. Wilke, "Specifying timed state sequences in powerful decidable logics and timed automata," in Proc. FTRTFT'94, ser. LNCS, vol. 863. Springer, 1994.
26. T. A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens, "The regular real-time languages," in Proc. ICALP'98, ser. LNCS, vol. 1443. Springer, 1998.
27. J. Ouaknine, A. Rabinovich, and J. Worrell, "Time-bounded verification," in Proc. CONCUR'09, ser. LNCS, vol. 5710. Springer, 2009.
28. G. Hoffmann and H. Wong-Toi, "The input-output control of real-time discrete event systems," in Proc. IEEE Real-Time Systems Symposium, 1992.
29. O. Maler, A. Pnueli, and J. Sifakis, "On the synthesis of discrete controllers for timed systems (an extended abstract)," in Proc. STACS'95, ser. LNCS, vol. 900. Springer, 1995.
30. T. Brihaye, T. Henzinger, V. Prabhu, and J.-F. Raskin, "Minimum-time reachability in timed games," in Proc. ICALP'07, ser. LNCS, vol. 4596. Springer, 2007.
31. G. Behrmann, A. Cougnard, A. David, E. Fleury, K. G. Larsen, and D. Lime, "Uppaal-tiga: Time for playing games!" in Proc. CAV'07, ser. LNCS, vol. 4590. Springer, 2007.
32. P. Hänsch, M. Slaats, and W. Thomas, "Parametrized regular infinite games and higher-order pushdown strategies," in Proc. FCT'09, ser. LNCS, vol. 5699. Springer, 2009.
33. A. Rabinovich, "The church synthesis problem with parameters," Logical Methods in Computer Science, vol. 3, no. 4, 2007.
34. S. Shelah, "The monadic theory of order," Annals of Math., vol. 102, pp. 349-419, 1975.
35. A. Rabinovich, "Finite variability interpretation of monadic logic of order," Theor. Comput. Sci., vol. 275, no. 1-2, pp. 111-125, 2002.
36. -, "Church synthesis problem with parameters," in Proc. CSL'06, ser. LNCS, vol. 4207. Springer, 2006.
37. L. J. Stockmeyer and A. R. Meyer, "Word problems requiring exponential time," in Proc. STOC'73. ACM, 1973.