Alternating timed automata

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 250-265

  Lasota, Sławomir ^a   Walukiewicz, Igor ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING;

BOOLEAN OPERATIONS; TIMED AUTOMATA; TIMED LANGUAGES;

AUTOMATA THEORY;

EID: 24644477667     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_16     Document Type: Conference Paper

References (17)

1. P. Abdulla, K. Čerans, B. Jonsson, and Y. Tsay. General decidability theorems for infinite state systems. In LICS'96, p. 313-323, 1996.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, M. Bernadsky, and P. Madhusudan. Optimal reachability for weighted timed games. In ICALP'04, volume 3124 of LNCS, p. 122-133, 2004.
4. R. Alur, L. Fix, and T. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 204:253-273, 1999.
5. E. Asarin, O. Maler, A. Pnueli, and J. Sifakis. Controller synthesis for timed automata. In Proc. IFAC Symp. System Structure and Control, p. 469-474, 1998.
6. P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen. Optimal strategies in priced timed game automata. In FSTTCS'04, LNCS, 2004.
7. P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In CAV'03, volume 2725 of LNCS, p. 180-192, 2003.
8. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323-342, 1983.
9. B. Bérard, V. Diekert, P. Gastin, and A. Petit. Characterization of the expressive power of silent transitions in timed automata. Fundamenta Informaticae, 36(2): 145-182, 1998.
10. F. Cassez, T. A. Henzinger, and J.-F. Raskin. A comparison of control problems for timed and hybrid systems. In Hybrid Systems Computation and Control (HSCC'02), volume 2289 of LNCS, p. 134-148, 2002.
11. M. Dickhöfer, T. Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In ICALP'99, volume 1644 of LNCS, p. 281-290, 1999.
12. C. Dima. Real-time automata and the Kleene algebra of sets of real numbers. In STACS'00, volume 1170 of LNCS, p. 279-289, 2000.
13. A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
14. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2(7):326-336, 1952.
15. F. Laroussinie, N. Markey, and Ph. Schnoebelen. Model checking timed automata with one or two clocks. In CONCUR'04, volume 3170 of LNCS, p. 387-401, 2004.
16. J. Ouaknine and J. Worrell. On the language inclusion problem for timed automata: Closing a decidability gap. In LICS'04, p. 54-63, 2004.
17. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261, 2002.