{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:21:22Z","timestamp":1732036882980},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670881"},{"type":"electronic","value":"9783319670898"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67089-8_11","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T12:47:26Z","timestamp":1503578846000},"page":"144-159","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic Timed Automata with Clock-Dependent Probabilities"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Sproston","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"crossref","first-page":"624","DOI":"10.3166\/ejc.16.624-641","volume":"16","author":"A Abate","year":"2010","unstructured":"Abate, A., Katoen, J., Lygeros, J., Prandini, M.: Approximate model checking of stochastic hybrid systems. Eur. J. Control 16(6), 624\u2013641 (2010)","journal-title":"Eur. J. Control"},{"key":"11_CR2","unstructured":"Akshay, S., Bouyer, P., Krishna, S.N., Manasa, L., Trivedi, A.: Stochastic timed games revisited. In: Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). LIPIcs, vol. 58, pp. 8:1\u20138:14. Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"11_CR3","unstructured":"Akshay, S., Bouyer, P., Krishna, S.N., Manasa, L., Trivedi, A.: Stochastic timed games revisited. CoRR, abs\/1607.05671 (2016)"},{"issue":"2","key":"11_CR4","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, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-24310-3_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"N Basset","year":"2011","unstructured":"Basset, N., Asarin, E.: Thin and thick timed regular languages. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol. 6919, pp. 113\u2013128. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24310-3_9"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-662-54458-7_19","volume-title":"Foundations of Software Science and Computation Structures","author":"G Bian","year":"2017","unstructured":"Bian, G., Abate, A.: On the relationship between bisimulation and trace equivalence in an approximate probabilistic context. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 321\u2013337. Springer, Heidelberg (2017). doi: 10.1007\/978-3-662-54458-7_19"},{"key":"11_CR7","unstructured":"Bouyer, P.: On the optimal reachability problem in weighted timed automata and games. In: Proceedings of the 7th Workshop on Non-Classical Models of Automata and Applications (NCMA 2015). books@ocg.at, vol. 318, pp. 11\u201336. Austrian Computer Society (2015)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","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 Syst. Des. 32(1), 2\u201323 (2008)","journal-title":"Formal Methods Syst. Des."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"D\u2019Innocenzo, A., Abate, A., Katoen, J.: Robust PCTL model checking. In: Proceedings of the 15th ACM International Conference on Hybrid Systems: Computation and Control (HSCC 2012), pp. 275\u2013286. ACM (2012)","DOI":"10.1145\/2185632.2185673"},{"key":"11_CR10","unstructured":"Gregersen, H., Jensen, H.E.: Formal design of reliable real time systems. Master\u2019s thesis, Department of Mathematics and Computer Science, Aalborg University (1995)"},{"key":"11_CR11","unstructured":"Hahn, E.M.: Model checking stochastic hybrid systems. Ph.D. thesis, Universit\u00e4t des Saarlandes (2013)"},{"issue":"3","key":"11_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-4(3:12)2008","volume":"4","author":"M Jurdzi\u0144ski","year":"2008","unstructured":"Jurdzi\u0144ski, M., Laroussinie, F., Sproston, J.: Model checking probabilistic timed automata with one or two clocks. Log. Methods Comput. Sci. 4(3), 1\u201328 (2008)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"11_CR13","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/s10703-010-0097-6","volume":"36","author":"M Kattenbelt","year":"2010","unstructured":"Kattenbelt, M., Kwiatkowska, M., Norman, G., Parker, D.: A game-based abstraction-refinement framework for Markov decision processes. Formal Methods Syst. Des. 36(3), 246\u2013280 (2010)","journal-title":"Formal Methods Syst. Des."},{"key":"11_CR14","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9455-6","volume-title":"Denumerable Markov Chains","author":"JG Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. Graduate Texts in Mathematics, 2nd edn. Springer, New York (1976)","edition":"2"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22110-1_47"},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10703-006-0005-2","volume":"29","author":"M Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. Formal Methods Syst. Des. 29, 33\u201378 (2006)","journal-title":"Formal Methods Syst. Des."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0304-3975(01)00046-9","volume":"286","author":"M Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoret. Comput. Sci. 286, 101\u2013150 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR18","volume-title":"Computation: Finite and Infinite Machines","author":"M Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall International, Upper Saddle River (1967)"},{"issue":"2","key":"11_CR19","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/s10703-012-0177-x","volume":"43","author":"G Norman","year":"2013","unstructured":"Norman, G., Parker, D., Sproston, J.: Model checking for probabilistic timed automata. Formal Methods Syst. Des. 43(2), 164\u2013190 (2013)","journal-title":"Formal Methods Syst. Des."},{"key":"11_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes. Wiley, Hoboken (1994)"},{"key":"11_CR21","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Massachusetts Institute of Technology (1995)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Sproston, J.: Probabilistic timed automata with clock-dependent probabilities. CoRR (2017)","DOI":"10.1007\/978-3-319-67089-8_11"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67089-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T19:21:10Z","timestamp":1570044070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67089-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670881","9783319670898"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67089-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}