{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:05:37Z","timestamp":1725573937886},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206323"},{"type":"electronic","value":"9783540409656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40965-6_19","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:52:14Z","timestamp":1294415534000},"page":"291-304","source":"Crossref","is-referenced-by-count":1,"title":["Model Checking Probabilistic Distributed Systems"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Beauquier, J., Gradinariu, M., Johnen, C.: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Technical Report 99-1225, Universit\u00e9 Paris Sud (1999)","key":"19_CR1"},{"key":"19_CR2","first-page":"117","volume-title":"Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages","author":"E.M. Clarke","year":"1983","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\u201326, pp. 117\u2013126. ACM SIGACT-SIGPLAN, New York (1983)"},{"issue":"4","key":"19_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":"19_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":"19_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"19_CR6","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)"},{"unstructured":"Leucker, M.: Logics for Mazurkiewicz traces. PhD thesis, Lehrstuhl f\u00fcr Informatik II, RWTH Aachen (2002)","key":"19_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)","key":"19_CR8","DOI":"10.1145\/567532.567547"},{"issue":"3","key":"19_CR9","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"},{"unstructured":"Madhusudan, P., D\u2019Souza, D.: On-the-fly verification of Product- LTL. In: Proocedings of the National Seminar on Theoretical Computer Science, Madras (June 1997)","key":"19_CR10"},{"key":"19_CR11","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)"},{"volume-title":"Handbook on Randomized Computing","year":"2001","unstructured":"Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J. (eds.): Handbook on Randomized Computing, June 2001. Kluwer Academic Publishers, Dordrecht (2001)","key":"19_CR12"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J.P. Queille","year":"1982","unstructured":"Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"unstructured":"Thiagarajan, P.S.: PTL over product state spaces. Technical Report TCS- 95-4, School of Mathematics, SPIC Science Foundation (1995)","key":"19_CR14"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1109\/SFCS.1985.12","volume-title":"26th Annual Symposium on Foundations of Computer Science","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finitestate programs. In: 26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, October 21\u201323, pp. 327\u2013338. IEEE, Los Alamitos (1985)"},{"key":"19_CR16","first-page":"332","volume-title":"Symposium on Logic in Computer Science (LICS 1986)","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Symposium on Logic in Computer Science (LICS 1986), Washington, D.C., USA, June 1986, pp. 332\u2013345. IEEE Computer Society Press, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2013 ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40965-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T17:44:40Z","timestamp":1559929480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40965-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206323","9783540409656"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40965-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}