Weak alternating timed automata

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

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 273-284

  Parys, Pawel ^a   Walukiewicz, Igor ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACCEPTANCE CONDITIONS; CHARACTERISATION; EMPTINESS PROBLEM; INFINITE WORD; TIMED AUTOMATA; TIMED TEMPORAL LOGIC;

COMPUTABILITY AND DECIDABILITY; LINGUISTICS; ROBOTS;

TRANSLATION (LANGUAGES);

EID: 70449122817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_23     Document Type: Conference Paper

References (29)

1. Abdulla, P., Jonsson, B.: Veryfying networks of timed processes. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 298-312. Springer, Heidelberg (1998)
2. Abdulla, P., Jonsson, B.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53-70. Springer, Heidelberg (2001)
3. Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundam. Inform. 89(4), 419-450 (2008)
4. Abdulla, P.A., Ouaknine, J., Quaas, K., Worrell, J.: Zone-based universality analysis for single-clock timed automata. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 98-112. Springer, Heidelberg (2007)
5. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183-235 (1994)
6. Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116-146 (1996)
7. Alur, R., Fix, L., Henzinger, T.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 204 (1997)
8. Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181-204 (1994)
9. Bouyer, P.: Model-checking timed temporal logics. In: Workshop on Methods for Modalities (M4M-5), Cachan, France. Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, Amsterdam (2009)
10. Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 432-443. Springer, Heidelberg (2005)
11. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: LICS, pp. 109-120 (2007)
12. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: On expressiveness and complexity in real-time model checking. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 124-135. Springer, Heidelberg (2008)
13. Hirshfeld, Y., Rabinovich, A.M.: Logics for real time: Decidability and complexity. Fundam. Inform. 62(1), 1-28 (2004)
14. Hung, D.V., Ji, W.: On the design of hybrid control systems using automata models. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 156-167. Springer, Heidelberg (1996)
15. Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 250-265. Springer, Heidelberg (2005)
16. Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Comput. Log. 9(2) (2008)
17. Mostowski, A.W.: Hierarchies of weak automata and week monadic formulas. Theoretical Computer Science 83, 323-335 (1991)
18. Murlak, F.: Weak index versus borel rank. In: STACS, Dagstuhl Seminar Proceedings, pp. 573-584. Dagsr (2008)
19. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: Closing a decidability gap. In: Proc. LICS 2004, pp. 54-63 (2004)
20. Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: LICS, pp. 188-197 (2005)
21. Ouaknine, J., Worrell, J.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 217-230. Springer, Heidelberg (2006)
22. Ouaknine, J., Worrell, J.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 411-425. Springer, Heidelberg (2006)
23. Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1) (2007)
24. Ouaknine, J., Worrell, J.: Some recent results in metric temporal logic. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 1-13. Springer, Heidelberg (2008)
25. Parys, P., Walukiewicz, I.: Weak alternating timed automata. HAL (2009), http://hal.archives-ouvertes.fr/hal-00360122/fr/
26. Vardi, M.Y., Wolper, P.: Automata theoretic techniques for modal logics of programs. In: Sixteenth ACM Symposium on the Theoretical Computer Science (1984)
27. Wagner, K.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK 13, 473-487 (1977)
28. Wagner, K., Staiger, L.: Automatentheoretische und automatenfreie charakterisierungen topologischer klassen regularer folgenmengen. EIK 10, 379-392 (1974)
29. Wilke, T.: Classifying discrete temporal properties. Habilitation thesis, Kiel, Germany (1998)