{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,18]],"date-time":"2026-11-18T22:40:51Z","timestamp":1795041651966,"version":"4.10.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1007\/bf01786227","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T03:05:42Z","timestamp":1119150342000},"page":"77-85","source":"Crossref","is-referenced-by-count":555,"title":["On interprocess communication"],"prefix":"10.1007","volume":"1","author":[{"given":"Leslie","family":"Lamport","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01786227_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/356842.356846","volume":"13","author":"PA Bernstein","year":"1981","unstructured":"Bernstein PA, Goodman N (1981) Concurrency control in distributed database systems. ACM Comput Surv 13:185\u2013222","journal-title":"ACM Comput Surv"},{"key":"BF01786227_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Net Theory and Applications","year":"1980","unstructured":"Brauer W (ed) (1980) Net Theory and Applications. Lect Notes Comput Sci 84, Springer-Verlag, Berlin Heidelberg New York"},{"key":"BF01786227_CR3","unstructured":"Lamport L (in press) The mutual exclusion problem. J ACM"},{"key":"BF01786227_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/357062.357068","volume":"1","author":"L Lamport","year":"1979","unstructured":"Lamport L (1979) A new approach to proving the correctness of multiprocess programs. ACM Trans Program Lang Syst 1:84\u201397","journal-title":"ACM Trans Program Lang Syst"},{"key":"BF01786227_CR5","doi-asserted-by":"crossref","unstructured":"Lamport L: On interprocess communication. Part II: Algorithms. Distributed Computing 1:85-101","DOI":"10.1007\/BF01786228"},{"key":"BF01786227_CR6","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport L (1978) Time, clocks and the ordering of events in a distributed system. Commun ACM 21:558\u2013565","journal-title":"Commun ACM"},{"key":"BF01786227_CR7","doi-asserted-by":"crossref","unstructured":"Lamport L (1985) What it means for a concurrent program to satisfy a specification: why no one has specified priority. In: Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, ACM SIGACT-SIGPLAN, New Orleans","DOI":"10.1145\/318593.318616"},{"key":"BF01786227_CR8","unstructured":"Lamport L (1985) Interprocess Communication. SRI Technical Report, March 1985"},{"key":"BF01786227_CR9","unstructured":"Lauer PE, Shields MW. Best E (1979) Formal Theory of the Basic COSY Notation. Technical Report TR143. Computing Laboratory. University of Newcastle upon Tyne"},{"key":"BF01786227_CR10","unstructured":"Mazurkiewicz A (1984) Semantics of Concurrent Systems: A Modular Fixed Point Trace Approach. Technical Report 84-19. Institute of Applied Mathematics and Computer Science, University of Leiden"},{"key":"BF01786227_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner R (1980) A Calculus of Communicating Systems. Lect Notes Comput Sci 92. Springer-Verlag, Berlin Heidelberg New York"},{"key":"BF01786227_CR12","doi-asserted-by":"crossref","unstructured":"Pnueli A (1977) The temporal logic of programs. In: Proc. of the 18th Symposium on the Foundations of Computer Science, ACM, November 1977","DOI":"10.1109\/SFCS.1977.32"},{"key":"BF01786227_CR13","unstructured":"Winskel G (1980) Events in Computation. PhD thesis, Edinburgh University"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01786227.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01786227\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01786227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:49:23Z","timestamp":1557409763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01786227"}},"subtitle":["Part I: Basic formalism"],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF01786227"],"URL":"https:\/\/doi.org\/10.1007\/bf01786227","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}