{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:00:00Z","timestamp":1648573200843},"reference-count":21,"publisher":"Elsevier BV","issue":"1-5","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0165-6074(90)90287-j","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:14:48Z","timestamp":1062609288000},"page":"485-490","source":"Crossref","is-referenced-by-count":0,"title":["Constructing real-time multi-channel protocols"],"prefix":"10.1016","volume":"30","author":[{"given":"M.","family":"Kapus-Kolar","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"no. 8","key":"10.1016\/0165-6074(90)90287-J_BIB1","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1109\/32.7616","article-title":"An acyclic expansion algorithm for fast protocol validation","volume":"vol. SE-14","author":"Kakuda","year":"1988","journal-title":"IEEE Trans. Software Eng."},{"issue":"no. 11","key":"10.1016\/0165-6074(90)90287-J_BIB2","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/32.41341","article-title":"On conditions for defining a closed cover to verify progress for communicating finite state machines","volume":"vol. SE-15","author":"Chung","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"issue":"no. 9","key":"10.1016\/0165-6074(90)90287-J_BIB3","first-page":"940","article-title":"An algorithmic procedure for checking safety properties of protocols","volume":"vol. SE-37","author":"Sabnani","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0165-6074(90)90287-J_BIB4","series-title":"Proc. 9th Int. Symp. Protocol Specification, Testing, and Verification","article-title":"Parallel protocol verification using the localized approach: the two-phase algorithm","author":"Yuang","year":"1989"},{"issue":"no. 2","key":"10.1016\/0165-6074(90)90287-J_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"vol. 30","author":"Brand","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0165-6074(90)90287-J_BIB6","series-title":"Protocol Specification, Testing, and Verification, III","first-page":"63","article-title":"An example for constructing communicating machines by step-wise refinement","author":"Gouda","year":"1983"},{"key":"10.1016\/0165-6074(90)90287-J_BIB7","series-title":"Protocol Specification, Testing, and Verification, IV","first-page":"57","article-title":"On construction of multi-phase protocols","author":"Chow","year":"1984"},{"issue":"no. 7","key":"10.1016\/0165-6074(90)90287-J_BIB8","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1109\/TCOM.1984.1096134","article-title":"Synthesis of communicating finite-state machines with guaranteed progress","volume":"vol. COM-32","author":"Gouda","year":"1984","journal-title":"IEEE Trans. Comm."},{"issue":"no. 9","key":"10.1016\/0165-6074(90)90287-J_BIB9","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1109\/TSE.1985.232547","article-title":"An implementation of an automated protocol synthesizer (APS) and its application to the X.21 protocol","volume":"vol. SE-11","author":"Ramamoorthy","year":"1985","journal-title":"IEEE Trans. Software Eng."},{"issue":"no. 11","key":"10.1016\/0165-6074(90)90287-J_BIB10","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1109\/32.9045","article-title":"Constructing submodule specifications and network protocols","volume":"vol. SE-14","author":"Sidhu","year":"1988","journal-title":"IEEE Trans. Software Eng."},{"issue":"no. 3","key":"10.1016\/0165-6074(90)90287-J_BIB11","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/32.4659","article-title":"An interactive protocol synthesis algorithm using a global state transition graph","volume":"vol. SE-14","author":"Zhang","year":"1988","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0165-6074(90)90287-J_BIB12","series-title":"Proc. SIGCOMM'89","first-page":"136","article-title":"New results on deriving protocol specifications from service specifications","author":"Khendek","year":"1989"},{"key":"10.1016\/0165-6074(90)90287-J_BIB13","unstructured":"M. Kapus-Kolar, \u201cConstructing communication protocols on reliable bounded FIFO channels without overspecification,\u201d presented at EUROMICRO '89, to be published in a special issue of Microprocessing and Microprogramming."},{"key":"10.1016\/0165-6074(90)90287-J_BIB14","unstructured":"M. Kapus-Kolar, \u201cConstructing two-party multi-channel protocols,\u201d submitted to IEEE Trans. Software Eng."},{"key":"10.1016\/0165-6074(90)90287-J_BIB15","unstructured":"R. Gotzhein and G. v. Bochmann, \u201cDeriving protocol specifications from service specifications including parameters,\u201d to be published in ACM TOPLAS."},{"key":"10.1016\/0165-6074(90)90287-J_BIB16","article-title":"A Calculus of Communicating Systems","volume":"vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0165-6074(90)90287-J_BIB17","series-title":"Protocol Specification, Testing, and Verification, VI","first-page":"387","article-title":"Real-time coordination of concurrent activities","author":"Aggarwall","year":"1987"},{"issue":"no. 4","key":"10.1016\/0165-6074(90)90287-J_BIB18","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"vol. 32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0165-6074(90)90287-J_BIB19","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0169-7552(86)90042-5","article-title":"Protocol Analysis and synthesis by structured partitions","volume":"vol. 11","author":"Choi","year":"1986","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/0165-6074(90)90287-J_BIB20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for Synchrony and Asynchrony","volume":"vol. 25","author":"Milner","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0165-6074(90)90287-J_BIB21","series-title":"Protocol Specification, Testing, and Verification, VII","first-page":"105","article-title":"Introduction of quantitative relative time into LOTOS","author":"Quemada","year":"1987"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749090287J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749090287J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:00:45Z","timestamp":1551088845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749090287J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":21,"journal-issue":{"issue":"1-5","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["016560749090287J"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(90)90287-j","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}