{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:29:23Z","timestamp":1742632163684},"reference-count":23,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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,9]]},"DOI":"10.1016\/s0140-3664(97)00075-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"772-788","source":"Crossref","is-referenced-by-count":18,"title":["Protocol validation by simultaneous reachability analysis"],"prefix":"10.1016","volume":"20","author":[{"given":"Kadir","family":"\u00d6zdemir","sequence":"first","affiliation":[]},{"given":"Hasan","family":"Ural","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00075-3_BIB1","first-page":"361","article-title":"Finite state description of communication protocols","volume":"2","author":"Bochmann","year":"1978","journal-title":"Computer Networks"},{"issue":"2A","key":"10.1016\/S0140-3664(97)00075-3_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"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB3","series-title":"ACM SIGCOMM'83","first-page":"167","article-title":"A decomposition method for the analysis and design of finite state protocols","author":"Choi","year":"1983"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB4","first-page":"283","article-title":"A new class of analyzable CFSMs with unbounded fifo channels","volume":"VIIL","author":"Finkel","year":"1988"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TCOM.1984.1095950","article-title":"Protocol validation by maximal progress state exploration","volume":"COM-32","author":"Gouda","year":"1984","journal-title":"IEEE Trans. on Commun."},{"key":"10.1016\/S0140-3664(97)00075-3_BIB6","first-page":"353","article-title":"Protocol validation by fair progress state exploration","volume":"9","author":"Gouda","year":"1985","journal-title":"Computer Networks"},{"issue":"2","key":"10.1016\/S0140-3664(97)00075-3_BIB7","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"},{"issue":"2","key":"10.1016\/S0140-3664(97)00075-3_BIB8","first-page":"88","article-title":"Protocol verification using reduced reachability analysis","volume":"E66","author":"Itoh","year":"1983","journal-title":"The Trans. on the IECE of Japan"},{"issue":"5","key":"10.1016\/S0140-3664(97)00075-3_BIB9","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/55483.55496","article-title":"Protocol verification using reachability analysis: The state explosion problem and relief strategies","volume":"17","author":"Lin","year":"1987","journal-title":"Computer Communication Review"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB10","first-page":"258","article-title":"Generalized fair reachability analysis for cyclic protocols: part 1, Protocol Specfication","volume":"XIV","author":"Liu","year":"1994"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB11","first-page":"307","article-title":"Probabilistic verification of communication protocols","volume":"VII","author":"Maxemchuk","year":"1987"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB12","first-page":"209","article-title":"Protocol description and analysis based on a state transition model with channel expression","volume":"VII","author":"Pachl","year":"1987"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB13","series-title":"CAV'90","first-page":"243","article-title":"A unified approach to the deadlock detection problem in networks of communicating finite state machines","volume":"vol. 531","author":"Peng","year":"1990"},{"issue":"4","key":"10.1016\/S0140-3664(97)00075-3_BIB14","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1109\/12.88466","article-title":"Synthesis of communicating protocols: survey and assesment","volume":"40","author":"Probert","year":"1991","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB15","first-page":"65","article-title":"An improved protocol validation technique","volume":"6","author":"Rubin","year":"1982","journal-title":"Computer Networks"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB16","first-page":"283","article-title":"Protocol design rules","volume":"II","author":"Sidhu","year":"1982"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB17","series-title":"INFOCOM'82","first-page":"209","article-title":"A decomposition method for the validation of structured protocols","author":"Vuong","year":"1982"},{"issue":"1","key":"10.1016\/S0140-3664(97)00075-3_BIB18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1147\/rd.224.0393","article-title":"General technique for communications protocol validation","volume":"22","author":"West","year":"1978","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0140-3664(97)00075-3_BIB19","first-page":"233","article-title":"Protocol verification by random state exploration","volume":"VI","author":"West","year":"1986"},{"key":"10.1016\/S0140-3664(97)00075-3_BIB20","series-title":"Proc. NBS Computer Networking Symposium","first-page":"164","article-title":"Survey of protocol verification techniques based on finite state machine models","author":"Yuang","year":"1988"},{"issue":"12","key":"10.1016\/S0140-3664(97)00075-3_BIB21","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 Trans. on Commun."},{"issue":"8","key":"10.1016\/S0140-3664(97)00075-3_BIB22","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1109\/TCOM.1978.1094227","article-title":"Protocol validation by duologue-matrix analysis","volume":"COM-26","author":"Zafiropulo","year":"1978","journal-title":"IEEE Trans. on Commun."},{"issue":"3","key":"10.1016\/S0140-3664(97)00075-3_BIB23","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/32.4659","article-title":"An interactive synthesis algorithm using a global state transition graph","volume":"14","author":"Zang","year":"1988","journal-title":"IEEE Trans. on Soft. Eng."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000753?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:39Z","timestamp":1555197879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":23,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0140366497000753"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00075-3","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}