Alternating timed automata

ACM Transactions on Computational Logic

Volumn 9, Issue 2, 2008, Pages

  Lasota, Slawomir ^a,c   Walukiewicz, Igor ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

Alternation; Emptyness problem; Timed automata

Indexed keywords

ALTERNATION; EMPTYNESS PROBLEM; TIMED AUTOMATA;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING; THEOREM PROVING;

AUTOMATA THEORY;

EID: 42149167521     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1342991.1342994     Document Type: Article

References (23)

1. ABDULLA, P. AND JONSSON, B. 1998. Veryfying networks of timed processes. In Proceedings of the International Conference Tools and Algorithms for the Construction and Analysis of System (TACAS'98). Lecture Notes in Computer Science. Springer-Verlag, New York, 298-312.
2. ABDULLA, P. AND JONSSON, B. 2001. Timed petri nets and BQOs. In Proceedings of the ICATPN'01. 53-70.
3. ABDULLA, P., ČERĀNS, K., JONSSON, B., AND TSAY, Y. 1996. General decidability theorems for infinite state systems. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'96). IEEE Computer Society Press, Los Alamitos, CA, 313-323.
4. ABDULLA, P. A., DENEUX, J., OUAKNINE, J., AND WORRELL, J. 2005. Decidability and complexity results for timed automata via channel machines. In Proceedings of the International Colloquium on Automata, Language and Programming (ICALP'05). Lecture Notes in Computer Science, vol. 3580. Springer-Verlag, New York, 1089-1101.
5. ALUR, R., BERNADSKY, M., AND MADHUSUDAN, P. 2004. Optimal reachability for weighted timed games. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 3124. Springer-Verlag, New York, 122-133.
6. ALUR, R. AND DILL, D. 1994. A theory of timed automata. Theoret. Comput. Sci. 126, 183-235.
7. ALUR, R., FIX, L., AND HENZINGER, T. 1999. Event-clock automata: A determinizable class of timed automata. Theoret. Comput. Sci. 204, 253-273.
8. ALUR, R., HENZINGER, T., AND VARDI, M. 1993. Parametric real-time reasoning. In Proceedings of the Symposium on Theory of Computing (STOC'93). ACM, New York, 592-601.
9. ASARIN, E., MALER, O., PNUELI, A., AND SIFAKIS, J. 1998. Controller synthesis for timed automata. In Proceedings of the IFAC Symposium on System Structure and Control. 469-474.
10. BÉRARD, B., DIEKERT, V., GASTIN, P., AND PETIT, A. 1998. Characterization of the expressive power of silent transitions in timed automata. Fund. Inf. 36, 2, 145-182.
11. BOUYER, P., CASSEZ, F., FLEURY, E., AND LARSEN, K. G. 2004. Optimal strategies in priced timed game automata. In Proceedings of the FSTTCS'04. Lecture Notes in Computer Science, vol. 3328. Springer-Verlag, New York, 148-160.
12. BOUYER, P., D'SOUZA, D., MADHUSUDAN, P., AND PETIT, A. 2003. Timed control with partial observability. In Proceedings of the CAV'03, Lecture Notes in Computer Science, vol. 2725. Springer-Verlag, 180-192.
13. BRAND, D. AND ZAFIROPULO, P. 1983. On communicating finite-state machines. J. ACM 30, 2, 323-342.
14. CASSEZ, F., HENZINGER, T. A., AND RASKIN, J.-F. 2002. A comparison of control problems for timed and hybrid systems. In Proceedings of the Hybrid Systems Computation and Control (HSCC'02). 134-148.
15. DICKHÖFER, M. AND WILKE, T. 1999. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In Proceedings of the International Colloquium on Automata, Language and Programming (ICALP'99). Lecture Notes in Computer Science, vol. 1644. Springer-Verlag, New York, 281-290.
16. DIMA, C. 2000. Real-time automata and the Kleene algebra of sets of real numbers. In Proceedings of the STACS'00. Lecture Notes in Computer Science, vol. 1170. Springer-Verlag, New York, 279-289.
17. FINKEL, A. AND SCHNOEBELEN, P. 2001. Well structured transition systems everywhere! Theoret. Comput. Sci. 256, 1-2, 63-92.
18. HIGMAN, G. 1952. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 7, 326-336.
19. LAROUSSINIE, F., MARKEY, N., AND SCHNOEBELEN, P. 2004. Model checking timed automata with one or two clocks. In Proceedings of the CONCUR'04. Lecture Notes in Computer Science, vol. 3170. Springer-Verlag, New York, 387-401.
20. OUAKNINE, J. AND WORRELL, J. 2004. On the language inclusion problem for timed automata: Closing a decidability gap. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'04). IEEE Computer Society Press, Los Alamitos, CA, 54-63.
21. OUAKNINE, J. AND WORRELL, J. 2005. On the decidability of metric temporal logic. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'05). IEEE Computer Society Press, Los Alamitos, CA, 188-197.
22. SCHNOEBELEN, P. 2002. Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Proc. Lett. 83, 5, 251-261.
23. TORRE, S. L. AND NAPOLI, M. 2001. Timed tree automata with an application to temporal logic. Acta Inf. 38, 2, 89-116.