{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:40:01Z","timestamp":1738338001471,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853602"},{"type":"electronic","value":"9783540853619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85361-9_23","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T12:28:04Z","timestamp":1219062484000},"page":"264-278","source":"Crossref","is-referenced-by-count":5,"title":["Least Upper Bounds for Probability Measures and Their Applications to Abstractions"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_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 TOCL\u00a01, 162\u2013170 (2000)","journal-title":"ACM TOCL"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-24730-2_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C. Baier","year":"2004","unstructured":"Baier, C., Haverkrot, B., Hermanns, H., Katoen, J.-P.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 61\u201376. Springer, Heidelberg (2004)"},{"key":"23_CR3","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., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. and Comp.\u00a0200, 149\u2013214 (2005)","journal-title":"Inf. and Comp."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Chadha, R., Viswanathan, M., Viswanathan, R.: Least upper bounds for probability measures and their applications to abstractions. Technical Report UIUCDCS-R-2008-2973, UIUC (2008)","DOI":"10.1007\/978-3-540-85361-9_23"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44804-7_3","volume-title":"Process Algebra and Probabilistic Methods. Performance Modelling and Verification","author":"P.R. D\u2019Argenio","year":"2001","unstructured":"D\u2019Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reachability analysis of probabilistic systems by successive refinements. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001. LNCS, vol.\u00a02165, pp. 39\u201356. Springer, Heidelberg (2001)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45605-8_5","volume-title":"Process Algebra and Probabilistic Methods. Performance Modeling and Verification","author":"P.R. D\u2019Argenio","year":"2002","unstructured":"D\u2019Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and refinement strategies for probabilistic analysis. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002. LNCS, vol.\u00a02399, pp. 57\u201376. Springer, Heidelberg (2002)"},{"key":"23_CR7","unstructured":"Desharnais, J.: Labelled Markov Processes. PhD thesis, McGill University (1999)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Fecher, H., Leucker, M., Wolf, V.: Don\u2019t know in probabilistic systems. In: Proc. of SPIN, pp. 71\u201388 (2006)","DOI":"10.1007\/11691617_5"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Huth, M.: An abstraction framework for mixed non-deterministic and probabilistic systems. In: Validation of Stochastic Systems: A Guide to Current Research, pp. 419\u2013444 (2004)","DOI":"10.1007\/978-3-540-24611-4_12"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.tcs.2005.08.008","volume":"346","author":"M. Huth","year":"2005","unstructured":"Huth, M.: On finite-state approximants for probabilistic computation tree logic. TCS\u00a0346, 113\u2013134 (2005)","journal-title":"TCS"},{"key":"23_CR11","unstructured":"Jones, C.: Probabilistic Non-determinism. PhD thesis, University of Edinburgh (1990)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proc. of LICS, pp. 266\u2013277 (1991)","DOI":"10.1109\/LICS.1991.151651"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-73368-3_37","volume-title":"Computer Aided Verification","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: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 311\u2013324. Springer, Heidelberg (2007)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: Proc. of QEST, pp. 157\u2013166 (2006)","DOI":"10.1109\/QEST.2006.19"},{"key":"23_CR15","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A. McIver","year":"2004","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2004)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.scico.2005.02.008","volume":"58","author":"D. Monniaux","year":"2005","unstructured":"Monniaux, D.: Abstract interpretation of programs as Markov decision processes. Science of Computer Programming\u00a058, 179\u2013205 (2005)","journal-title":"Science of Computer Programming"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Norman, G.: Analyzing randomized distributed algorithms. In: Validation of Stochastic Systems: A Guide to Current Research, pp. 384\u2013418 (2004)","DOI":"10.1007\/978-3-540-24611-4_11"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Rutten, J.M., Kwiatkowska, M., Norman, G., Parker, D.: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. AMS (2004)","DOI":"10.1090\/crmm\/023"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/3-540-08921-7_92","volume-title":"Mathematical Foundations of Computer Science 1978","author":"N. Saheb-Djahromi","year":"1978","unstructured":"Saheb-Djahromi, N.: Probabilistic LCF. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol.\u00a064, pp. 442\u2013451. Springer, Heidelberg (1978)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11817949_5","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R. Segala","year":"2006","unstructured":"Segala, R.: Probability and nondeterminism in operational models of concurrency. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 64\u201378. Springer, Heidelberg (2006)"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11691372_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Sen","year":"2006","unstructured":"Sen, K., Viswanathan, M., Agha, G.: Model checking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 394\u2013410. Springer, Heidelberg (2006)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Wachter, B., Zhang, L., Hermanns, H.: Probabilistic model checking modulo theories. In: Proc. of QEST (2007)","DOI":"10.1109\/QEST.2007.10"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/978-3-540-24730-2_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"H. Younes","year":"2004","unstructured":"Younes, H., Kwiatkowska, M., Norman, G., Parker, D.: Numerical vs. statistical probabilistic model checking: An empirical study. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 46\u201360. Springer, Heidelberg (2004)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45657-0_17","volume-title":"Computer Aided Verification","author":"H. Younes","year":"2002","unstructured":"Younes, H., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 223\u2013235. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2008 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85361-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:15:23Z","timestamp":1738336523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85361-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853602","9783540853619"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85361-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}