{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:27Z","timestamp":1760202507541},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0890-5401(89)90004-7","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"278-322","source":"Crossref","is-referenced-by-count":17,"title":["The \u03bc-calculus as an assertion-language for fairness arguments"],"prefix":"10.1016","volume":"82","author":[{"given":"F.A.","family":"Stomp","sequence":"first","affiliation":[]},{"given":"W.P.","family":"de Roever","sequence":"additional","affiliation":[]},{"given":"R.T.","family":"Gerth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 4","key":"10.1016\/0890-5401(89)90004-7_bib1","doi-asserted-by":"crossref","DOI":"10.1145\/6490.6494","article-title":"Countable Nondeterminism and Random Assignment","volume":"33","author":"Apt","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(89)90004-7_bib2","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(84)90103-8","article-title":"Fair termination revisited\u2014With delay","volume":"33","author":"Apt","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90004-7_bib3","author":"de Bakker","year":"1980"},{"key":"10.1016\/0890-5401(89)90004-7_bib4","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0890-5401(89)90004-7_bib5","series-title":"Proceedings, Symposium on Algorithmic Languages","article-title":"A proof rule for fair termination of guarded commands","author":"Gr\u00fcmberg","year":"1981"},{"key":"10.1016\/0890-5401(89)90004-7_bib6","series-title":"Proceedings, ICALP I","article-title":"Induction rules and termination","author":"Hitchcock","year":"1973"},{"key":"10.1016\/0890-5401(89)90004-7_bib7","series-title":"Proceedings, ICALP VII","article-title":"Impartiality, justness and fairness: The ethics of concurrent termination","volume":"Vol. 115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0890-5401(89)90004-7_bib8","series-title":"Foundations of Computer Science IV, Part 2","article-title":"Verification on concurrent programs: A temporal proof-system","volume":"Vol. 159","author":"Manna","year":"1983"},{"key":"10.1016\/0890-5401(89)90004-7_bib9","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0890-5401(89)90004-7_bib10","series-title":"Proceedings, 6th IBM Symposium on Math. Found. of Computer Science","article-title":"A predicate transformer for weak fair iteration","author":"Park","year":"1981"},{"key":"10.1016\/0890-5401(89)90004-7_bib11","series-title":"Proceedings, Copenhagen Winterschool on Abstract Software Specification","article-title":"On the semantics of fair parallelism","volume":"Vol. 86","author":"Park","year":"1980"},{"key":"10.1016\/0890-5401(89)90004-7_bib12","article-title":"Fixed point induction and proof of program properties","volume":"5","author":"Park","year":"1969","journal-title":"Mach. Intell."},{"key":"10.1016\/0890-5401(89)90004-7_bib13","series-title":"Proceedings, Workshop on Programming Logics","article-title":"A formalism for reasoning about fair termination","volume":"Vol. 131","author":"de Roever","year":"1981"},{"key":"10.1016\/0890-5401(89)90004-7_bib14","doi-asserted-by":"crossref","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixed point theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0890-5401(89)90004-7_bib15","article-title":"First-Order Dynamic Logic","volume":"Vol. 68","author":"Harel","year":"1979"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900047?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900047?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:26:45Z","timestamp":1549027605000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0890540189900047"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90004-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}