{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:09Z","timestamp":1725455589187},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022434","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["On the limitation of the global time assumption in distributed systems"],"prefix":"10.1007","author":[{"given":"Uri","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Ben-David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Abraham, U., \u201cOn interprocess communication and the problem of common atomic registers\u201d, manuscript, 1989."},{"key":"1_CR2","unstructured":"Abraham, U., and Ben-David, S., \u201cInformal and Formal Correctness Proofs for Programs\u201d, manuscript, November 1987."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Avraham, U., Ben-David, S., and Magidor, M., \u201cOn Global Time and Inter-Process Communication\u201d, Semantics for Concurrency, M.Z. Kwiatkowska, M.W. Shield, and R.M. Thomas (Eds.), Springer-Verlag, July 1990, 311\u2013323.","DOI":"10.1007\/978-1-4471-3860-0_19"},{"issue":"No.3","key":"1_CR4","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/65979.65982","volume":"11","author":"F. D. Anger","year":"1989","unstructured":"Anger, F. D., \u201cOn Lamport's interprocess communication model\u201d, ACM Transactions on Programming Languages and Systems, Vol. 11 No. 3, July 1989, 404\u2013417.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ben-David, S., \u201cThe global-time assumption and semantics for concurrent systems\u201d, Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, 1988, 223\u2013232.","DOI":"10.1145\/62546.62583"},{"key":"1_CR6","unstructured":"Ben-David, S., \u201cOn Lamport's Shared Memory Registers\u201d, in preparation."},{"key":"1_CR7","first-page":"1","volume-title":"Linear Time, Branching Time and partial Order in Logics and Models for Concurrency","author":"J. F. A. K. Benthem Van","year":"1989","unstructured":"Van Benthem, J. F. A. K., \u201c Time, Logic and computation\u201d, in Bakker, Roever and Rozenberg (Eds), Linear Time, Branching Time and partial Order in Logics and Models for Concurrency, pp. 1\u201349, Springer, Berlin, 1989."},{"key":"1_CR8","series-title":"Wiley-Interscience series in discrete mathematics","volume-title":"Interval orders and interval graphs","author":"P.C. Fishburn","year":"1987","unstructured":"Fishburn, P.C., \u201cInterval orders and interval graphs\u201d, Wiley, New-York (Wiley-Interscience series in discrete mathematics), 1987."},{"issue":"2","key":"1_CR9","first-page":"313","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L., \u201cThe mutual Exclusion Problem: Part I-A Theory of interprocess Communication; Part II-Statements and Solutions\u201d, J. of the A.C.M., Vol 33, 21986), pp. 313\u2013326.","journal-title":"J. of the A.C.M."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L., \u201cOn Interprocess Communication, Part I: Basic formalism, Part II: Algorithms\u201d, Distributed Computing, Vol. 1(1986), pp. 77\u2013101.","journal-title":"Distributed Computing"},{"key":"1_CR11","first-page":"441","volume":"17","author":"N. Wiener","year":"1914","unstructured":"Wiener, N., \u201cA contribution to the theory of relative position\u201d, Proc. Camb. Philos. Soc. 17(1914), pp.441\u2013449.","journal-title":"Proc. Camb. Philos. Soc."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022434.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:25Z","timestamp":1607550505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0022434","relation":{},"subject":[]}}