{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:19:19Z","timestamp":1743146359549,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631668"},{"type":"electronic","value":"9783540691952"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/3-540-63166-6_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:13:48Z","timestamp":1330280028000},"page":"304-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Programs with quasi-stable channels are effectively recognizable"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"C\u00e9c\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"31_CR1","unstructured":"P. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. In Proc. 8\n\n                  th\n                \nAnnual IEEE Symposium of Logic in Computer Science, 1993."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"P. Abdulla and B. Jonsson. Undecidable Verification Problems for Programs with Unreliable Channels, in Proc. of ICALP, vol. 820 of LNCS pp.316\u20131994.","DOI":"10.1007\/3-540-58201-0_78"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"J. Berstel. Transductions and Context-Free Languages. B.G. Teubner Stuttgart, 1979.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"31_CR4","first-page":"1","volume":"1102","author":"B. Boigelot","year":"1996","unstructured":"B. Boigelot and P. Godefroid. Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs. In Proc. of 8\n\n                  th\n                \nCAV (August), USA LNCS 1102, pp. 1\u201312, 1996.","journal-title":"Proc. of 8th CAV (August), USA LNCS"},{"issue":"2","key":"31_CR5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Daniel Brand and Pitro Zafiropulo. On communicating finite-state machines. JACM, 30(2):323\u2013342, 1983.","journal-title":"JACM"},{"issue":"No1","key":"31_CR6","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"G. C\u00e9c\u00e9, A. Finkel and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. In Information and Computation, vol. 124, No 1, 20\u201331, 1996","journal-title":"Information and Computation"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"G. C\u00e9c\u00e9 and A. Finkel Programs with Quasi-Stable Channels are Effectively Recognizable. Technical Report, LSV, ENS de Cachan, 1997 (available via the authors) grenade","DOI":"10.1007\/3-540-63166-6_31"},{"issue":"n\u21342","key":"31_CR8","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"A. Finkel. Reduction and covering of Infinite Reachability Trees. Information and Computation, vol. 89, n\u2134 2, pp. 144\u2013170, 1990.","journal-title":"Information and Computation"},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02277857","volume":"7","author":"A. Finkel","year":"1994","unstructured":"A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7:129\u2013135, 1994.","journal-title":"Distributed Computing"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"A. Finkel and P. McKenzie. Verifying identical communicating Processes is undecidable. to appear in TCS 1997","DOI":"10.1016\/S0304-3975(96)00026-6"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(84)80014-5","volume":"63","author":"M. G. Gouda","year":"1984","unstructured":"M. G. Gouda, E. G. Manning and Y. T. Yu. On the Progress of Communication between Two Finite State Machines. Information and Control, 63:217\u2013225, 1984.","journal-title":"Information and Control"},{"key":"31_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(93)90212-C","volume":"113","author":"T. J\u00e9ron","year":"1993","unstructured":"T. J\u00e9ron and C. Jard. Testing for unboundedness of fifo channels. Theoretical Computer Science 113, pp. 93\u2013117, 1993.","journal-title":"Theoretical Computer Science"},{"key":"31_CR13","unstructured":"J. K. Pachl. Reachability Problems for Communicating Finite State Machines Research Report CS-82-12, University of Waterloo, Dpt. of Computer Science, 1982."},{"key":"31_CR14","unstructured":"J. K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In Proc. of Protocol Specification, Testing and Verification, VII, May 1987."},{"key":"31_CR15","unstructured":"Kenneth J. Turner. Using Formal Description Techniques; an introduction to Estelle, Lotos and SDL. \u00a9John Wiley & Son Ltd., 1993."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63166-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:10:20Z","timestamp":1578510620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63166-6_31"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631668","9783540691952"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-63166-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}