{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:26:28Z","timestamp":1648855588227},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0304-3975(92)90041-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"311-334","source":"Crossref","is-referenced-by-count":2,"title":["The N U system as a development system for concurrent programs: \u03b4 N U"],"prefix":"10.1016","volume":"94","author":[{"given":"Dominique","family":"M\u00e9ry","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0304-3975(92)90041-D_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(84)90067-7","article-title":"Alg\u00e8bre de processus et synchronisation","volume":"30","author":"Austry","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90041-D_BIB2","series-title":"Temporal Logics and their Applications","first-page":"53","author":"Barringer","year":"1987"},{"key":"10.1016\/0304-3975(92)90041-D_BIB3","series-title":"Rapport de Recherche 885","article-title":"Towards a lambda-calculus for concurrent and communicating systems","author":"Boudol","year":"1988"},{"key":"10.1016\/0304-3975(92)90041-D_BIB4","series-title":"Parallel Program Design. A Foundation","author":"Chandy","year":"1988"},{"key":"10.1016\/0304-3975(92)90041-D_BIB5","series-title":"FAIRNESS","article-title":"Texts and Monographs in Computer Science","author":"Francez","year":"1986"},{"key":"10.1016\/0304-3975(92)90041-D_BIB6","article-title":"The power of constructive framework for program synthesis","author":"Galmiche","year":"1988","journal-title":"COLOG 88\u2014Internat. Conf. on Computer Logic"},{"key":"10.1016\/0304-3975(92)90041-D_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90041-D_BIB8","series-title":"Mathematics of Program Construction","first-page":"219","article-title":"Stepwise refinement and concurrency: a small exercise","volume":"Vol. 375","author":"Gribomont","year":"1989"},{"key":"10.1016\/0304-3975(92)90041-D_BIB9","series-title":"First Order Dynamic Logics","volume":"Vol. 68","author":"Harel","year":"1979"},{"key":"10.1016\/0304-3975(92)90041-D_BIB10","series-title":"WG2.2, Formal Techniques and Concepts","article-title":"Fairness assumptions for CSP in a temporal logic framework","author":"Kuiper","year":"1982"},{"key":"10.1016\/0304-3975(92)90041-D_BIB11","series-title":"Proc. 8th ICALP","article-title":"Impartiality, justice and fairness: the ethics of concurrent termination","author":"Lehman","year":"1981"},{"key":"10.1016\/0304-3975(92)90041-D_BIB12","series-title":"Proc. 4th School on Advanced Programming","first-page":"163","article-title":"Verification of concurrent programs: a temporal proof system","author":"Manna","year":"1982"},{"key":"10.1016\/0304-3975(92)90041-D_BIB13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","article-title":"Synthesis of communicating processes from temporal logic specifications","volume":"6","author":"Manna","year":"1984","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(92)90041-D_BIB14","series-title":"Computer Science Logic CSL'89","article-title":"A natural reformulation of unity logics: the N U system","author":"M\u00e9ry","year":"1989"},{"key":"10.1016\/0304-3975(92)90041-D_BIB15","series-title":"Research Report CRIN-89-R-205","article-title":"On the fair semantics of unity programs","author":"M\u00e9ry","year":"1989"},{"key":"10.1016\/0304-3975(92)90041-D_BIB16_1","series-title":"Tech. Report ECS-LFCS-87-7","article-title":"A calculus of communicating systems","author":"Milner","year":"1986"},{"key":"10.1016\/0304-3975(92)90041-D_BIB16_2","article-title":"A calculus of communicating sytems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(92)90041-D_BIB17","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\/0304-3975(92)90041-D_BIB18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","article-title":"An axiomatic proof technique for parallel programs i","volume":"6","author":"Owicki","year":"1976","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/0304-3975(92)90041-D_BIB19","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","article-title":"Proving liveness properties of concurrent programs","volume":"4","author":"Owicki","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(92)90041-D_BIB20","series-title":"Research Report DAIMI FN-19","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(92)90041-D_BIB21","series-title":"Proc. 18th IEEE Symp. on Foundations of Computer Science","first-page":"46","article-title":"The temporal logics of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0304-3975(92)90041-D_BIB22","series-title":"Proc. 13th Internat. Colloq. Automata, Languages and Programming","first-page":"407","article-title":"A compositional reformulation of Owicki and Gries's partial correctness logic for a concurrent while language","volume":"Vol. 226","author":"Stirling","year":"1986"},{"issue":"1\u20132","key":"10.1016\/0304-3975(92)90041-D_BIB23","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","article-title":"Temporal logic can be more expressive","volume":"56","author":"Wolper","year":"1983","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290041D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290041D?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:57:16Z","timestamp":1555077436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290041D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["030439759290041D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90041-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}