{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:15Z","timestamp":1750308135723,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,9,5]],"date-time":"2005-09-05T00:00:00Z","timestamp":1125878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,9,5]]},"DOI":"10.1145\/1081180.1081182","type":"proceedings-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T17:34:39Z","timestamp":1131384879000},"page":"2-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantitative analysis of distributed randomized protocols"],"prefix":"10.1145","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[{"name":"Universit\u00e4t Bonn, Bonn, Germany"}]},{"given":"Frank","family":"Ciesinski","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bonn, Bonn, Germany"}]},{"given":"Marcus","family":"Groesser","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bonn, Bonn, Germany"}]}],"member":"320","published-online":{"date-parts":[[2005,9,5]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"57","volume-title":"MEMOCODE'04","author":"Baier C.","year":"2004","unstructured":"C. Baier , F. Ciesinski , and M. Gr\u00f6sser . Probmela: a modeling language for communicating probabilistic systems . MEMOCODE'04 , pages 57 -- 66 . IEEE CS Press , 2004 . C. Baier, F. Ciesinski, and M. Gr\u00f6sser. Probmela: a modeling language for communicating probabilistic systems. MEMOCODE'04, pages 57--66. IEEE CS Press, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.5555\/646251.685846"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/j.entcs.2005.10.034"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/QEST.2004.30"},{"key":"e_1_3_2_1_5_1","first-page":"2925","article-title":"editors. Validation of Stochastic Systems","author":"Baier C.","year":"2003","unstructured":"C. Baier , B. Haverkort , H. Hermanns , J.-P. Katoen , and M. Siegle , editors. Validation of Stochastic Systems , LNCS 2925 , 2003 . C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors. Validation of Stochastic Systems, LNCS 2925, 2003.","journal-title":"LNCS"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/s004460050046"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.5555\/646833.708042"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-540-45232-4_8"},{"key":"e_1_3_2_1_9_1","first-page":"336","volume-title":"ICALP'90","author":"Courcoubetis C.","year":"1990","unstructured":"C. Courcoubetis and M. Yannakakis . Markov decision processes and regular events (extended abstract) . ICALP'90 , LNCS 443, pages 336 -- 349 , 1990 . C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events (extended abstract). ICALP'90, LNCS 443, pages 336--349, 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/210332.210339"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/QEST.2004.31"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/646512.695347"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_2_1_15_1","first-page":"289","volume-title":"POMIV","author":"Godefroid P.","year":"1996","unstructured":"P. Godefroid . On the costs and benefits of using partial-order methods for the verification of concurrent systems . In POMIV , pages 289 -- 303 , 1996 . P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In POMIV, pages 289--303, 1996."},{"key":"e_1_3_2_1_16_1","first-page":"1032","article-title":"Partial Order Methods for the Verification of Concurrent Systems: An Approach to the State Explosion Problem","author":"Godefroid P.","year":"1996","unstructured":"P. Godefroid . Partial Order Methods for the Verification of Concurrent Systems: An Approach to the State Explosion Problem , LNCS 1032 , 1996 . P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems: An Approach to the State Explosion Problem, LNCS 1032, 1996.","journal-title":"LNCS"},{"key":"e_1_3_2_1_17_1","volume-title":"The SPIN Model Checker, Primer and Reference Manual. Add.Wes","author":"Holzmann G.","year":"2003","unstructured":"G. Holzmann . The SPIN Model Checker, Primer and Reference Manual. Add.Wes ., 2003 . G. Holzmann. The SPIN Model Checker, Primer and Reference Manual. Add.Wes., 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1016\/0890-5401(90)90004-2"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc.Tools Day \/ CONCUR'02","author":"Larsen K.G.","year":"2002","unstructured":"B.Jeannet, P.d'Argenio and K.G. Larsen . RAPTURE: A tool for verifying Markov Decision Processes . Proc.Tools Day \/ CONCUR'02 . Tech.Rep. FIMU-RS- 2002 --05,84--98, 2002. B.Jeannet, P.d'Argenio and K.G. Larsen. RAPTURE: A tool for verifying Markov Decision Processes. Proc.Tools Day \/ CONCUR'02. Tech.Rep. FIMU-RS-2002--05,84--98, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/1014989.1014992"},{"key":"e_1_3_2_1_21_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N.","year":"1996","unstructured":"N. Lynch . Distributed Algorithms. Morgan Kaufmann , San Francisco, CS , 1996 . MIT. N. Lynch. Distributed Algorithms. Morgan Kaufmann, San Francisco, CS, 1996. MIT."},{"key":"e_1_3_2_1_22_1","first-page":"14","article-title":"pGCL: formal reasoning for random algorithms. Proc. WOFACS'98","volume":"22","author":"Morgan C.","year":"1999","unstructured":"C. Morgan and A. McIver . pGCL: formal reasoning for random algorithms. Proc. WOFACS'98 , Spec. Iss.of SACJ , 22 : 14 -- 27 , 1999 . C. Morgan and A. McIver. pGCL: formal reasoning for random algorithms. Proc. WOFACS'98, Spec. Iss.of SACJ, 22:14--27, 1999.","journal-title":"Spec. Iss.of SACJ"},{"key":"e_1_3_2_1_23_1","volume-title":"Refinement and Proof for Probabilistic Systems. Monographs in Computer Science","author":"Morgan C.","year":"2005","unstructured":"C. Morgan and A. McIver . Abstraction , Refinement and Proof for Probabilistic Systems. Monographs in Computer Science . Springer , 2005 . C. Morgan and A. McIver. Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, 2005."},{"volume-title":"The ANTLR Reference Manual. 2.6 edition","year":"1999","unstructured":"Terence Parr. The ANTLR Reference Manual. 2.6 edition , 1999 . Terence Parr. The ANTLR Reference Manual. 2.6 edition, 1999.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","first-page":"79","volume-title":"POMIV","author":"Peled D.","year":"1996","unstructured":"D. Peled . Partial order reduction: Linear and branching time logics and process algebras . In POMIV , pages 79 -- 88 , 1996 . D. Peled. Partial order reduction: Linear and branching time logics and process algebras. In POMIV, pages 79--88, 1996."},{"volume-title":"Partial Order Methods in Verification","author":"Peled D.","unstructured":"D. Peled , V. Pratt , and G. Holzmann , editors . Partial Order Methods in Verification , volume 29(10) of DIMACS. American Mathematical Society, 1997 . D. Peled, V. Pratt, and G. Holzmann, editors. Partial Order Methods in Verification, volume 29(10) of DIMACS. American Mathematical Society, 1997.","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","first-page":"79","volume-title":"POMIV","author":"Valmari A.","year":"1996","unstructured":"A. Valmari . Stubborn set methods for process algebras . In POMIV , pages 79 -- 88 , 1996 . A. Valmari. Stubborn set methods for process algebras. In POMIV, pages 79--88, 1996."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/SFCS.1985.12"},{"key":"e_1_3_2_1_29_1","first-page":"332","volume-title":"LICS'86","author":"Vardi M.","year":"1986","unstructured":"M. Vardi and P. Wolper . An automata-theoretic approach to automatic program verification (preliminary report) . LICS'86 , pages 332 -- 344 , IEEE Computer Society Press , 1986 . M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). LICS'86, pages 332--344, IEEE Computer Society Press, 1986."}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"],"acronym":"FMICS05","name":"FMICS05: Tenth International Workshop on Formal Methods in Industrial Criticial Systems 2005","location":"Lisbon Portugal"},"container-title":["Proceedings of the 10th international workshop on Formal methods for industrial critical systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081180.1081182","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1081180.1081182","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:33Z","timestamp":1750262913000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1081180.1081182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,5]]},"references-count":28,"alternative-id":["10.1145\/1081180.1081182","10.1145\/1081180"],"URL":"https:\/\/doi.org\/10.1145\/1081180.1081182","relation":{},"subject":[],"published":{"date-parts":[[2005,9,5]]},"assertion":[{"value":"2005-09-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}