A Kleene-Schützenberger theorem for weighted timed automata

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

Volumn 4962 LNCS, Issue , 2008, Pages 142-156

  Droste, Manfred ^a   Quaas, Karin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; FINITE AUTOMATA; FOUNDATIONS; MODEL CHECKING; ROBOTS; TRANSLATION (LANGUAGES);

COMPUTATIONAL STRUCTURES; EUROPEAN; HEIDELBERG (CO); INTERNATIONAL (CO); NEW TECHNIQUES; POWER SERIES; REACH ABILITY; REAL TIME COMMUNITY; SCHEDULING PROBLEMS; SEMI-RING; SOFTWARE SCIENCE; TIMED AUTOMATA (TA); TIMED LANGUAGES; WEIGHTED FINITE AUTOMATA (WFA); WEIGHTED TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 47249120476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_11     Document Type: Conference Paper

References (31)

1. Alur, R., Bernadsky, M., Madhusudan, P.: Optimal reachability in weighted timed games. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 122-133. Springer, Heidelberg (2004)
2. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
3. Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49-62. Springer, Heidelberg (2001)
4. Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1-24. Springer, Heidelberg (2004)
5. Asarin, E., Caspi, P., Maler, O.: A Kleene theorem for timed automata. In: LICS 1997, pp. 160-171. IEEE Computer Society Press, Los Alamitos (1997)
6. Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM 49(2), 172-206 (2002)
7. Asarin, E., Dima, C.: Balanced timed regular expressions. In: Vogler, W., Larsen, K.G. (eds.) MTCS. ENTCS, vol. 68, pp. 16-33. Elsevier, Amsterdam (2002)
8. Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147-161. Springer, Heidelberg (2001)
9. Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.): HSCC 2001. LNCS, vol. 2034. Springer, Heidelberg (2001)
10. Berstel, J., Reutenauer, C.: Rational Series and their Languages. Springer, New York, USA (1988)
11. Bouyer, P., Brihaye, T., Bruyère, V., Raskin, J.-F.: On the optimal reachability problem on weighted timed automata. Formal Methods in System Design 31(2), 135-175 (2007)
12. Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5), 188-194 (2006)
13. Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design (to appear, 2007)
14. Bouyer, P., Larsen, K.G., Markey, N.: Model-checking one-clock priced timed automata. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 108-122. Springer, Heidelberg (2007)
15. Bouyer, P., Petit, A.: Decomposition and composition of timed automata. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 210-219. Springer, Heidelberg (1999)
16. Bouyer, P., Petit, A.: A Kleene/Büchi-like theorem for clock languages. J. Autom. Lang. Comb. 7(2), 167-186 (2001)
17. Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 546-550. Springer, Heidelberg (1998)
18. Brihaye, T., Bruyère, V., Raskin, J.-F.: Model-checking weighted timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 277-292. Springer, Heidelberg (2004)
19. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci. 380(1-2), 69-86 (2007)
20. Fox, M., Long, D.: Modelling mixed discrete-continuous domains for planning. Journal of AI Research 27, 235-297 (2006)
21. Henzinger, T.: The theory of hybrid automata. In: LICS 1996, pp. 278-292. IEEE Computer Society Press, Los Alamitos (1996)
22. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HYTECH: A model checker for hybrid systems. International Journal on Software Tools for Technology Transfer 1(1-2), 110-122 (1997)
23. Kristoffersen, K., Larsen, K., Pettersson, P., Weise, C.: VHS Case Study 1 - Experimental Batch Plant using UPPAAL, BRICS, University of Aalborg, Denmark (May 1999)
24. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Berlin (1986)
25. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1(1-2), 134-152 (1997)
26. Larsen, K.G., Rasmussen, J.I.: Optimal conditional reachability for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 234-249. Springer, Heidelberg (2005)
27. Niebert, P., Yovine, S.: Computing optimal operation schemes for chemical plants in multi-batch mode. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, Springer, Heidelberg (2000)
28. Illum Rasmussen, J., Larsen, K.G., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 220-235. Springer, Heidelberg (2004)
29. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978)
30. Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4, 245-270 (1961)
31. Wilke, T.: Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, pp. 694-715. Springer, Heidelberg (1994)