{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:24Z","timestamp":1725486144058},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008972"},{"type":"electronic","value":"9783540365761"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_3","type":"book-chapter","created":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T22:42:17Z","timestamp":1181601737000},"page":"39-53","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Verification of Probabilistic Systems with Faulty Communication"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Reasoning about probabilistic lossy channel systems","author":"P. A. Abdulla","year":"2000","unstructured":"Parosh Aziz Abdulla, Christel Baier, Purushothaman Iyer,and Bengt Jonsson.Reasoning about probabilistic lossy channel systems.In C. Palamidessi, editor,Proc. CONCUR 2000, 11th Int. Conf. on Concurrency Theory volume 1877 of Lecture Notes in Computer Science 2000."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","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.","journal-title":"Information and Computation"},{"issue":"2","key":"3_CR3","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.","journal-title":"Information and Computation"},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-48778-6_3","volume-title":"Establishing qualitative properties for probabilistic lossy channel systems","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."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"G.V. Bochman.Finite state description of communicating protocols.Computer Networks 2:361\u2013371,1978.","DOI":"10.1016\/0376-5075(78)90015-6"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"N. Bertrand and Ph. Schnoebelen.Model checking lossy channels systems is probably decidable.In Proc. FOSSACS03, Conf. on Foundations of Software Science and Computation Structures 2003.","DOI":"10.1007\/3-540-36576-1_8"},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","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"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"G\u00e9rard C\u00e9c\u00e9, Alain Finkel,and S. Purushothaman Iyer.Unreliable channels are easier to verify than perfect channels.Information and Computation 124(1):20\u201331,10 January 1996.","journal-title":"Information and Computation"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"G. Higman.Ordering by divisibility in abstract algebras.Proc. London Math. Soc.2:326\u2013336,1952.","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"3_CR10","unstructured":"J.G. Kemeny, J.L. Snell,and A.W. Knapp.Denumerable Markov Chains D Van Nostad Co.,1966."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"W. Thomas.Automata on infinite objects.In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics pages 133\u2013192,1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,9]],"date-time":"2020-02-09T23:24:03Z","timestamp":1581290643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36576-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}