{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:23Z","timestamp":1759638803079,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Networks and Applications"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1023\/a:1013640918785","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T23:30:27Z","timestamp":1045697427000},"page":"251-257","source":"Crossref","is-referenced-by-count":4,"title":["Deadlock detection in communicating finite state machines by even reachability analysis"],"prefix":"10.1007","volume":"2","author":[{"given":"Wuxu","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"328979_CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"D. Brand and P. Zafiropulo, On communicating finite-state machines, Journal of the Association for Computing Machinery 30(2) (1983) 323\u2013342.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"328979_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1145\/5001.5002","volume":"8","author":"M. Gouda","year":"1986","unstructured":"M. Gouda and C.K. Chang, Proving liveness for networks of communicating finite state machines, ACM Transactions on Programming Languages and Systems 8(1) (1986) 154\u2013182.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"328979_CR3","first-page":"209","volume":"6","author":"M. Gouda","year":"1987","unstructured":"M. Gouda, E. Gurari, T.-H. Lai and L.E. Rosier, On deadlock detection in systems of communicating finite state machines, Computers and Artificial Intelligence 6(3) (1987) 209\u2013228.","journal-title":"Computers and Artificial Intelligence"},{"key":"328979_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0169-7552(85)90086-8","volume":"9","author":"M. Gouda","year":"1985","unstructured":"M. Gouda and J. Han, Protocol validation by fair progress state exploration, Computer Networks and ISDN System 9 (1985) 353\u2013361.","journal-title":"Computer Networks and ISDN System"},{"issue":"2","key":"328979_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/spe.4380180203","volume":"18","author":"G.J. Holzmann","year":"1988","unstructured":"G.J. Holzmann, An improved protocol reachability analysis technique, Software Practice and Experience 18(2) (February 1988) 137\u2013161.","journal-title":"Software Practice and Experience"},{"key":"328979_CR6","unstructured":"J. Pachl, Protocol description and analysis based on a state transition model with channel expressions, in: Protocol Specification, Testing, and Verification, Vol. VII, eds. H. Rubin and C.H. West (North-Holland, Amsterdam, 1987) pp. 207\u2013219."},{"issue":"3","key":"328979_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1145\/117009.117015","volume":"13","author":"W. Peng","year":"1991","unstructured":"W. Peng and S. Purushothaman, Data flow analysis of communicating finite state machines, ACM Transactions on Programming Language and Systems 13(3) (1991) 399\u2013442.","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"328979_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF01185558","volume":"29","author":"W. Peng","year":"1992","unstructured":"W. Peng and S. Purushothaman, Analysis of a class of communicating finite state machines, Acta Informatica 29 (1992) 499\u2013522.","journal-title":"Acta Informatica"},{"key":"328979_CR9","unstructured":"W. Peng, Single-link and time communicating finite state machines, in: Proc. of 1994 International Conference on Network Protocols, Boston (October 1994) pp. 126\u2013133."},{"key":"328979_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(85)90033-X","volume":"21","author":"T. R\u00e4uchle","year":"1985","unstructured":"T. R\u00e4uchle and S. Toueg, Exposure to deadlock for communicating processes is hard to detect, Information Processing Letters 21 (1985) 63\u201368.","journal-title":"Information Processing Letters"},{"issue":"2","key":"328979_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0376-5075(82)90029-0","volume":"6","author":"J. Rubin","year":"1982","unstructured":"J. Rubin and C.H. West, An improved protocol validation technique, Computer Networks 6(2) (April 1982) 65\u201373.","journal-title":"Computer Networks"},{"issue":"12","key":"328979_CR12","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.1109\/TCOM.1982.1095450","volume":"30","author":"Y.T. Yu","year":"1982","unstructured":"Y.T. Yu and M.G. Gouda, Deadlock detection for a class of communicating finite-state machines, IEEE Transaction on Communications 30(12) (December 1982) 2514\u20132518.","journal-title":"IEEE Transaction on Communications"},{"key":"328979_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(83)90105-9","volume":"17","author":"Y.T. Yu","year":"1983","unstructured":"Y.T. Yu and M.G. Gouda, Unboundedness detection for a class of communicating finite state machines, Information Processing Letters 17 (1983) 235\u2013240.","journal-title":"Information Processing Letters"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013640918785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013640918785\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013640918785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:05:37Z","timestamp":1747904737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013640918785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["328979"],"URL":"https:\/\/doi.org\/10.1023\/a:1013640918785","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}