{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:52Z","timestamp":1759639072539,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243097"},{"type":"electronic","value":"9783642243103"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24310-3_4","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T04:14:55Z","timestamp":1316837695000},"page":"26-42","source":"Crossref","is-referenced-by-count":18,"title":["Time-Bounded Verification of CTMCs against Real-Time Specifications"],"prefix":"10.1007","author":[{"given":"Taolue","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Diciolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Kwiatkowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Mereacre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"4_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. Theor. Comput. Sci.\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R. Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A Really Temporal Logic. J. ACM\u00a041(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. In: LICS, pp. 390\u2013401 (1990)","DOI":"10.21236\/ADA323441"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: IEEE Real-Time Systems Symposium, pp. 254\u2013263 (1998)","DOI":"10.1109\/REAL.1998.739751"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/TSE.2007.36","volume":"33","author":"C. Baier","year":"2007","unstructured":"Baier, C., Cloth, L., Haverkort, B.R., Kuntz, M., Siegle, M.: Model checking Markov chains with actions and state labels. IEEE Trans. Software Eng.\u00a033(4), 209\u2013224 (2007)","journal-title":"IEEE Trans. Software Eng."},{"issue":"6","key":"4_CR7","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.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Software Eng.\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Software Eng."},{"issue":"9","key":"4_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1810891.1810912","volume":"53","author":"C. Baier","year":"2010","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Performance evaluation and model checking join forces. Commun. ACM\u00a053(9), 76\u201385 (2010)","journal-title":"Commun. ACM"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2005.07.022","volume":"345","author":"C. Baier","year":"2005","unstructured":"Baier, C., Hermanns, H., Katoen, J.-P., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comput. Sci.\u00a0345(1), 2\u201326 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ic.2009.10.004","volume":"208","author":"P. Bouyer","year":"2010","unstructured":"Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL. Inf. Comput.\u00a0208(2), 97\u2013116 (2010)","journal-title":"Inf. Comput."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-19835-9_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Barbot","year":"2011","unstructured":"Barbot, B., Chen, T., Han, T., Katoen, J.-P., Mereacre, A.: Efficient CTMC model checking of linear real-time objectives. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol.\u00a06605, pp. 128\u2013142. Springer, Heidelberg (2011)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-7721(01)00004-9","volume":"18","author":"A. Bemporad","year":"2001","unstructured":"Bemporad, A., Fukuda, K., Torrisi, F.D.: Convexity recognition of the union of polyhedra. Comput. Geom.\u00a018(3), 141\u2013154 (2001)","journal-title":"Comput. Geom."},{"key":"4_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and real computation","author":"L. Blum","year":"1998","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer, Heidelberg (1998)"},{"key":"4_CR14","unstructured":"Bouyer, P.: From Qualitative to Quantitative Analysis of Timed Systems. M\u00e9moire d\u2019habilitation, Universit\u00e9 Paris 7, Paris, France (January 2009)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Chen, T., Diciolla, M., Kwiatkowska, M., Mereacre, A.: Time-bounded verification of CTMCs against real-time specifications. Tech. Rep. RR-11-06, Department of Computer Science, University of Oxford (2011)","DOI":"10.1007\/978-3-642-24310-3_4"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Chen, T., Han, T., Katoen, J.-P., Mereacre, A.: Quantitative model checking of continuous-time Markov chains against timed automata specifications. In: LICS, pp. 309\u2013318 (2009)","DOI":"10.1109\/LICS.2009.21"},{"issue":"1\u20132","key":"4_CR17","first-page":"1","volume":"7","author":"T. Chen","year":"2011","unstructured":"Chen, T., Han, T., Katoen, J.-P., Mereacre, A.: Model checking of continuous-time Markov chains against timed automata specifications. Logical Methods in Computer Science\u00a07(1\u20132), 1\u201334 (2011)","journal-title":"Logical Methods in Computer Science"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TSE.2008.108","volume":"35","author":"S. Donatelli","year":"2009","unstructured":"Donatelli, S., Haddad, S., Sproston, J.: Model checking timed and stochastic properties with CSL $^{\\textrm{\\uppercase{ta}}}$ . IEEE Trans. Software Eng.\u00a035(2), 224\u2013240 (2009)","journal-title":"IEEE Trans. Software Eng."},{"issue":"1","key":"4_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.3233\/FI-2009-145","volume":"95","author":"E.M. Hahn","year":"2009","unstructured":"Hahn, E.M., Hermanns, H., Wachter, B., Zhang, L.: Time-bounded model checking of infinite-state continuous-time Markov chains. Fundam. Inform.\u00a095(1), 129\u2013155 (2009)","journal-title":"Fundam. Inform."},{"key":"4_CR21","volume-title":"Convex Analysis and Minimization Algorithms I.: Fundamentals","author":"J. Hiriart-Urruty","year":"1994","unstructured":"Hiriart-Urruty, J., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I.: Fundamentals. Springer, Heidelberg (1994)"},{"key":"4_CR22","first-page":"60","volume-title":"LICS","author":"M. Jenkins","year":"2010","unstructured":"Jenkins, M., Ouaknine, J., Rabinovich, A., Worrell, J.: Alternating timed automata over bounded time. In: LICS, pp. 60\u201369. IEEE Computer Society, Los Alamitos (2010)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Katoen, J.-P., Zapreev, I.S.: Safe on-the-fly steady-state detection for time-bounded reachability. In: QEST, pp. 301\u2013310 (2006)","DOI":"10.1109\/QEST.2006.47"},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1145\/504794.504796","volume":"48","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre, J.B., Zeron, E.S.: A Laplace transform algorithm for the volume of a convex polytope. J. ACM\u00a048(6), 1126\u20131140 (2001)","journal-title":"J. ACM"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-15297-9_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"D. Nickovic","year":"2010","unstructured":"Nickovic, D., Piterman, N.: From MTL to deterministic timed automata. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol.\u00a06246, pp. 152\u2013167. Springer, Heidelberg (2010)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-04081-8_33","volume-title":"CONCUR 2009 - Concurrency Theory","author":"J. Ouaknine","year":"2009","unstructured":"Ouaknine, J., Rabinovich, A., Worrell, J.: Time-bounded verification. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 496\u2013510. Springer, Heidelberg (2009)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science\u00a03(1) (2007)","DOI":"10.2168\/LMCS-3(1:8)2007"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-14162-1_3","volume-title":"Automata, Languages and Programming","author":"J. Ouaknine","year":"2010","unstructured":"Ouaknine, J., Worrell, J.: Towards a theory of time-bounded verification. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010 Part II. LNCS, vol.\u00a06199, pp. 22\u201337. Springer, Heidelberg (2010)"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-60472-3_21","volume-title":"Hybrid Systems II","author":"O. Roux","year":"1995","unstructured":"Roux, O., Rusu, V.: Verifying time-bounded properties for ELECTRE reactive programs with stopwatch automata. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994 Part II. LNCS, vol.\u00a0999, pp. 405\u2013416. Springer, Heidelberg (1995)"},{"key":"4_CR31","series-title":"Wiley-Interscience series in discrete mathematics and optimization","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1999","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley, Chichester (1999)"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Sharma, A., Katoen, J.-P.: Weighted lumpability on Markov chains. In: 8th Ershov Informatics Conference. LNCS (2011)","DOI":"10.1007\/978-3-642-29709-0_28"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"4_CR34","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: LICS, pp. 332\u2013344 (1986)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24310-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T23:21:31Z","timestamp":1741735291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24310-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243097","9783642243103"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24310-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}