{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:34:52Z","timestamp":1649133292254},"reference-count":12,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":["Computer Communications"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/s0140-3664(97)84932-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"668-674","source":"Crossref","is-referenced-by-count":0,"title":["Reachability and reverse reachability analysis of CFSMs"],"prefix":"10.1016","volume":"19","author":[{"given":"Wuxu","family":"Peng","sequence":"first","affiliation":[]},{"given":"Kia","family":"Makki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)84932-8_BIB1","series-title":"Protocol Specification, Testing, and Verification, VI","first-page":"233","article-title":"Protocol validation by random state exploration","author":"West","year":"1986"},{"issue":"2","key":"10.1016\/S0140-3664(97)84932-8_BIB2","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"},{"issue":"3","key":"10.1016\/S0140-3664(97)84932-8_BIB3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0019-9958(84)80014-5","article-title":"On the progress of communication between two finite state machines","volume":"63","author":"Gouda","year":"1984","journal-title":"Infor. and Control"},{"key":"10.1016\/S0140-3664(97)84932-8_BIB4","series-title":"Design and Validation of Computer Protocols","author":"Holzmann","year":"1991"},{"key":"10.1016\/S0140-3664(97)84932-8_BIB5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF01185558","article-title":"Analysis of a class of communicating finite state machines","volume":"29","author":"Peng","year":"1992","journal-title":"Acta Informatica"},{"issue":"2","key":"10.1016\/S0140-3664(97)84932-8_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/spe.4380180203","article-title":"An improved protocol reachability analysis technique","volume":"18","author":"Holzmann","year":"1988","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S0140-3664(97)84932-8_BIB7","first-page":"65","article-title":"An improved protocol validation technique","volume":"6","author":"Rubin","year":"1982","journal-title":"Computer Networks"},{"issue":"3","key":"10.1016\/S0140-3664(97)84932-8_BIB8","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/117009.117015","article-title":"Data flow analysis of communicating finite state machines","volume":"13","author":"Peng","year":"1991","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"9","key":"10.1016\/S0140-3664(97)84932-8_BIB9","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1002\/spe.4380230904","article-title":"Reverse reachability analysis: a new technique for deadlock detection on communicating finite state machines","volume":"23","author":"Hung","year":"1993","journal-title":"Software Practice and Experience"},{"key":"10.1016\/S0140-3664(97)84932-8_BIB10","series-title":"Proc. ACM Annual Conf.","first-page":"30","article-title":"A state-transitionbased incremental protocol specification","author":"Huang","year":"1994"},{"key":"10.1016\/S0140-3664(97)84932-8_BIB11","first-page":"243","article-title":"A unified approach to deadlock detection problem in networks of communicating finite state machines: LNCS 531","author":"Peng","year":"1991"},{"issue":"1","key":"10.1016\/S0140-3664(97)84932-8_BIB12","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1145\/5001.5002","article-title":"Proving liveness for networks of communicating finite state machines","volume":"8","author":"Gouda","year":"1986","journal-title":"ACM Trans. Programming Lang. and Sys."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497849328?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497849328?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:23:22Z","timestamp":1555212202000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497849328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":12,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["S0140366497849328"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)84932-8","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}