{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T09:25:38Z","timestamp":1750843538746,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319991535"},{"type":"electronic","value":"9783319991542"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99154-2_24","type":"book-chapter","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T14:14:35Z","timestamp":1534256075000},"page":"389-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach"],"prefix":"10.1007","author":[{"given":"Mahmoud","family":"Salamati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadegh","family":"Soudjani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/343369.343402","volume":"1","author":"A Aziz","year":"2000","unstructured":"Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous-time Markov chains. ACM Trans. Comput. Logic 1(1), 162\u2013170 (2000)","journal-title":"ACM Trans. Comput. Logic"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-662-46678-0_12","volume-title":"Foundations of Software Science and Computation Structures","author":"G Bacci","year":"2015","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On the total variation distance of semi-Markov chains. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 185\u2013199. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46678-0_12"},{"issue":"6","key":"24_CR3","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 Trans. Softw. Eng. 29(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S., Ghaoui, L.E., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory. In: SIAM, vol. 15 (1994)","DOI":"10.1137\/1.9781611970777"},{"key":"24_CR5","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. 6806, pp. 225\u2013242. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22110-1_19"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), 323\u2013354 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR7","volume-title":"Feedback Control Theory","author":"J Doyle","year":"1990","unstructured":"Doyle, J., Francis, B., Tannenbaum, A.: Feedback Control Theory. Macmillan Publishing Co., New York (1990)"},{"key":"24_CR8","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. Wiley, Hoboken (1968)"},{"issue":"8","key":"24_CR9","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1016\/j.automatica.2007.01.019","volume":"43","author":"A Girard","year":"2007","unstructured":"Girard, A., Pappas, G.J.: Approximate bisimulation relations for constrained linear systems. Automatica 43(8), 1307\u20131317 (2007)","journal-title":"Automatica"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TAC.2009.2034922","volume":"55","author":"A Girard","year":"2010","unstructured":"Girard, A., Pola, G., Tabuada, P.: Approximately bisimilar symbolic models for incrementally stable switched systems. IEEE Trans. Autom. Control 55(1), 116\u2013126 (2010)","journal-title":"IEEE Trans. Autom. Control"},{"key":"24_CR11","doi-asserted-by":"publisher","unstructured":"Grant, M.C., Boyd, S.P.: Graph implementations for nonsmooth convex programs. In: Blondel, V.D., Boyd, S.P., Kimura, H. (eds.) Recent Advances in Learning and Control. Lecture Notes in Control and Information Sciences, vol 371. Springer, London (2008). \nhttps:\/\/doi.org\/10.1007\/978-1-84800-155-8_7","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"24_CR12","unstructured":"Hermanns, H.: Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In: Numerical Solution of Markov Chains (NSMC 1999), pp. 188\u2013207 (1999)"},{"key":"24_CR13","volume-title":"Nonlinear Systems","author":"HK Khalil","year":"1996","unstructured":"Khalil, H.K.: Nonlinear Systems. Prentice Hall, Upper Saddle River (1996)"},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Lofberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: IEEE International Conference on Robotics and Automation. IEEE (2004)","DOI":"10.1109\/CACSD.2004.1393890"},{"issue":"5\u20136","key":"24_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-011-0140-0","volume":"48","author":"MN Rabe","year":"2011","unstructured":"Rabe, M.N., Schewe, S.: Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. Acta Informatica 48(5\u20136), 291\u2013315 (2011)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99154-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T14:31:06Z","timestamp":1534257066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99154-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319991535","9783319991542"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99154-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}