{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:27:24Z","timestamp":1777519644110,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642288906","type":"print"},{"value":"9783642288913","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28891-3_4","type":"book-chapter","created":{"date-parts":[[2012,3,30]],"date-time":"2012-03-30T12:53:01Z","timestamp":1333111981000},"page":"8-23","source":"Crossref","is-referenced-by-count":31,"title":["Quantitative Timed Analysis of Interactive Markov Chains"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Guck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin R.","family":"Neuh\u00e4u\u00dfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"524","volume":"29","author":"C. Baier","year":"2003","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE\u00a029, 524\u2013541 (2003)","journal-title":"IEEE TSE"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Mathematics of Operations Research\u00a016, 580\u2013595 (1991)","journal-title":"Mathematics of Operations Research"},{"key":"4_CR3","first-page":"274","volume":"35","author":"E. B\u00f6de","year":"2009","unstructured":"B\u00f6de, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Rakow, J., Wimmer, R., Becker, B.: Compositional dependability evaluation for STATEMATE. IEEE TSE\u00a035, 274\u2013292 (2009)","journal-title":"IEEE TSE"},{"key":"4_CR4","first-page":"128","volume":"7","author":"H. Boudali","year":"2009","unstructured":"Boudali, H., Crouzen, P., Stoelinga, M.: A rigorous, compositional, and extensible framework for dynamic fault tree analysis. IEEE TSDC\u00a07, 128\u2013143 (2009)","journal-title":"IEEE TSDC"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1093\/comjnl\/bxq024","volume":"54","author":"M. Bozzano","year":"2011","unstructured":"Bozzano, M., Cimatti, A., Katoen, J.-P., Nguyen, V., Noll, T., Roveri, M.: Safety, dependability and performance analysis of extended AADL models. The Computer Journal\u00a054, 754\u2013775 (2011)","journal-title":"The Computer Journal"},{"key":"4_CR6","unstructured":"Br\u00e1zdil, T., Forejt, V., Krc\u00e1l, J., Kret\u00ednsk\u00fd, J., Kucera, A.: Continuous-time stochastic games with time-bounded reachability. In: FSTTCS. LIPIcs, vol.\u00a04, pp. 61\u201372. Schloss Dagstuhl (2009)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-22110-1_19","volume-title":"Computer Aided Verification","author":"P. Buchholz","year":"2011","unstructured":"Buchholz, P., Hahn, E.M., Hermanns, H., Zhang, L.: Model Checking Algorithms for CTMDPs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 225\u2013242. Springer, Heidelberg (2011)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.cor.2010.08.011","volume":"38","author":"P. Buchholz","year":"2011","unstructured":"Buchholz, P., Schulz, I.: Numerical analysis of continuous time Markov decision processes over finite horizons. Computers & OR\u00a038, 651\u2013659 (2011)","journal-title":"Computers & OR"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, M.: Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: Symp. on Discrete Algorithms (SODA), pp. 1318\u20131336. SIAM (2011)","DOI":"10.1137\/1.9781611973082.101"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cloth, L., Haverkort, B.R.: Model checking for survivability. In: QEST, pp. 145\u2013154. IEEE Computer Society (2005)","DOI":"10.1109\/QEST.2005.21"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-16561-0_18","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"N. Coste","year":"2010","unstructured":"Coste, N., Garavel, H., Hermanns, H., Lang, F., Mateescu, R., Serwe, W.: Ten Years of Performance Evaluation for Concurrent Systems Using CADP. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part II. LNCS, vol.\u00a06416, pp. 128\u2013142. Springer, Heidelberg (2010)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-02658-4_18","volume-title":"Computer Aided Verification","author":"N. Coste","year":"2009","unstructured":"Coste, N., Hermanns, H., Lantreibecq, E., Serwe, W.: Towards Performance Prediction of Compositional Models in Industrial GALS Designs. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 204\u2013218. Springer, Heidelberg (2009)"},{"key":"4_CR13","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: LICS, pp. 454\u2013465. IEEE CS Press (1998)","DOI":"10.1109\/LICS.1998.705679"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-48320-9_7","volume-title":"CONCUR\u201999. Concurrency Theory","author":"L. Alfaro de","year":"1999","unstructured":"de Alfaro, L.: Computing Minimum and Maximum Reachability Times in Probabilistic Systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 66\u201381. Springer, Heidelberg (1999)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: LICS, pp. 342\u2013351. IEEE Computer Society (2010)","DOI":"10.1109\/LICS.2010.41"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Haverkort, B.R., Hermanns, H., Katoen, J.-P.: On the use of model checking techniques for dependability evaluation. In: SRDS, pp. 228\u2013237. IEEE CS (2000)","DOI":"10.1109\/RELDI.2000.885410"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Interactive Markov Chains","year":"2002","unstructured":"Hermanns, H. (ed.): Interactive Markov Chains. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-17071-3_16","volume-title":"Formal Methods for Components and Objects","author":"H. Hermanns","year":"2010","unstructured":"Hermanns, H., Katoen, J.-P.: The How and Why of Interactive Markov Chains. In: de Boer, F.S., Bonsangue, M.M., Hallerstede, S., Leuschel, M. (eds.) FMCO 2009. LNCS, vol.\u00a06286, pp. 311\u2013338. Springer, Heidelberg (2010)"},{"key":"4_CR20","unstructured":"Johr, S.: Model Checking Compositional Markov Systems. PhD thesis, Saarland University (2007)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0019-9958(69)90468-9","volume":"15","author":"R. Knast","year":"1969","unstructured":"Knast, R.: Continuous-time probabilistic automata. Information and Control\u00a015, 335\u2013352 (1969)","journal-title":"Information and Control"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-44804-7_4","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"G.G.I. L\u00f3pez","year":"2001","unstructured":"L\u00f3pez, G.G.I., Hermanns, H., Katoen, J.-P.: Beyond Memoryless Distributions: Model Checking Semi-Markov Chains. In: de Luca, L., Gilmore, S. (eds.) PAPM-PROBMIV 2001. LNCS, vol.\u00a02165, pp. 57\u201370. Springer, Heidelberg (2001)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Norris, J.: Markov Chains. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511810633"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-011-0140-0","volume":"48","author":"M.N. Rabe","year":"2011","unstructured":"Rabe, M.N., Schewe, S.: Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. Acta Inf.\u00a048, 291\u2013315 (2011)","journal-title":"Acta Inf."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"von Essen, C., Jobstmann, B.: Synthesizing systems with optimal average-case behavior for ratio objectives. In: iWIGP. EPTCS, vol.\u00a050, pp. 17\u201332 (2011)","DOI":"10.4204\/EPTCS.50.2"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Yushtein, Y., Bozzano, M., Cimatti, A., Katoen, J.-P., Nguyen, V.Y., Noll, T., Olive, X., Roveri, M.: System-software co-engineering: Dependability and safety perspective. In: SMC-IT, pp. 18\u201325. IEEE Computer Society (2011)","DOI":"10.1109\/SMC-IT.2011.16"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-12002-2_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Zhang","year":"2010","unstructured":"Zhang, L., Neuh\u00e4u\u00dfer, M.R.: Model Checking Interactive Markov Chains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 53\u201368. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28891-3_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T13:58:35Z","timestamp":1742824715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28891-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288906","9783642288913"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28891-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}