{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T15:28:35Z","timestamp":1759073315983},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_19","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:05:18Z","timestamp":1252937118000},"page":"205-216","source":"Crossref","is-referenced-by-count":4,"title":["Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL"],"prefix":"10.1007","author":[{"given":"Michael","family":"Huth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H. Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing\u00a06, 512\u2013535 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"19_CR2","volume-title":"Proc. of LICS 2003","author":"M. Kwiatkowska","year":"2003","unstructured":"Kwiatkowska, M.: Model checking for probability and time: From theory to practice. In: Proc. of LICS 2003. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"19_CR3","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":"19_CR4","volume-title":"Proc. of LICS 1991","author":"B. Jonsson","year":"1991","unstructured":"Jonsson, B., Larsen, K.: Specification and refinement of probabilistic processes. In: Proc. of LICS 1991. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Fecher, H., Leucker, M., Wolf, V.: Don\u2019t know in probabilistic systems. In: SPIN Workshop on Model Checking of Software (2006)","DOI":"10.1007\/11691617_5"},{"key":"19_CR6","volume-title":"Proc. of QEST 2008","author":"H. Fecher","year":"2008","unstructured":"Fecher, H., Huth, M., Piterman, N., Wagner, D.: Hintikka Games for PCTL on Labeled Markov Chains. In: Proc. of QEST 2008. IEEE Computer Society, Los Alamitos (2008)"},{"key":"19_CR7","unstructured":"Kattenbelt, M., Huth, M.: Abstraction Framework for Markov Decision Processes and PCTL Via Games. Technical Report RR-09-01, Oxford University Computing Laboratory (2009)"},{"key":"19_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9455-6","volume-title":"Denumerable Markov Chains","author":"J. Kemeny","year":"1976","unstructured":"Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains. Springer, Heidelberg (1976)"},{"key":"19_CR9","unstructured":"Kleene, S.: Introduction to Metamathematics. Van Nostrand (1952)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44685-0_29","volume-title":"CONCUR 2001 - Concurrency Theory","author":"P. Godefroid","year":"2001","unstructured":"Godefroid, P., Huth, M., Jagadeesan, R.: Abstraction-based model checking using modal transition systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, p. 426. Springer, Heidelberg (2001)"},{"key":"19_CR11","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. Theoretical Computer Science\u00a0346, 113\u2013134 (2005)","journal-title":"Theoretical Computer Science"},{"key":"19_CR12","volume-title":"Proc. of LICS 2004","author":"D. Dams","year":"2004","unstructured":"Dams, D., Namjoshi, K.: The existence of finite abstractions for branching time model checking. In: Proc. of LICS 2004. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-60692-0_70","volume-title":"Proceedings of the 15th Conference on 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: Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 499\u2013513. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:28:58Z","timestamp":1552159738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}