{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:31:50Z","timestamp":1725521510341},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540938996"},{"type":"electronic","value":"9783540939009"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-93900-9_16","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T04:35:59Z","timestamp":1229315759000},"page":"167-181","source":"Crossref","is-referenced-by-count":0,"title":["Average-Price-per-Reward Games on Hybrid Automata with Strong Resets"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Rutkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R. Alur","year":"1995","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science\u00a0138, 3\u201334 (1995)","journal-title":"Theoretical Computer Science"},{"key":"16_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, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","first-page":"278","volume-title":"LICS 1996","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A.: The theory of hybrid automata. In: LICS 1996, pp. 278\u2013292. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"1","key":"16_CR4","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)","journal-title":"Mathematics of Control, Signals, and Systems"},{"key":"16_CR5","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":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-85778-5_6","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Brihaye, T., Jurdzi\u0144ski, M., Lazi\u0107, R., Rutkowski, M.: Average-price and reachability-price games on hybrid automata with strong resets. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 63\u201377. Springer, Heidelberg (2008)"},{"issue":"4","key":"16_CR7","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"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"2","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), 2\u201323 (2008)","journal-title":"Formal Methods in System Design"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Abdeddam, Y., Asarin, E., Maler, O.: Scheduling with timed automata. Theoretical Computer Science, 272\u2013300 (2006)","DOI":"10.1016\/j.tcs.2005.11.018"},{"key":"16_CR10","unstructured":"Church, A.: Logic, arithmetic and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23\u201335 (1962)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","first-page":"367","volume-title":"LICS 2006","author":"P. Bouyer","year":"2006","unstructured":"Bouyer, P., Brihaye, T., Chevalier, F.: Control in o-minimal hybrid systems. In: LICS 2006. LNCS, pp. 367\u2013378. Springer, Heidelberg (2006)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-72734-7_6","volume-title":"Logical Foundations of Computer Science","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Chevalier, F.: Weighted o-minimal hybrid systems are more decidable than weighted timed automata! In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 69\u201383. Springer, Heidelberg (2007)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1007\/978-3-540-73420-8_72","volume-title":"Automata, Languages and Programming","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Trivedi, A.: Reachability-time games on timed automata. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 838\u2013849. Springer, Heidelberg (2007)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"16_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/malq.200510024","volume":"52","author":"T. Brihaye","year":"2006","unstructured":"Brihaye, T.: A note on the undecidability of the reachability problem for o-minimal dynamical systems. Mathematical Logic Quarterly\u00a052, 165\u2013170 (2006)","journal-title":"Mathematical Logic Quarterly"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press (1951)","DOI":"10.1525\/9780520348097"},{"key":"16_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.36045\/bbms\/1105730626","volume":"4","author":"K. Meer","year":"1997","unstructured":"Meer, K., Michaux, C.: A survey on real structural complexity theory. Bulletin of the Belgian Mathematical Society\u00a04, 113\u2013148 (1997); Journ\u00e9es Montoises (Mons, 1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. American Mathematical Society. Bulletin. New Series\u00a021, 1\u201346 (1989)","journal-title":"American Mathematical Society. Bulletin. New Series"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93900-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T16:31:18Z","timestamp":1632760278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93900-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540938996","9783540939009"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-93900-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}