{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:21Z","timestamp":1760202561674},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_28","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"412-427","source":"Crossref","is-referenced-by-count":14,"title":["Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Martin R.","family":"Neuh\u00e4u\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-36577-X_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y. Abdedda\u00efm","year":"2003","unstructured":"Abdedda\u00efm, Y., Asarin, E., Maler, O.: On optimal scheduling under uncertainty. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, pp. 240\u2013253. Springer, Heidelberg (2003)"},{"key":"28_CR2","volume-title":"Probability & Measure Theory","author":"R.B. Ash","year":"2000","unstructured":"Ash, R.B., Dol\u00e9ans-Dade, C.A.: Probability & Measure Theory, 2nd edn. Academic Press, London (2000)","edition":"2"},{"key":"28_CR3","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.K.: Model-checking continous-time Markov chains. ACM Trans. Comput. Log.\u00a01, 162\u2013170 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"28_CR4","unstructured":"Baier, C.: On Algorithmic Verification Methods for Probabilistic Systems. Habilitation Thesis, University of Mannheim (1998)"},{"key":"28_CR5","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":"28_CR6","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Nonuniform CTMDPs. unpublished manuscript (2004)"},{"key":"28_CR7","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. Comp. Sci.\u00a0345, 2\u201326 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ic.2005.03.001","volume":"200","author":"C. Baier","year":"2005","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation\u00a0200, 149\u2013214 (2005)","journal-title":"Information and Computation"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s004460050046","volume":"11","author":"C. Baier","year":"1998","unstructured":"Baier, C., Kwiatkowska, M.Z.: Model checking for a probabilistic branching time logic with fairness. Distr. Comp.\u00a011, 125\u2013155 (1998)","journal-title":"Distr. Comp."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-247X(85)90288-4","volume":"112","author":"F.J. Beutler","year":"1985","unstructured":"Beutler, F.J., Ross, K.W.: Optimal policies for controlled Markov chains with a constraint. Journal of Mathematical Analysis and Appl.\u00a0112, 236\u2013252 (1985)","journal-title":"Journal of Mathematical Analysis and Appl."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Bianco","year":"1995","unstructured":"Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a01026, pp. 499\u2013513. Springer, Heidelberg (1995)"},{"key":"28_CR12","volume-title":"Dependable Systems and Networks","author":"H. Boudali","year":"2007","unstructured":"Boudali, H., Crouzen, P., Stoelinga, M.I.A.: Dynamic fault tree analysis using input\/output interactive Markov chains. In: Dependable Systems and Networks, IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P. Buchholz","year":"1994","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability\u00a031, 59\u201375 (1994)","journal-title":"Journal of Applied Probability"},{"key":"28_CR14","first-page":"89","volume":"19","author":"G. Chiola","year":"1993","unstructured":"Chiola, G., Marsan, M.A., Balbo, G., Conte, G.: Generalized stochastic Petri nets: A definition at the net level and its implications. IEEE TSE\u00a019, 89\u2013107 (1993)","journal-title":"IEEE TSE"},{"key":"28_CR15","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (1997)"},{"key":"28_CR16","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":"28_CR17","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/moor.1040.0089","volume":"29","author":"E.A. Feinberg","year":"2004","unstructured":"Feinberg, E.A.: Continuous time discounted jump Markov decision processes: A discrete-event approach. Mathematics of Operations Research\u00a029, 492\u2013524 (2004)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0004-3702(02)00376-4","volume":"147","author":"R. Givan","year":"2003","unstructured":"Givan, R., Dean, T., Greig, M.: Equivalence notions and model minimization in Markov decision processes. Artificial Intelligence\u00a0147, 163\u2013223 (2003)","journal-title":"Artificial Intelligence"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Interactive Markov Chains: The Quest for Quantified Quality","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)"},{"key":"28_CR20","volume-title":"Dynamic Probabilistic Systems","author":"R.A. Howard","year":"1971","unstructured":"Howard, R.A.: Dynamic Probabilistic Systems. John Wiley and Sons, West Sussex, England (1971)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"CAV","author":"J.-P. Katoen","year":"2007","unstructured":"Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: CAV. LNCS, Springer, Heidelberg (2007)"},{"key":"28_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9455-6","volume-title":"Denumerable Markov Chains","author":"J.G. Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains, 2nd edn. Springer, Heidelberg (1976)","edition":"2"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094, 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"28_CR24","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.T. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.\u00a02165, pp. 57\u201370. Springer, Heidelberg (2001)"},{"key":"28_CR25","unstructured":"Neuh\u00e4u\u00dfer, M.R.: Bisimulation and logical preservation for continuous-time markov decision processes. Technical Report\u00a010, RWTH Aachen (2007)"},{"key":"28_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, West Sussex, England (1994)"},{"key":"28_CR27","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/309847.309997","volume-title":"DAC","author":"Q. Qiu","year":"1999","unstructured":"Qiu, Q., Pedram, M.: Dynamic power management based on continuous-time Markov decision processes. In: DAC, pp. 555\u2013561. ACM Press, New York (1999)"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-44667-2_9","volume-title":"Lectures on Formal Methods and Performance Analysis","author":"W.H. Sanders","year":"2001","unstructured":"Sanders, W.H., Meyer, J.F.: Stochastic activity networks: Formal definitions and concepts. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) Lectures on Formal Methods and Performance Analysis. LNCS, vol.\u00a02090, pp. 315\u2013343. Springer, Heidelberg (2001)"},{"key":"28_CR29","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02, 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"28_CR30","first-page":"327","volume-title":"FOCS","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/11867340_25","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"N. Wolovick","year":"2006","unstructured":"Wolovick, N., Johr, S.: A characterization of meaningful schedulers for continuous-time Markov decision processes. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol.\u00a04202, pp. 352\u2013367. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:05Z","timestamp":1619519105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}