{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:24Z","timestamp":1725487224409},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727323"},{"type":"electronic","value":"9783540727347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72734-7_6","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T09:40:50Z","timestamp":1183023650000},"page":"69-83","source":"Crossref","is-referenced-by-count":7,"title":["Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Brihaye","sequence":"additional","affiliation":[]},{"given":"Fabrice","family":"Chevalier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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 for 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":"6_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.: A theory of timed automata. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1109\/5.871304","volume":"88","author":"R. Alur","year":"2000","unstructured":"Alur, R., Henzinger, T.A., Lafferriere, G., Pappas, G.J.: Discrete abstractions of hybrid systems. Proc. of the IEEE\u00a088, 971\u2013984 (2000)","journal-title":"Proc. of the IEEE"},{"key":"6_CR4","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":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.-F.: On the optimal reachability problem. Submitted (2006)","DOI":"10.1007\/s10703-007-0035-4"},{"key":"6_CR6","first-page":"367","volume-title":"LICS\u201906: Logic in Computer Science","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Brihaye, T., Chevalier, F.: Control in o-minimal hybrid systems. In: LICS\u201906: Logic in Computer Science, pp. 367\u2013378. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"6_CR7","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":"Hybrid Systems: Computation and Control","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 203\u2013218. Springer, Heidelberg (2004)"},{"issue":"5","key":"6_CR8","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. Information Processing Letters\u00a098(5), 188\u2013194 (2006)","journal-title":"Information Processing Letters"},{"key":"6_CR9","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 for weighted timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 277\u2013292. Springer, Heidelberg (2004)"},{"key":"6_CR10","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":"6_CR11","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. Information and Computation\u00a0204(3), 408\u2013433 (2006)","journal-title":"Information and Computation"},{"key":"6_CR12","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":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2004","unstructured":"Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 148\u2013160. Springer, Heidelberg (2004)"},{"key":"6_CR13","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.G., 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":"6_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":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11944836_32","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Larsen, K.G., Markey, N., Rasmussen, J.I.: Almost optimal strategies in one clock priced timed games. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 345\u2013356. Springer, Heidelberg (2006)"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.jco.2004.09.003","volume":"21","author":"T. Brihaye","year":"2005","unstructured":"Brihaye, T., Michaux, C.: On the expressiveness and decidability of o-minimal hybrid systems. Journal of Complexity\u00a021(4), 447\u2013478 (2005)","journal-title":"Journal of Complexity"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-24743-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"T. Brihaye","year":"2004","unstructured":"Brihaye, T., Michaux, C., Rivi\u00e8re, C., Troestler, C.: On O-Minimal Hybrid Systems. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol.\u00a02993, pp. 219\u2013233. Springer, Heidelberg (2004)"},{"key":"6_CR18","unstructured":"Brihaye, T.: Verification and Control of O-Minimal Hybrid Systems and Weighted Timed Automata. Th\u00e8se de doctorat, Universit\u00e9 Mons-Hainaut, Belgium (2006)"},{"key":"6_CR19","unstructured":"Brihaye, T.: Words and bisimulation of dynamical systems. Journal of Automata, Languages and Combinatorics, To appear (2006)"},{"key":"6_CR20","unstructured":"Uppaal Cora (2006), http:\/\/www.cs.aau.dk\/~behrmann\/cora\/"},{"issue":"4-5","key":"6_CR21","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1051\/ita:1999123","volume":"33","author":"J.M. Davoren","year":"1999","unstructured":"Davoren, J.M.: Topologies, continuity and bisimulations. Theoretical Informatics and Applications\u00a033(4-5), 357\u2013382 (1999)","journal-title":"Theoretical Informatics and Applications"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11603009_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"R. Gentilini","year":"2005","unstructured":"Gentilini, R.: Reachability problems on extended o-minimal hybrid automata. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 162\u2013176. Springer, Heidelberg (2005)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-60084-1_85","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1995","unstructured":"Henzinger, T.A.: Hybrid automata with finite bisimulations. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 324\u2013335. Springer, Heidelberg (1995)"},{"key":"6_CR24","first-page":"278","volume-title":"LICS\u201996: Logic in Computer Science","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: LICS\u201996: Logic in Computer Science, pp. 278\u2013292. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1042038.1042039","volume":"6","author":"T.A. Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Raskin, J.-F.: A classification of symbolic transition systems. ACM Transactions on Computational Logic\u00a06(1), 1\u201332 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR26","volume-title":"A Shorter Model Theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A Shorter Model Theory. Cambridge University Press, Cambridge (1997)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11780342_28","volume-title":"Logical Approaches to Computational Barriers","author":"M.V. Korovina","year":"2006","unstructured":"Korovina, M.V., Vorobjov, N.: Upper and lower bounds on sizes of finite bisimulations of pfaffian hybrid systems. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 267\u2013276. Springer, Heidelberg (2006)"},{"key":"6_CR28","series-title":"IFIP Conf. Proc.","first-page":"485","volume-title":"TCS\u201902: Theoretical Computer Science","author":"S. Torre La","year":"2002","unstructured":"La Torre, S., Mukhopadhyay, S., Murano, A.: Optimal-reachability and control for acyclic weighted timed automata. In: TCS\u201902: Theoretical Computer Science. IFIP Conf. Proc., vol.\u00a0223, pp. 485\u2013497. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009858","volume":"13","author":"G. Lafferriere","year":"2000","unstructured":"Lafferriere, G., Pappas, G.J., Sastry, S.: O-minimal hybrid systems. Mathematics of Control, Signals, and Systems\u00a013(1), 1\u201321 (2000), Appeared as a preprint in 1998","journal-title":"Mathematics of Control, Signals, and Systems"},{"issue":"2","key":"6_CR30","doi-asserted-by":"publisher","first-page":"565","DOI":"10.2307\/2000052","volume":"295","author":"A. Pillay","year":"1986","unstructured":"Pillay, A., Steinhorn, C.: Definable sets in ordered structures. Transactions of the American Mathematical Society\u00a0295(2), 565\u2013592 (1986)","journal-title":"Transactions of the American Mathematical Society"},{"key":"6_CR31","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real-Time. Th\u00e8se de doctorat, Universit\u00e9 Namur, Belgium (1999)"},{"key":"6_CR32","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511525919","volume-title":"Tame Topology and O-Minimal Structures","author":"L. Dries van den","year":"1998","unstructured":"van den Dries, L.: Tame Topology and O-Minimal Structures. London Mathematical Society Lecture Note Series, vol.\u00a0248. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"6_CR33","first-page":"1051","volume":"9","author":"A.J. Wilkie","year":"1996","unstructured":"Wilkie, A.J.: Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function. Journal of the AMS\u00a09(4), 1051\u20131094 (1996)","journal-title":"Journal of the AMS"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72734-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T18:30:22Z","timestamp":1683916222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72734-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727323","9783540727347"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72734-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}