{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:39:53Z","timestamp":1770737993236,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11885,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["MCS77-15628"],"award-info":[{"award-number":["MCS77-15628"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["W1689"],"award-info":[{"award-number":["W1689"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006751","name":"U.S. Army","doi-asserted-by":"publisher","award":["OAAG29-79-G 0155"],"award-info":[{"award-number":["OAAG29-79-G 0155"]}],"id":[{"id":"10.13039\/100006751","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0304-3975(81)90109-2","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"17-43","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":54,"title":["On describing the behavior and implementation of distributed systems"],"prefix":"10.1016","volume":"13","author":[{"given":"Nancy A.","family":"Lynch","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Fischer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(81)90109-2_BIB1","series-title":"AI Memo 438","article-title":"Specification and proof techniques for serializers","author":"Atkinson","year":"1977"},{"key":"10.1016\/0304-3975(81)90109-2_BIB2","article-title":"Shared data requirements for implementation of mutual exclusion using a test-and-set primitive","author":"Burns","year":"1978","journal-title":"Proc 1978 International Conference on Parallel Processing"},{"key":"10.1016\/0304-3975(81)90109-2_BIB16","unstructured":"see also, Data requirements for implementation of N-process mutual exclusion using a single shared variable, GIT-ICS-79\/02, to appear in J. ACM"},{"key":"10.1016\/0304-3975(81)90109-2_BIB3","article-title":"The specification of process synchronization using path expressions","volume":"16","author":"Campbell","year":"1974"},{"key":"10.1016\/0304-3975(81)90109-2_BIB4","article-title":"Computable nondeterministic functions","author":"Chandra","year":"1978","journal-title":"Proc. 19th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(81)90109-2_BIB5","article-title":"Mutual exclusion of N processes using O(N)-valued message variable","author":"Cremers","year":"1975","journal-title":"USC Department of Computer Science"},{"key":"10.1016\/0304-3975(81)90109-2_BIB6","series-title":"Programming Language","article-title":"Co-operating sequential process","author":"Dijkstra","year":"1968"},{"key":"10.1016\/0304-3975(81)90109-2_BIB7","series-title":"TR 26","article-title":"Synchronizing distant cooperating processes","author":"Feldman","year":"1977"},{"key":"10.1016\/0304-3975(81)90109-2_BIB8","article-title":"Resource allocation with immunity to limited process failure","author":"Fischer","year":"1979","journal-title":"Proc. 20th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(81)90109-2_BIB9","series-title":"Technical Report","article-title":"Communicating sequential processes","author":"Hoare","year":"1976"},{"key":"10.1016\/0304-3975(81)90109-2_BIB10","first-page":"70","article-title":"Fast allocation of nearby resources in a distributed system","author":"Lynch","year":"1980","journal-title":"Proc. 1980 Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(81)90109-2_BIB11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/322123.322134","article-title":"Concurrent processes and their syntax","author":"Milne","year":"1979","journal-title":"J.ACM"},{"key":"10.1016\/0304-3975(81)90109-2_BIB12","article-title":"Kommunikation mit Automaten","author":"Petri","year":"1962","journal-title":"Schriften des Rheinisch Westfalischen Institut Instrumentelle Mathematik"},{"key":"10.1016\/0304-3975(81)90109-2_BIB13","article-title":"Economical solutions to the critical section problem in a distributed system","author":"Peterson","year":"1977","journal-title":"Proc. 9th Annual ACM Symposium on Theory of Computing"},{"issue":"3","key":"10.1016\/0304-3975(81)90109-2_BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1978.231501","article-title":"Software descriptions with flow expressions","volume":"4","author":"Shaw","year":"1978","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0304-3975(81)90109-2_BIB15","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581901092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581901092?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:42Z","timestamp":1757477922000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397581901092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["0304397581901092"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(81)90109-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On describing the behavior and implementation of distributed systems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(81)90109-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1981 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}