{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:01Z","timestamp":1725548941669},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222651"},{"type":"electronic","value":"9783540246114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24611-4_4","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T14:01:10Z","timestamp":1267106470000},"page":"124-146","source":"Crossref","is-referenced-by-count":1,"title":["Verifying Qualitative Properties of Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Arons, T., Zuck, L., Pnueli, A.: Automatic verification by probabilistic abstraction. In: Submitted to Fossacs 2003 (2003)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In: Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, January 24-26, 1983, ACM SIGACT-SIGPLAN, pp. 117\u2013126 (1983)","DOI":"10.1145\/567067.567080"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1145\/242223.242257","volume":"28","author":"E.M. Clarke","year":"1996","unstructured":"Clarke, E.M., Wing, J.M.: Formal methods: State of the art and future directions. ACM Computing Surveys\u00a028(4), 626\u2013643 (1996)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"4_CR4","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. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/800057.808660","volume-title":"ACM Symposium on Theory of Computing (STOC 1984)","author":"S. Hart","year":"1984","unstructured":"Hart, S., Sharir, M.: Probabilistic temporal logics for finite and bounded models. In: ACM Symposium on Theory of Computing (STOC 1984), Baltimore, USA, April 1984, pp. 1\u201313. ACM Press, New York (1984)"},{"key":"4_CR6","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1960","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand Reinhold, New York (1960)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Lehman, D., Rabin, M.O.: On the advantage of free choice: A fully symmetric and fully distributed solution to the dining philosophers problem. In: Proceedings of 10th ACM Symposium of Principles of Programming Languages, Williamsburg, pp. 133\u2013138 (1981)","DOI":"10.1145\/567532.567547"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0019-9958(82)91022-1","volume":"53","author":"D. Lehmann","year":"1982","unstructured":"Lehmann, D., Shelah, S.: Reasoning with time and chance. Information and Control\u00a053(3), 165\u2013198 (1982)","journal-title":"Information and Control"},{"key":"4_CR9","first-page":"97","volume-title":"Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, January 1985, pp. 97\u2013107. ACM, New York (1985)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/SFCS.1977.32","volume-title":"Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS 1977)","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS 1977), Providence, Rhode Island, October 31\u2013November 2, pp. 46\u201357. IEEE Computer Society Press, Los Alamitos (1977)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: On the extremely fair treatment of probabilistic algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, April 25-27, pp. 278\u2013290 (1983)","DOI":"10.1145\/800061.808757"},{"key":"4_CR12","volume-title":"Handbook on Randomized Computing","author":"P. Pardalos","year":"2001","unstructured":"Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J.: Handbook on Randomized Computing. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1993.1012","volume":"103","author":"A. Pnueli","year":"1993","unstructured":"Pnueli, A., Zuck, L.D.: Probabilistic verification. Information and Computation\u00a0103(1), 1\u201329 (1993)","journal-title":"Information and Computation"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"Proceedings of the Fifth International Symposium in Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Proceedings of the Fifth International Symposium in Programming. LNCS, vol.\u00a0137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of omega-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FoCS 1988, Los Alamitos, California, October 1988, pp. 319\u2013327. IEEE Computer Society Press, Los Alamitos (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"4_CR16","first-page":"327","volume-title":"26th Annual Symposium on Foundations of Computer Science","author":"Y. Moshe","year":"1985","unstructured":"Moshe, Y.: Vardi. Automatic verification of probabilistic concurrent finite-state programs. In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, October 21-23, pp. 327\u2013338. IEEE, Los Alamitos (1985)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-60915-6_6","volume-title":"An Automata-Theoretic Approach to Linear Temporal Logic","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: Logics for Concurrency. LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, Heidelberg (1996)"},{"issue":"1\/2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"Wolper, P.: Temporal logic can be more expressive. Information and Control\u00a056(1\/2), 72\u201399 (1983)","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Validation of Stochastic Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24611-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T07:46:01Z","timestamp":1558856761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24611-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222651","9783540246114"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24611-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}