{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:45:38Z","timestamp":1649180738433},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1016\/0020-0190(85)90033-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"63-68","source":"Crossref","is-referenced-by-count":9,"title":["Exposure to deadlock for communicating processes is hard to detect"],"prefix":"10.1016","volume":"21","author":[{"given":"Thomas","family":"R\u00e4uchle","sequence":"first","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4.5","key":"10.1016\/0020-0190(85)90033-X_BIB1","first-page":"361","article-title":"Finite state description of communicating protocols","volume":"2","author":"Bochmann","year":"1978","journal-title":"Comput. Networks"},{"issue":"12","key":"10.1016\/0020-0190(85)90033-X_BIB2","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TCOM.1980.1094685","article-title":"Formal methods in communication protocol design","volume":"28","author":"Bochmann","year":"1980","journal-title":"IEEE Trans. Comm. Comm"},{"issue":"2","key":"10.1016\/0020-0190(85)90033-X_BIB3","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. ACM"},{"key":"10.1016\/0020-0190(85)90033-X_BIB4","article-title":"Protocol validation by maximal progress state exploration","author":"Gouda","year":"1982"},{"key":"10.1016\/0020-0190(85)90033-X_BIB5","article-title":"Verifying Concurrent Programs Using Temporal Logic","author":"Hailpern","year":"1982"},{"key":"10.1016\/0020-0190(85)90033-X_BIB6","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0190(85)90033-X_BIB7","article-title":"State machines and assertions: An integrated approach to modeling and verification of distributed systems","author":"Joseph","year":"1984"},{"key":"10.1016\/0020-0190(85)90033-X_BIB8","series-title":"Complexity of Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0020-0190(85)90033-X_BIB9","article-title":"Proof rules for communicating sequential processes","author":"Levin","year":"1980"},{"key":"10.1016\/0020-0190(85)90033-X_BIB10","article-title":"Axiomatic verification to enhance software reliability","author":"Schlichting","year":"1982"},{"issue":"12","key":"10.1016\/0020-0190(85)90033-X_BIB11","first-page":"94","article-title":"Deadlock detection for a class of communicating finite state machines","volume":"30","author":"Yu","year":"1982","journal-title":"IEEE Trans. Comm. Comm"},{"issue":"4","key":"10.1016\/0020-0190(85)90033-X_BIB12","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/TCOM.1980.1094687","article-title":"Towards analyzing and synthesizing protocols","volume":"28","author":"Zafiropulo","year":"1980","journal-title":"IEEE Trans. Comm. Comm"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908590033X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908590033X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:27:48Z","timestamp":1553592468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908590033X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["002001908590033X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90033-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}