{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:23:07Z","timestamp":1649031787601},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0304-3975(96)00026-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"217-230","source":"Crossref","is-referenced-by-count":12,"title":["Verifying identical communicating processes is undecidable"],"prefix":"10.1016","volume":"174","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"McKenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00026-6_BIB1","series-title":"Proc. 8th Annual IEEE Symposium on Logic in Computer Science","first-page":"160","article-title":"Verifying programs with unreliable channels","author":"Abdullah","year":"1993"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB2","series-title":"Proc. ICALP","article-title":"Undecidability of verifying programs with unreliable channels","volume":"Vol. 820","author":"Abdullah","year":"1994"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB3","series-title":"Proc. 3rd IEEE Internat. Symp. on High Performance Distributed Computing","first-page":"262","article-title":"Deciding boundedness for systems of two communicating finite state machines","author":"Benslimane","year":"1994"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB4","author":"Brand","year":"1981"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite state machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. Assoc. Comput. Machinery"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB6","series-title":"CCITT Recommendation Z.100: Specification and description language SDL","volume":"Vol X.1\u2013X.5","year":"1988"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB7","article-title":"Unreliable channels are easier to verify than perfect channels","volume":"124","author":"C\u00e9C\u00e9","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB8","series-title":"The formal description technique Estelle","author":"Diaz","year":"1989"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02277857","article-title":"Decidability of the termination problem for completely specified protocols","volume":"7","author":"Finkel","year":"1994","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(96)00026-6_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(85)90014-3","article-title":"An introduction to Fifo nets \u2014 Monogeneous nets: a subclass of Fifo nets","volume":"35","author":"Memmi","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00026-6_BIB12","series-title":"Introduction to Distributed Algorithms","author":"Tel","year":"1994"},{"key":"10.1016\/S0304-3975(96)00026-6_BIB13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90047-X","article-title":"Automates \u00e0 files","volume":"80","author":"Vauquelin","year":"1980","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000266?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596000266?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:11Z","timestamp":1556522711000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596000266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0304397596000266"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00026-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}