{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:50:32Z","timestamp":1757454632117,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"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-02930-1_9","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"103-114","source":"Crossref","is-referenced-by-count":15,"title":["Reachability in Stochastic Timed Games"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"Forejt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","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":"9_CR2","first-page":"469","volume-title":"Proc. IFAC Symposium on System Structure and Control","author":"E. Asarin","year":"1998","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: Proc. IFAC Symposium on System Structure and Control, pp. 469\u2013474. Elsevier, Amsterdam (1998)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/LICS.2008.25","volume-title":"Proc. 23rd Annual Symposium on Logic in Computer Science (LICS 2008)","author":"C. Baier","year":"2008","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Gr\u00f6\u00dfer, M.: Almost-sure model checking of infinite paths in one-clock timed automata. In: Proc. 23rd Annual Symposium on Logic in Computer Science (LICS 2008), pp. 217\u2013226. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77050-3_15","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"C. Baier","year":"2007","unstructured":"Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Gr\u00f6\u00dfer, M.: Probabilistic and topological semantics for timed automata. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 179\u2013191. Springer, Heidelberg (2007)"},{"issue":"7","key":"9_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C. Baier","year":"2003","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering\u00a029(7), 524\u2013541 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR6","volume-title":"Proc. 5th International Conference on Quantitative Evaluation of Systems (QEST 2008)","author":"N. Bertrand","year":"2008","unstructured":"Bertrand, N., Bouyer, P., Brihaye, T., Markey, N.: Quantitative model-checking of one-clock timed automata under probabilistic semantics. In: Proc. 5th International Conference on Quantitative Evaluation of Systems (QEST 2008). IEEE Computer Society Press, Los Alamitos (2008)"},{"issue":"5","key":"9_CR7","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":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-45220-1_11","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2003","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 100\u2013113. Springer, Heidelberg (2003)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. Formal Methods in System Design (to appear) (2008)","DOI":"10.1007\/s10703-008-0056-7"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S1567-8326(02)00068-1","volume":"56","author":"J. Desharnais","year":"2003","unstructured":"Desharnais, J., Panangaden, P.: Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. Journal of Logic and Algebraic Programming\u00a056, 99\u2013115 (2003)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"9_CR11","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley, Chichester (1968)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BFb0014736","volume-title":"Hybrid and Real-Time Systems","author":"V. Gupta","year":"1997","unstructured":"Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust timed automata. In: Maler, O. (ed.) HART 1997, vol.\u00a01201, pp. 331\u2013345. Springer, Heidelberg (1997)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s100090100072","volume":"4","author":"H. Hermanns","year":"2003","unstructured":"Hermanns, H., Katoen, J.-P., Meyer-Kayser, J., Siegle, M.: A tool for model-checking Markov chains. International Journal on Software Tools for Technology Transfer\u00a04, 153\u2013172 (2003)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-28644-8_25","volume-title":"CONCUR 2004 - Concurrency Theory","author":"F. Laroussinie","year":"2004","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Model checking timed automata with one or two clocks. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004, vol.\u00a03170, pp. 387\u2013401. Springer, Heidelberg (2004)"},{"key":"9_CR15","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall International, Englewood Cliffs (1967)"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0216001","volume":"16","author":"C.H. Papadimitriou","year":"1987","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: On stochastic scheduling with in-tree precedence constraints. SIAM Journal on Computing\u00a016(1), 1\u20136 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0055349","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"A. Puri","year":"1998","unstructured":"Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol.\u00a01486, pp. 210\u2013227. Springer, Heidelberg (1998)"},{"key":"9_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M. Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994)"},{"key":"9_CR19","volume-title":"Real and Complex Analysis","author":"W. Rudin","year":"1966","unstructured":"Rudin, W.: Real and Complex Analysis. McGraw-Hill, New York (1966)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T17:59:19Z","timestamp":1539021559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}