{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:31Z","timestamp":1725490171494},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678977"},{"type":"electronic","value":"9783540446187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_24","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:38:51Z","timestamp":1188297531000},"page":"320-333","source":"Crossref","is-referenced-by-count":16,"title":["Reasoning about Probabilistic Lossy Channel Systems"],"prefix":"10.1007","author":[{"given":"Parosh","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christel","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Purushothaman","family":"Iyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bengt","family":"Jonsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"key":"24_CR1","series-title":"Lect Notes Comput Sci","first-page":"71","volume-title":"Information and Computation","author":"P. A. Abdulla","year":"1996","unstructured":"Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71\u201390, 1996. A Preliminary Version appeared in Proc. ICALP\u2019 94, LNCS 820."},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P. A. Abdulla","year":"1996","unstructured":"Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91\u2013101, 1996. A Preliminary Version appeared in Proc. 8st IEEE Int. Symp. on Logic in Computer Science.","journal-title":"Information and Computation"},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-48778-6_3","volume-title":"ARTS\u201999, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop","author":"C. Baier","year":"1999","unstructured":"C. Baier and B. Engelen. Establishing qualitative properties for probabilistic lossy channel systems. In Katoen, editor, ARTS\u201999, Formal Methods for Real-Time and Probabilistic Systems, 5th Int. AMAST Workshop, volume 1601 of Lecture Notes in Computer Science, pages 34\u201352. Springer Verlag, 1999."},{"issue":"5","key":"24_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"2","author":"D. Brand","year":"1983","unstructured":"D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5):323\u2013342, April 1983.","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Rajiv Gupta, Scott A. Smolka, and Shaji Bhaskar. On randomizatioon in sequential and distributed algorithms. ACM Computing Surveys, 26(1):7\u201386, March 1994.","key":"24_CR5","DOI":"10.1145\/174666.174667"},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/BFb0030633","volume-title":"TAPSOFT\u2019 97: Theory and Practice of Software Development","author":"P. Iyer","year":"1997","unstructured":"Purush Iyer and Murali Narasimha. Probabilistic lossy channel systems. In Michel Bidoit and Max Dauchet, editors, TAPSOFT\u2019 97: Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 667\u2013681. Springer-Verlag, 1997."},{"key":"24_CR7","volume-title":"Denumerable Markov Chains","author":"J. G. Kemeny","year":"1966","unstructured":"J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Van Nostrand, New Jersey, 1966."},{"unstructured":"M. O. Rabin. Probabilistic algorithms. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, pages 21\u201339. Academic Press, 1976. This classic paper on probabilistic algorithms features algorithms for primality testing and nearest neighbors.","key":"24_CR8"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:09:35Z","timestamp":1556802575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}