{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:02:08Z","timestamp":1648990928452},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0164-1212(97)00013-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:26:53Z","timestamp":1027621613000},"page":"29-50","source":"Crossref","is-referenced-by-count":0,"title":["Applying a new decomposition method to verify communication protocols"],"prefix":"10.1016","volume":"40","author":[{"given":"R.","family":"Lai","sequence":"first","affiliation":[]},{"given":"X.","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(97)00013-7_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/32.4651","article-title":"PROTEAN: A High-level Petri Net Tool for the Specification and Verification of Communication Protocols","author":"Billington","year":"1988","journal-title":"IEEE Transaction on Software Engineering"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB2","series-title":"Proceedings of the 3rd International Workshop on Computer Aided Verification","article-title":"Using Partial Orders for Efficient Verification of Deadlock Freedom and Safety Properties","volume":"Vol. 575","author":"Godefroid","year":"1992"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB3","doi-asserted-by":"crossref","DOI":"10.1145\/1024840.1035255","article-title":"Maximal Progress State Exploration","volume":"volume 13","author":"Gouda","year":"1983","journal-title":"Computer Communication Review"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1984.5010313","article-title":"Closed Covers: To Verify Progress of Communicating Finite State Machines","volume":"volume SE-10","author":"Gouda","year":"1984","journal-title":"IEEE Trans. on Software Engineering"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0169-7552(85)90086-8","article-title":"Protocol Validation By Fair Progress State Exploration","volume":"volume 9","author":"Gouda","year":"1985","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB6","article-title":"Information Processing Systems\u2014Open Systems Interconnection\u2014Service Definition for the Association Control Service Element","author":"ISO","year":"1988","journal-title":"ISO 8649"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB7","article-title":"Information Processing Systems\u2014Open Systems Interconnection\u2014Protocol Specification for the Association Control Service Element","author":"ISO","year":"1988","journal-title":"ISO 8650"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB8","first-page":"71","article-title":"The Pandora System\u2014An Interactive System for the Design of Data Communication Protocols","volume":"volume 8","author":"Holzmann","year":"1984","journal-title":"Computer Networks"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB9","first-page":"137","article-title":"An Improved Protocol Reachability Analysis Technique","volume":"volume 18","author":"Holzmann","year":"1988"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB10","first-page":"88","article-title":"Protocol Verification Algorithm Using Reduced Reachability Analysis","volume":"volume E66","author":"Itoh","year":"1983","journal-title":"IECE Transactions on Communications"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB11","series-title":"Proceedings of the Workshop on Automatic Verification, Methods for Finite State Systems","article-title":"On-line Model-checking for Finite Linear Temporal Logic Specifications","volume":"Vol. 407","author":"Jard","year":"1990"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB12","series-title":"Proceedings of IEEE COMPSAC","article-title":"A New Algorithm for Fast Protocol Validation","author":"Kakuda","year":"1986"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB13","article-title":"Verification Results for ISO FTAM Basic Protocol","volume":"IX","author":"Lai","year":"1990"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB14","series-title":"Verification of ISO ACSE protocol specified in Estelle","author":"Lai","year":"1994"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB15","doi-asserted-by":"crossref","DOI":"10.1177\/003754979506500505","article-title":"Simulation and Verification of Protocol Using Deductive Machine","author":"Lai","year":"1995","journal-title":"SIMULATION, Journal of the Society for Computer Simulation"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB16","series-title":"IEEE Transactions on Software Engineering","article-title":"Protocol Verification via Projections","author":"Lam","year":"1984"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB17","series-title":"Proceedings of the 4th International Conference on Computer and Information","article-title":"Theory of Deductive Systems for Protocol Verification","author":"Li","year":"1992"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB18","series-title":"Proceedings of the Singapore International Conference on Networks and International Conference on Information Engineering '93","article-title":"Modelling Communication Protocols Using Deductive Systems","author":"Li","year":"1993"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB19","series-title":"Proceedings of the 5th International Conference on Computing and Information","article-title":"A New Decomposition Method to Relieve the State Space Explosion Problem","author":"Li","year":"1993"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB20","series-title":"Proceedings of the 26th Southeastern Symposium on System Theory","article-title":"An Improved Decomposition Approach to Reachability Analysis","author":"Li","year":"1994"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB21","doi-asserted-by":"crossref","DOI":"10.1145\/55483.55496","article-title":"Protocol Verification Using Reachability Analysis: The state space Explosion Problem and Relief Strategies","author":"Lin","year":"1987"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB22","author":"Maslov","year":"1987"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB23","article-title":"Probability Verification of Communication Protocols","volume":"VII","author":"Maxemchuk","year":"1987"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB24","author":"Mendelson","year":"1979"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB25","author":"Peterson","year":"1981"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB26","doi-asserted-by":"crossref","DOI":"10.2307\/2371809","article-title":"Formal Reduction of the General Combinatorial Decision Problem","author":"Post","year":"1943","journal-title":"American Journal of Mathematics"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB27","article-title":"An Improved Protocol Validation Technique","author":"Rudin","year":"1982","journal-title":"Computer Networks"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB28","series-title":"Proceedings of the 7th International Conference on Computer Communications","article-title":"Evaluation of Protocol Verification Techniques","author":"Sajkowski","year":"1984"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB29","series-title":"Advances in Petri Nets","article-title":"Stubborn Sets for Reduced state Space Generation","author":"Valmari","year":"1990"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB30","article-title":"An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm","volume":"XI","author":"Valmari","year":"1992"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB31","series-title":"Proceedings of 5th International Conference on Computer-Aided Verification","article-title":"On-the-fly Verification with Stubborn Sets","volume":"Vol. 697","author":"Valmari","year":"1993"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB32","article-title":"VALIRA\u2014A Tool for Protocol Validation Via Reachability Analysis","volume":"XI","author":"Vuong","year":"1987"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB33","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1147\/rd.224.0393","article-title":"General Technique for Communication Protocol Validation","author":"West","year":"1978","journal-title":"IBM Journal on Research and Development"},{"key":"10.1016\/S0164-1212(97)00013-7_BIB34","article-title":"Parallel Protocol Verification: The Two-Phase Algorithm","volume":"IX","author":"Yuang","year":"1990"},{"issue":"8","key":"10.1016\/S0164-1212(97)00013-7_BIB35","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1978.1094227","article-title":"Protocol Validation by Dulogue-Matrix Analysis","volume":"COM-26","author":"Zafiropulo","year":"1978","journal-title":"IEEE Transactions on Communications"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121297000137?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121297000137?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T16:40:43Z","timestamp":1580229643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121297000137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0164121297000137"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(97)00013-7","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}