{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:04Z","timestamp":1725505564290},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_11","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"142-156","source":"Crossref","is-referenced-by-count":4,"title":["A Kleene-Sch\u00fctzenberger Theorem for Weighted Timed Automata"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Droste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karin","family":"Quaas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-540-27836-8_13","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2004","unstructured":"Alur, R., Bernadsky, M., Madhusudan, P.: Optimal reachability in weighted timed games. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 122\u2013133. Springer, Heidelberg (2004)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R. Alur","year":"2001","unstructured":"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.\u00a02034, pp. 49\u201362. Springer, Heidelberg (2001)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"key":"11_CR5","first-page":"160","volume-title":"LICS 1997","author":"E. Asarin","year":"1997","unstructured":"Asarin, E., Caspi, P., Maler, O.: A Kleene theorem for timed automata. In: LICS 1997, pp. 160\u2013171. IEEE Computer Society Press, Los Alamitos (1997)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM\u00a049(2), 172\u2013206 (2002)","journal-title":"Journal of the ACM"},{"key":"11_CR7","series-title":"ENTCS","first-page":"16","volume-title":"MTCS","author":"E. Asarin","year":"2002","unstructured":"Asarin, E., Dima, C.: Balanced timed regular expressions. In: Vogler, W., Larsen, K.G. (eds.) MTCS. ENTCS, vol.\u00a068, pp. 16\u201333. Elsevier, Amsterdam (2002)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G. Behrmann","year":"2001","unstructured":"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.\u00a02034, pp. 147\u2013161. Springer, Heidelberg (2001)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Hybrid Systems: Computation and Control","year":"2001","unstructured":"Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.): HSCC 2001. LNCS, vol.\u00a02034. Springer, Heidelberg (2001)"},{"key":"11_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and their Languages. Springer, New York, USA (1988)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10703-007-0035-4","volume":"31","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On the optimal reachability problem on weighted timed automata. Formal Methods in System Design\u00a031(2), 135\u2013175 (2007)","journal-title":"Formal Methods in System Design"},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ipl.2006.01.012","volume":"98","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Inf. Process. Lett.\u00a098(5), 188\u2013194 (2006)","journal-title":"Inf. Process. Lett."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design (to appear, 2007)","DOI":"10.1007\/s10703-007-0043-4"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-71389-0_9","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Larsen, K.G., Markey, N.: Model-checking one-clock priced timed automata. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 108\u2013122. Springer, Heidelberg (2007)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-48523-6_18","volume-title":"Automata, Languages and Programming","author":"P. Bouyer","year":"1999","unstructured":"Bouyer, P., Petit, A.: Decomposition and composition of timed automata. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 210\u2013219. Springer, Heidelberg (1999)"},{"issue":"2","key":"11_CR16","first-page":"167","volume":"7","author":"P. Bouyer","year":"2001","unstructured":"Bouyer, P., Petit, A.: A Kleene\/B\u00fcchi-like theorem for clock languages. J. Autom. Lang. Comb.\u00a07(2), 167\u2013186 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/BFb0028779","volume-title":"Computer Aided Verification","author":"M. Bozga","year":"1998","unstructured":"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.\u00a01427, pp. 546\u2013550. Springer, Heidelberg (1998)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-30206-3_20","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"T. Brihaye","year":"2004","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: Model-checking weighted timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 277\u2013292. Springer, Heidelberg (2004)"},{"issue":"1\u20132","key":"11_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M. Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theor. Comput. Sci.\u00a0380(1\u20132), 69\u201386 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR20","first-page":"235","volume":"27","author":"M. Fox","year":"2006","unstructured":"Fox, M., Long, D.: Modelling mixed discrete-continuous domains for planning. Journal of AI Research\u00a027, 235\u2013297 (2006)","journal-title":"Journal of AI Research"},{"key":"11_CR21","first-page":"278","volume-title":"LICS 1996","author":"T. Henzinger","year":"1996","unstructured":"Henzinger, T.: The theory of hybrid automata. In: LICS 1996, pp. 278\u2013292. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"1\u20132","key":"11_CR22","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/s100090050008","volume":"1","author":"T.A. Henzinger","year":"1997","unstructured":"Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HYTECH: A model checker for hybrid systems. International Journal on Software Tools for Technology Transfer\u00a01(1\u20132), 110\u2013122 (1997)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"11_CR23","unstructured":"Kristoffersen, K., Larsen, K., Pettersson, P., Weise, C.: VHS Case Study 1 - Experimental Batch Plant using UPPAAL, BRICS, University of Aalborg, Denmark (May 1999)"},{"key":"11_CR24","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Berlin (1986)"},{"issue":"1-2","key":"11_CR25","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"K.G. Larsen","year":"1997","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer\u00a01(1-2), 134\u2013152 (1997)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-31982-5_15","volume-title":"Foundations of Software Science and Computational Structures","author":"K.G. Larsen","year":"2005","unstructured":"Larsen, K.G., Rasmussen, J.I.: Optimal conditional reachability for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 234\u2013249. Springer, Heidelberg (2005)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46430-1_29","volume-title":"Hybrid Systems: Computation and Control","author":"P. Niebert","year":"2000","unstructured":"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.\u00a01790, Springer, Heidelberg (2000)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-24730-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Illum Rasmussen","year":"2004","unstructured":"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.\u00a02988, pp. 220\u2013235. Springer, Heidelberg (2004)"},{"key":"11_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978)"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04, 245\u2013270 (1961)","journal-title":"Information and Control"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T. Wilke","year":"1994","unstructured":"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.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:27Z","timestamp":1619521887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_11","relation":{},"subject":[]}}