{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T01:44:32Z","timestamp":1770342272495,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T00:00:00Z","timestamp":1176249600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2007,8,30]]},"DOI":"10.1007\/s10703-007-0035-4","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T14:50:27Z","timestamp":1176907827000},"page":"135-175","source":"Crossref","is-referenced-by-count":46,"title":["On the\u00a0optimal reachability problem of weighted timed automata"],"prefix":"10.1007","volume":"31","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Brihaye","sequence":"additional","affiliation":[]},{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,11]]},"reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126(2):183\u2013235","journal-title":"Theor Comput Sci"},{"issue":"1","key":"35_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur R, Courcoubetis C, Dill DL (1993) Model-checking in dense real-time. Inf Comput 104(1):2\u201334","journal-title":"Inf Comput"},{"key":"35_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-56922-7_16","volume-title":"CAV\u201993: computer aided verification","author":"R Alur","year":"1993","unstructured":"Alur R, Courcoubetis C, Henzinger TA (1993) Computing accumulated delays in real-time systems. In: CAV\u201993: computer aided verification. Lecture notes in computer science, vol 697. Springer, Berlin, pp\u00a0181\u2013193"},{"key":"35_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"HSCC\u201901: hybrid systems: computation and control","author":"R Alur","year":"2001","unstructured":"Alur R, La Torre S, Pappas GJ (2001) Optimal paths in weighted timed automata. In: HSCC\u201901: hybrid systems: computation and control. Lecture notes in computer science, vol\u00a02034. Springer, Berlin, pp\u00a049\u201362"},{"key":"35_CR5","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":"ICALP\u201904: automata, languages, and programming","author":"R Alur","year":"2004","unstructured":"Alur R, Bernadsky M, Madhusudan P (2004) Optimal reachability for weighted timed games. In: ICALP\u201904: automata, languages, and programming. Lecture notes in computer science, vol\u00a03142. Springer, Berlin, pp\u00a0122\u2013133"},{"key":"35_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"HSCC\u201999: hybrid systems: computation and control","author":"E Asarin","year":"1999","unstructured":"Asarin E, Maler O (1999) As soon as possible: time optimal control for timed automata. In: HSCC\u201999: hybrid systems: computation and control. Lecture notes in computer science, vol 1569. Springer, Berlin, pp 19\u201330"},{"key":"35_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"HSCC\u201901: hybrid systems: computation and control","author":"G Behrmann","year":"2001","unstructured":"Behrmann G, Fehnker A, Hune T, Larsen KG, Pettersson P, Romijn J, Vaandrager FW (2001) Minimum-cost reachability for priced timed automata. In: HSCC\u201901: hybrid systems: computation and control. Lecture notes in computer science, vol 2034. Springer, Berlin, pp 147\u2013161"},{"issue":"2\u20133","key":"35_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1998-36233","volume":"36","author":"B B\u00e9rard","year":"1998","unstructured":"B\u00e9rard B, Diekert V, Gastin P, Petit A (1998) Characterization of the\u00a0expressive power of silent transitions in timed automata. Fundam Inf 36(2\u20133):145\u2013182","journal-title":"Fundam Inf"},{"key":"35_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-540-24743-2_14","volume-title":"HSSC\u201904: hybrid systems: computation and control","author":"P Bouyer","year":"2004","unstructured":"Bouyer P, Brinksma E, Larsen KG (2004) Staying alive as cheaply as possible. In: HSSC\u201904: hybrid systems: computation and control. Lecture notes in computer science, vol 2993. Springer, Berlin, pp 203\u2013218"},{"key":"35_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-30538-5_13","volume-title":"FST&TCS\u201904: foundations of software technology and theoretical computer science","author":"P Bouyer","year":"2004","unstructured":"Bouyer P, Cassez F, Fleury E, Larsen KG (2004) Optimal strategies in priced timed game automata. In: FST&TCS\u201904: foundations of software technology and theoretical computer science. Lecture notes in computer science, vol 3328. Springer, Berlin, pp 148\u2013160"},{"key":"35_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/11603009_5","volume-title":"FORMATS\u201905: formal modelling and analysis of timed systems","author":"T Brihaye","year":"2005","unstructured":"Brihaye T, Bruy\u00e8re V, Raskin J-F (2005) On optimal timed strategies. In: FORMATS\u201905: formal modelling and analysis of timed systems. Lecture notes in computer science, vol 3829. Springer, Berlin, pp 49\u201364"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Henzinger TA (1996) The theory of hybrid automata. In: LICS\u201996: logic in computer science. IEEE Computer Society Press, pp 278\u2013292","DOI":"10.1109\/LICS.1996.561342"},{"key":"35_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-60630-0_3","volume-title":"TACAS\u201995: tools and algorithms for the\u00a0construction and analysis of systems","author":"TA Henzinger","year":"1995","unstructured":"Henzinger TA, Ho P-H, Wong-Toi H (1995) A user guide to HyTech. In: TACAS\u201995: tools and algorithms for the\u00a0construction and analysis of systems. Lecture notes in computer science, vol 1019. Springer, Berlin, pp 41\u201371"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Henzinger TA, Kopke PW, Puri A, Varaiya P (1995) What\u2019s decidable about hybrid automata? In: Proceedings of the\u00a027th annual symposium on theory of computing. ACM Press, pp 373\u2013382","DOI":"10.1145\/225058.225162"},{"issue":"2","key":"35_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1006\/inco.1998.2774","volume":"150","author":"Y Kesten","year":"1999","unstructured":"Kesten Y, Pnueli A, Sifakis J, Yovine S (1999) Decidable integration graphs. Inf Comput 150(2):209\u2013243","journal-title":"Inf Comput"},{"key":"35_CR16","series-title":"IFIP conference proceedings","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/978-0-387-35608-2_40","volume-title":"IFIP TCS\u201902: foundations of information technology in the\u00a0era of networking and mobile computing","author":"S La Torre","year":"2002","unstructured":"La Torre S, Mukhopadhyay S, Murano A (2002) Optimal-reachability and control for acyclic weighted timed automata. In: IFIP TCS\u201902: foundations of information technology in the\u00a0era of networking and mobile computing. IFIP conference proceedings, vol 223. Kluwer, Dordrecht, pp 485\u2013497"},{"issue":"1\u20132","key":"35_CR17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/s100090050010","volume":"1","author":"KG Larsen","year":"1997","unstructured":"Larsen KG, Pettersson P, Yi W (1997) Uppaal in a\u00a0nutshell. Int J Softw Tools Technol Transf 1(1\u20132):134\u2013152","journal-title":"Int J Softw Tools Technol Transf"},{"key":"35_CR18","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":"FoSSaCS\u201905: foundations of software science and computational structures","author":"KG Larsen","year":"2005","unstructured":"Larsen KG, Rasmussen JI (2005) Optimal conditional reachability for multi-priced timed automata. In: FoSSaCS\u201905: foundations of software science and computational structures. Lecture notes in computer science, vol 3441. Springer, Berlin, pp 234\u2013249"},{"key":"35_CR19","series-title":"Wiley-interscience series in discrete mathematics and optimization","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley-interscience series in discrete mathematics and optimization. Wiley, New York"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/0-8176-4404-0_21","volume-title":"Handbook of networked and embedded control systems","author":"J-F Raskin","year":"2005","unstructured":"Raskin J-F (2005) An introduction to hybrid automata. In: Handbook of networked and embedded control systems. Birkh\u00e4user, Basel, pp 491\u2013518"},{"key":"35_CR21","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton Univ. Press, New Jersey"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-007-0035-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-007-0035-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-007-0035-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T12:32:22Z","timestamp":1587472342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-007-0035-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,8,30]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1007\/s10703-007-0035-4","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,11]]}}}