{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:29:25Z","timestamp":1742632165369},"reference-count":15,"publisher":"Elsevier BV","issue":"12","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.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0140-3664(97)80190-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"1069-1077","source":"Crossref","is-referenced-by-count":1,"title":["A modular methodology to verify communication protocols"],"prefix":"10.1016","volume":"20","author":[{"given":"Wuxu","family":"Peng","sequence":"first","affiliation":[]},{"given":"Kia","family":"Makki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0140-3664(97)80190-9_BIB1","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":"JACM"},{"issue":"3","key":"10.1016\/S0140-3664(97)80190-9_BIB2","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":"Information and Control"},{"issue":"12","key":"10.1016\/S0140-3664(97)80190-9_BIB3","first-page":"2514","article-title":"Deadlock detection for a class of communicating finite-state machines","volume":"COM-30","author":"Yu","year":"1982","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0140-3664(97)80190-9_BIB4","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)80190-9_BIB5","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)80190-9_BIB6","first-page":"233","article-title":"Protocol validation by random state exploration","volume":"VI","author":"West","year":"1986"},{"issue":"3","key":"10.1016\/S0140-3664(97)80190-9_BIB7","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 Lang. Sys."},{"key":"10.1016\/S0140-3664(97)80190-9_BIB8","first-page":"207","article-title":"Protocol description and analysis based on a state transition model with channel expressions","volume":"VII","author":"Pachl","year":"1987"},{"key":"10.1016\/S0140-3664(97)80190-9_BIB9","first-page":"65","article-title":"An improved protocol validation technique","volume":"6","author":"Rubin","year":"1982","journal-title":"Computer Networks"},{"issue":"1","key":"10.1016\/S0140-3664(97)80190-9_BIB10","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. Sys."},{"key":"10.1016\/S0140-3664(97)80190-9_BIB11","series-title":"Proceedings of the 1994 ACM Annual Conference","first-page":"30","article-title":"A state-transition-based incremental protocol specification","author":"Huang","year":"1994"},{"issue":"9","key":"10.1016\/S0140-3664(97)80190-9_BIB12","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)80190-9_BIB13","series-title":"Proceedings of the Fourth International Conference on Computer Communications and Networks","first-page":"32","article-title":"Reachability problem for cyclic protocols","author":"Liu","year":"1991"},{"key":"10.1016\/S0140-3664(97)80190-9_BIB14","first-page":"242","article-title":"A unified approach to deadlock detection problem in networks of communicating finite state machines","volume":"531","author":"Peng","year":"1991"},{"key":"10.1016\/S0140-3664(97)80190-9_BIB15","series-title":"Proceedings of the Fourth International Conference on Computer Communications and Networks","first-page":"656","article-title":"Deadlock detection in communicating finite state machines by even reachability analysis","author":"Peng","year":"1995"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497801909?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497801909?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:24:56Z","timestamp":1555197896000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497801909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0140366497801909"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)80190-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}