Folk theorems on the determinization and minimization of timed automata

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

Volumn 2791, Issue , 2004, Pages 182-188

  Tripakis, Stavros ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; TIME SHARING SYSTEMS;

DECISION PROBLEMS; DETERMINIZATION; FOLK THEOREMS; TIMED AUTOMATA; UNIVERSALITY PROBLEM; UNSOLVABLE PROBLEMS;

PROBLEM SOLVING;

EID: 24644433871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_15     Document Type: Article

References (16)

1. R. Alur, C.Courcoubetis, N. Halbwachs, D. L. Dill, and H. Wong-Toi. Minimization of timed transition systems. In 3rd Conference on Concurrency Theory CONCUR '92, volume 630 of Lecture Notes in Computer Science, pages 340-354. Springer-Verlag, 1992.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. R. Alur, L. Fix, and T. Henzinger. A determinizable class of timed automata. In CAV'94, volume 818. LNCS, Springer, 1994.
4. P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In CAV'03, 2003.
5. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Are timed automata updatable? In CAV'00. LNCS 1855, 2000.
6. P. Bouyer, C. Dufourd, E. Fleury, and A. Petit. Expressiveness of updatable timed automata. In MFCS'00. LNCS 1893, 2000.
7. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In Computer-Aided Verification, LNCS 575. Springer-Verlag, 1991.
8. C. Daws and S. Yovine. Reducing the number of clock variables of timed automata. In Proc. 17th IEEE Real-Time Systems Symposium, RTSS'96, 1996.
9. D. D'Souza and P. Madhusudan. Controller synthesis for timed specifications. In Springer LNCS, editor, STACS'02, volume 2285, 2002.
10. B. Nielsen and A. Skou. Automated test generation from timed automata. In TACAS'01. LNCS 2031, Springer, 2001.
11. J. Springintveld, F. Vaandrager, and P. D'Argenio. Testing timed automata. Theoretical Computer Science, 254, 2001.
12. J. G. Springintveld and F. W. Vaandrager. Minimizable timed automata. In FTRTFT'96, pages 130-147. LNCS 1135, 1996.
13. S. Tripakis. Fault diagnosis for timed automata. In FTRTFT'02. LNCS 2469, Springer, 2002.
14. S. Tripakis and S. Yovine. Analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design, 18(1):25-68, January 2001.
15. Thomas Wilke. Automaten und Logiken zur Beschreibung zeitabhängiger Systeme. PhD thesis, Institut Für Informatik und Praktische Mathematik, Christian-Albrechts Universität, Kiel, 1994. In German.
16. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. Formal Methods in System Design, 11(2), 1997.