{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:07Z","timestamp":1761611107808},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90095-7","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"305-336","source":"Crossref","is-referenced-by-count":19,"special_numbering":"C","title":["About fair asynchrony"],"prefix":"10.1016","volume":"37","author":[{"given":"Philippe","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90095-7_BIB1","series-title":"8th Ann. ACM Symp. on Principles of Programming Languages","first-page":"164","article-title":"The temporal logic of branching time","author":"Ben-Ari","year":"1981"},{"key":"10.1016\/0304-3975(85)90095-7_BIB2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(85)90095-7_BIB3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF00271640","article-title":"A fair calculus of communicating systems","volume":"21","author":"Costa","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(85)90095-7_BIB4","series-title":"Actes du Congr\u00e9s de l'AFCET 1981","first-page":"127","article-title":"Quelques probl\u00e9mes relatifs \u00e0 la composition parall\u00e9le","author":"Darondeau","year":"1981"},{"key":"10.1016\/0304-3975(85)90095-7_BIB5","series-title":"5th Internat. Symp. on Programming","first-page":"47","article-title":"An enlarged definition and complete axiomatization of observational congruence of finite processes","volume":"137","author":"Darondeau","year":"1982"},{"key":"10.1016\/0304-3975(85)90095-7_BIB6","series-title":"10th Internat. Coll. on Automata, Language and Programming, '83","first-page":"147","article-title":"On the observational semantics of fair parallelism","volume":"154","author":"Darondeau","year":"1983"},{"key":"10.1016\/0304-3975(85)90095-7_BIB7","article-title":"On the observational semantics of fair parallelism","author":"Darondeau","year":"1983","journal-title":"INRIA Rept. No. 262"},{"key":"10.1016\/0304-3975(85)90095-7_BIB8","article-title":"A formal proof system for infinitary rational expressions","author":"Darondeau","year":"1983","journal-title":"INRIA Rept. No. 218"},{"key":"10.1016\/0304-3975(85)90095-7_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(84)90079-6","article-title":"Towards a formal proof system for w = rational expressions","volume":"19","author":"Darondeau","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(85)90095-7_BIB10","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(85)90095-7_BIB11","article-title":"Algebraic Semantics","volume":"99","author":"Guessarian","year":"1981"},{"key":"10.1016\/0304-3975(85)90095-7_BIB12","series-title":"7th Ann. ACM Symposium on Principles of Programming Languages","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980"},{"key":"10.1016\/0304-3975(85)90095-7_BIB13","series-title":"Internat. Coll. on Automata, Languages and Programming '80","first-page":"299","article-title":"On observing nondeterminism and concurrency","volume":"85","author":"Hennessy","year":"1980"},{"key":"10.1016\/0304-3975(85)90095-7_BIB14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0019-9958(83)80029-1","article-title":"Synchronous and asynchronous experiments on processes","volume":"59","author":"Hennesy","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90095-7_BIB15","article-title":"Modelling finite delay operators","author":"Hennessy","year":"1983"},{"key":"10.1016\/0304-3975(85)90095-7_BIB16","article-title":"An algebraic theory of fair asynchronous communicating processes","author":"Hennessy","year":"1984"},{"key":"10.1016\/0304-3975(85)90095-7_BIB17","series-title":"5th Internat. Symp. on Programming","first-page":"242","article-title":"Specification of communicating processes and process implementation correctness","volume":"137","author":"Jorrand","year":"1982"},{"key":"10.1016\/0304-3975(85)90095-7_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","article-title":"Fully abstract models of typed lambda-calculi","volume":"4","author":"Milner","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90095-7_BIB19","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/322154.322167","article-title":"Flowgraphs and flow algebras","volume":"26","author":"Milner","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(85)90095-7_BIB20","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(85)90095-7_BIB21","doi-asserted-by":"crossref","first-page":"267","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\/0304-3975(85)90095-7_BIB22","series-title":"Abstract Software Specifications","first-page":"504","article-title":"On the semantics of fair parallelism","volume":"86","author":"Park","year":"1980"},{"key":"10.1016\/0304-3975(85)90095-7_BIB23","series-title":"IFIP 4th Internat. Workshop on Protocol Specification, Testing and Verification","article-title":"Modelling distributed systems in an extension of C.C.S. with infinite experiments and temporal logics","author":"Parrow","year":"1984"},{"key":"10.1016\/0304-3975(85)90095-7_BIB24","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(85)90095-7_BIB25","series-title":"Denotational Semantics","author":"Stoy","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900957?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900957?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:42Z","timestamp":1553172762000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":25,"alternative-id":["0304397585900957"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90095-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}