{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:16:33Z","timestamp":1648980993336},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7594,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0167-6423(92)90003-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"25-59","source":"Crossref","is-referenced-by-count":1,"title":["Communication relations: a paradigm for parallel program design"],"prefix":"10.1016","volume":"19","author":[{"given":"Guy-Ren\u00e9","family":"Perrin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Finance","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0167-6423(92)90003-T_BIB1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/357103.357110","article-title":"A proof system for communicating sequential processes","volume":"2","author":"Apt","year":"1980","journal-title":"ACM Trans. Programming Languages Syst."},{"issue":"7","key":"10.1016\/0167-6423(92)90003-T_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/359636.359715","article-title":"LUCID: a non procedural language with iterations","volume":"20","author":"Ashcroft","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(92)90003-T_BIB3","first-page":"115","article-title":"Stepwise refinement of action systems","volume":"375","author":"Back","year":"1989"},{"key":"10.1016\/0167-6423(92)90003-T_BIB4","article-title":"An Introduction to the Theory of Lists","volume":"PRG-56","author":"Bird","year":"1986"},{"key":"10.1016\/0167-6423(92)90003-T_BIB5","article-title":"LUSTRE: a declarative language for programming synchronous systems","volume":"215","author":"Caspi","year":"1987"},{"key":"10.1016\/0167-6423(92)90003-T_BIB6","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/BF00263648","article-title":"A functional model for describing and reasoning about time behaviour of computer systems","volume":"22","author":"Caspi","year":"1986","journal-title":"Acta Inform."},{"issue":"11","key":"10.1016\/0167-6423(92)90003-T_BIB7","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1145\/358690.358717","article-title":"Distributed computations on graphs: shortest path algorithms","volume":"25","author":"Chandy","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(92)90003-T_BIB8","series-title":"Parallel Program Design: A Foundation","author":"Chandy","year":"1988"},{"issue":"6","key":"10.1016\/0167-6423(92)90003-T_BIB9","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/TSE.1983.235434","article-title":"Formal specification and verification of distributed systems","volume":"9","author":"Chen","year":"1983","journal-title":"IEEE Trans. on Software Engrg."},{"key":"10.1016\/0167-6423(92)90003-T_BIB10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF00289575","article-title":"Concurrent algorithms for root searching","volume":"18","author":"Eriksen","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(92)90003-T_BIB11","series-title":"Research Report","article-title":"Towards a methodology to specify and construct concurrent programs","author":"Finance","year":"1980"},{"key":"10.1016\/0167-6423(92)90003-T_BIB12","series-title":"Thesis","article-title":"M\u00e9thode progressive de synth\u00e9se et de v\u00e9rification de programmes parall\u00e9les","author":"Gribomont","year":"1985"},{"key":"10.1016\/0167-6423(92)90003-T_BIB13","series-title":"Research Report","article-title":"Stepwise refinement and concurrency: the finite state case","author":"Gribomont","year":"1990"},{"key":"10.1016\/0167-6423(92)90003-T_BIB14","article-title":"Knowledge and common knowledge in a distributed environment","author":"Halpern","year":"1984","journal-title":"Proceedings Third Conference on Principles of Distributed Computing"},{"key":"10.1016\/0167-6423(92)90003-T_BIB15","series-title":"Logic and Models of Concurrent Systems","article-title":"On the development of reactive systems","author":"Harel","year":"1985"},{"issue":"8","key":"10.1016\/0167-6423(92)90003-T_BIB16","doi-asserted-by":"crossref","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(92)90003-T_BIB17","series-title":"IFIP 1974","article-title":"the semantics of a simple language for parallel programming","author":"Kahn","year":"1974"},{"issue":"7","key":"10.1016\/0167-6423(92)90003-T_BIB18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of paprallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0167-6423(92)90003-T_BIB19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/78942.78945","article-title":"An exercise in the formal derivation of paprallel programs: maximum flows in graphs","volume":"12","author":"Knapp","year":"1990","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(92)90003-T_BIB20","article-title":"The structure of parallel algorithms","volume":"19","author":"Kung","year":"1976"},{"issue":"2","key":"10.1016\/0167-6423(92)90003-T_BIB21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","article-title":"Specifying concurrent program modules","volume":"5","author":"Lamport","year":"1983","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(92)90003-T_BIB22","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6423(82)90003-X","article-title":"A methodology for programming with concurrency: the formalism","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(92)90003-T_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(82)90002-8","article-title":"A methodology for programming with concurrency: an informal presentation","volume":"2","author":"Lengauer","year":"1982","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(92)90003-T_BIB24","series-title":"Information Processing","first-page":"307","article-title":"Correctness preserving transformations for distributed programs","author":"Mahadevan","year":"1983"},{"issue":"1","key":"10.1016\/0167-6423(92)90003-T_BIB25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/357233.357237","article-title":"Synthesis of communicating processes from temporal logic specifications","volume":"6","author":"Manna","year":"1984","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(92)90003-T_BIB26","article-title":"A Calculus for Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0167-6423(92)90003-T_BIB27","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(92)90003-T_BIB28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","article-title":"specification oriented semantics for communicating processes","volume":"23","author":"Olderog","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(92)90003-T_BIB29","series-title":"Thesis","article-title":"La communication: un outil pour la sp\u00e9cification, la construction et la v\u00e9rification de syst\u00e9mes parall\u00e9les","author":"Perrin","year":"1985"},{"key":"10.1016\/0167-6423(92)90003-T_BIB30","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","article-title":"The temporal semantics of concurrent programs","volume":"13","author":"Pnueli","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(92)90003-T_BIB31","year":"1985","journal-title":"Proceedings Parallel Computing"},{"key":"10.1016\/0167-6423(92)90003-T_BIB32","first-page":"337","article-title":"Principles for distributing programs","volume":"70","author":"Sintzoff","year":"1979"},{"key":"10.1016\/0167-6423(92)90003-T_BIB33","article-title":"Completeness and incompleteness of trace-based network proof system","volume":"215","author":"Widom","year":"1987"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290003T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239290003T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:56Z","timestamp":1555077296000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239290003T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["016764239290003T"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(92)90003-t","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}