{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T10:55:24Z","timestamp":1672916124110},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1016\/0020-0190(87)90001-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"165-171","source":"Crossref","is-referenced-by-count":12,"title":["Two normal form theorems for CSP programs"],"prefix":"10.1016","volume":"26","author":[{"given":"K.R.","family":"Apt","sequence":"first","affiliation":[]},{"given":"Luc","family":"Boug\u00e9","sequence":"additional","affiliation":[]},{"given":"Ph.","family":"Clermont","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(87)90001-9_BIB1","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1145\/5956.6000","article-title":"Correctness proofs of distributed termination algorithms","volume":"8","author":"Apt","year":"1986","journal-title":"ACM Trans. Programm. Languages & Systems"},{"key":"10.1016\/0020-0190(87)90001-9_BIB2","series-title":"Rept. No. RC 10975","article-title":"Two Normal Form Theorems for CSP Programs","author":"Apt","year":"1985"},{"key":"10.1016\/0020-0190(87)90001-9_BIB3","series-title":"Proc. Internat. Summer School on Control Flow and Data Flow: Concepts of Distributed Programming","article-title":"Real time clocks versus virtual clocks","volume":"F14","author":"Apt","year":"1985"},{"key":"10.1016\/0020-0190(87)90001-9_BIB4","article-title":"Genericity and Symmetry for Distributed Systems: The Case of CSP","volume":"7","author":"Boug\u00e9","year":"1987"},{"issue":"1","key":"10.1016\/0020-0190(87)90001-9_BIB5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM Trans. Programm. Languages & Systems"},{"key":"10.1016\/0020-0190(87)90001-9_BIB6","series-title":"Proc. Internat. Coll. on Formalization of Programming Concepts","article-title":"Distributed termination with interval assertion","volume":"Vol. 107","author":"Francez","year":"1981"},{"issue":"6","key":"10.1016\/0020-0190(87)90001-9_BIB7","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/TSE.1984.5010313","article-title":"Closed covers: To verify progress for communicating finite state machines","volume":"SE-10","author":"Gouda","year":"1984","journal-title":"IEEE Trans. Software Engrg."},{"issue":"7","key":"10.1016\/0020-0190(87)90001-9_BIB8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/358886.358892","article-title":"On folk theorems","volume":"23","author":"Harel","year":"1980","journal-title":"Comm. ACM"},{"issue":"8","key":"10.1016\/0020-0190(87)90001-9_BIB9","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0020-0190(87)90001-9_BIB10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/322077.322088","article-title":"Some properties of predicate transformers","volume":"25","author":"Hoare","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(87)90001-9_BIB11","series-title":"Formal Description of Programming Concepts","first-page":"199","article-title":"An operational semantics for CSP","author":"Plotkin","year":"1983"},{"key":"10.1016\/0020-0190(87)90001-9_BIB12","article-title":"Specification and verification of concurrent systems in CESAR","author":"Queille","year":"1981","journal-title":"Proc. 5th Internat. Symp. on Programming"},{"key":"10.1016\/0020-0190(87)90001-9_BIB13","article-title":"Normal Form Transformations for Programs in CSP","author":"Z\u00f6bel","year":"1987","journal-title":"Rept., EWH Rhld.-Pf."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087900019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:53:14Z","timestamp":1555073594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087900019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0020019087900019"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90001-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}