{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:20:08Z","timestamp":1743128408211,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043673"},{"type":"electronic","value":"9783642043680"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04368-0_19","type":"book-chapter","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T03:31:59Z","timestamp":1251862319000},"page":"243-257","source":"Crossref","is-referenced-by-count":0,"title":["On the Supports of Recognizable Timed Series"],"prefix":"10.1007","author":[{"given":"Karin","family":"Quaas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-46002-0_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Abdedda\u00efm","year":"2002","unstructured":"Abdedda\u00efm, Y., Maler, O.: Preemptive job-shop scheduling using stopwatch automata. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 113\u2013126. Springer, Heidelberg (2002)"},{"issue":"2","key":"19_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":"19_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":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30080-9_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":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A.: Efficient guiding towards cost-optimality in Uppaal. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 174\u2013188. Springer, Heidelberg (2001)"},{"key":"19_CR6","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":"19_CR7","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Rational series and their languages. Current online version of the book of the same name from 1988 (February 2007)","DOI":"10.1007\/978-3-642-73235-5"},{"key":"19_CR8","series-title":"ENTCS","first-page":"3","volume-title":"MFPS 2006","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P.: Weighted timed automata: Model-checking and games. In: MFPS 2006. ENTCS, vol.\u00a0158, pp. 3\u201317. Elsevier Science Publishers, Amsterdam (2006)"},{"issue":"2","key":"19_CR9","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":"19_CR10","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."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10703-007-0043-4","volume":"32","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design\u00a032(1), 3\u201323 (2008)","journal-title":"Formal Methods in System Design"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-75454-1_6","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Markey, N.: Costs are expensive! In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 53\u201368. Springer, Heidelberg (2007)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11603009_5","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T. Brihaye","year":"2005","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On optimal timed strategies. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 49\u201364. Springer, Heidelberg (2005)"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.ic.2005.12.001","volume":"204","author":"T. Brihaye","year":"2006","unstructured":"Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On model-checking timed automata with stopwatch observers. Inf. Comput.\u00a0204(3), 408\u2013433 (2006)","journal-title":"Inf. Comput."},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-78499-9_11","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Droste","year":"2008","unstructured":"Droste, M., Quaas, K.: A Kleene-Sch\u00fctzenberger Theorem for Weighted Timed Automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 142\u2013156. Springer, Heidelberg (2008)"},{"key":"19_CR17","unstructured":"Fichtner, I.: Characterizations of Recognizable Picture Series. PhD thesis, Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Abteilung Automaten und Sprachen (2006)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-642-02737-6_26","volume-title":"DLT 2009","author":"D. Kirsten","year":"2009","unstructured":"Kirsten, D.: The support of a recognizable series over a zero-sum free, commutative semiring is recognizable. In: DLT 2009. LNCS, vol.\u00a05583, pp. 326\u2013333. Springer, Heidelberg (2009)"},{"issue":"2-3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2007.09.021","volume":"390","author":"K.G. Larsen","year":"2008","unstructured":"Larsen, K.G., Rasmussen, J.I.: Optimal reachability for multi-priced timed automata. Theor. Comput. Sci.\u00a0390(2-3), 197\u2013213 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR20","first-page":"54","volume-title":"LICS","author":"J. Ouaknine","year":"2004","unstructured":"Ouaknine, J., Worrell, J.: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In: LICS, pp. 54\u201363. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-642-02737-6_34","volume-title":"DLT 2009","author":"K. Quaas","year":"2009","unstructured":"Quaas, K.: Weighted Timed MSO Logics. In: DLT 2009. LNCS, vol.\u00a05583, pp. 419\u2013430. Springer, Heidelberg (2009)"},{"key":"19_CR22","volume-title":"Handbook of Weighted Automata","author":"G. Rahonis","year":"2009","unstructured":"Rahonis, G.: Fuzzy languages. In: Droste, Kuich, Vogler (eds.) Handbook of Weighted Automata. Springer, Heidelberg (to appear, 2009)"},{"key":"19_CR23","volume-title":"Handbook of Weighted Automata","author":"J. Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Rational and recognisable power series. In: Droste, Kuich, Vogler (eds.) Handbook of Weighted Automata. Springer, Heidelberg (To appear, 2009)"},{"key":"19_CR24","doi-asserted-by":"publisher","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":"19_CR25","unstructured":"Wilke, T.: Automaten und Logiken zur Beschreibung zeitabh\u00e4ngiger Systeme. PhD thesis, Christian-Albrecht-Universit\u00e4t Kiel (1994)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04368-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T05:56:16Z","timestamp":1558504576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04368-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043673","9783642043680"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04368-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}