{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:25:13Z","timestamp":1755221113796,"version":"3.43.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Systems"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1023\/a:1007914216733","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T07:13:40Z","timestamp":1040541220000},"page":"95-107","source":"Crossref","is-referenced-by-count":23,"title":["Possible and Impossible Self-Stabilizing Digital Clock Synchronization in General Graphs"],"prefix":"10.1007","volume":"12","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"118326_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-56188-9_14","volume":"647","author":"E. Anagnostou","year":"1992","unstructured":"Anagnostou, E. and Hadzilacos, V. 1992. Tolerating transient and permanent failures. Proc. of the 6th International Workshop on Distributed Algorithms, Springer-Verlag LNCS: 647, pp. 203\u2013220","journal-title":"Proc. of the 6th International Workshop on Distributed Algorithms"},{"issue":"1","key":"118326_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1142\/S0129626491000161","volume":"1","author":"A. Arora","year":"1991","unstructured":"Arora, A., Dolev, S. and Gouda, M. G. 1991. Maintaining digital clocks in step. Parallel Processing Letters 1(1): 11\u201318.","journal-title":"Parallel Processing Letters"},{"key":"118326_CR3","unstructured":"Chengdian, L., and Simon, J., 1995. Possibility and Impossibility Results for Self-Stabilizing Phase Clocks on Synchronous Rings, Proc. of the Second Workshop on Self-Stabilizing Systems, pp. 10.1\u201310.15."},{"key":"118326_CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"Dijkstra, E. W. 1974. Self stabilizing systems in spite of distributed control. Communication of the ACM 17: 643\u2013644.","journal-title":"Communication of the ACM"},{"issue":"2","key":"118326_CR5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0022-0000(86)90028-0","volume":"32","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Halpern, J. Y. and Strong, H. R. 1986. On the possibility and impossibility of achieving clock synchronization. Journal of Computer and Systems Science 32(2): 230\u2013250.","journal-title":"Journal of Computer and Systems Science"},{"key":"118326_CR6","doi-asserted-by":"crossref","unstructured":"Dolev, S. 1993. Optimal time self stabilization in dynamic systems. Proc. of the 7th International Workshop on Distributed Algorithms, 160\u2013173.","DOI":"10.1007\/3-540-57271-6_34"},{"key":"118326_CR7","unstructured":"Dolev, S. 1994. Optimal time self-stabilization in uniform dynamic systems. 6th IASTED International Conference on Parallel and Distributed Computing and Systems, 25\u201328."},{"issue":"3","key":"118326_CR8","first-page":"74","volume":"26","author":"S. Dolev","year":"1995","unstructured":"Dolev, S. 1995. Workshop report, second workshop on self-stabilizing systems. SIGACT News 26(3): 74\u201376.","journal-title":"SIGACT News"},{"key":"118326_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"Dolev, S., Israeli, A. and Moran, S. 1993. Self stabilization of dynamic systems assuming only read write atomicity. Distributed Computing 7: 3\u201316.","journal-title":"Distributed Computing"},{"key":"118326_CR10","doi-asserted-by":"crossref","unstructured":"Dolev S. and Welch, J. L. 1993. Wait-free clock synchronization. Proc. of the 12th Annual ACM Symp. on Principles of Distributed Computing, 97\u2013108.","DOI":"10.1145\/164051.164066"},{"key":"118326_CR11","unstructured":"Dolev, S. and Welch, J. L. 1995. Self-stabilizing clock synchronization in the presence of Byzantine faults. Proc. of the Second Workshop on Self-Stabilizing Systems, pp. 9.1\u20139.12, Abstract in Proc. of the 14th Annual ACM Symp. on Principles of Distributed Computing."},{"key":"118326_CR12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M. J. Fischer","year":"1986","unstructured":"Fischer, M. J., Lynch, N. A. and Merritt, M. 1986. Easy impossibility proofs for distributed consensus problems. Distributed Computing 1: 26\u201339.","journal-title":"Distributed Computing"},{"issue":"4","key":"118326_CR13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(90)90020-X","volume":"35","author":"M. G. Gouda","year":"1990","unstructured":"Gouda, M. G. and Herman, T. 1990. Stabilizing unison. Information Processing Letters 35(4): 171\u2013175.","journal-title":"Information Processing Letters"},{"key":"118326_CR14","unstructured":"Hwang, K. 1993. Advanced Computer Architecture, Parallelism, Scalability, Programmability. McGraw-Hill, Inc."},{"key":"118326_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(95)00050-M","volume":"54","author":"T Herman","year":"1995","unstructured":"Herman, T and Ghosh, S. 1995. Stabilizing phase-clocks. Information Processing Letters 54: 259\u2013265.","journal-title":"Information Processing Letters"},{"issue":"6","key":"118326_CR16","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/71.285605","volume":"5","author":"R. Hofmann","year":"1994","unstructured":"R. Hofmann, R. Klar, B. Mohr, A. Quic, and M. Siegle, \u201cDistributed Performance Monitoring: Methods, Tools, and Applications,\u201d IEEE Trans. on Parallel and Distributed Systems 5(6): 585\u2013598, 1994.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"118326_CR17","doi-asserted-by":"crossref","unstructured":"Kedem, Z. M., Palem, K. V., Rabin, M. O. and Raghunathan, A. 1992. Efficient program transformations for resilient parallel computation via randomization. Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 306\u2013317.","DOI":"10.1145\/129712.129742"},{"key":"118326_CR18","doi-asserted-by":"crossref","unstructured":"Karp R. M. and Ramachandran, V. 1990. Parallel algorithms for shared memory machines. In Handbook of Theoretical Computer Science, J. van Leeuwen, ed., Elsevier Science Publishers B. V., pp. 869\u2013941.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"118326_CR19","doi-asserted-by":"crossref","unstructured":"Kanellakis P. C. and Shvartsman, A. A. 1991. Efficient parallel algorithms on restartable fail-stop processors. Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, pp. 23\u201336.","DOI":"10.1145\/112600.112603"},{"key":"118326_CR20","doi-asserted-by":"crossref","unstructured":"Leighton, F. T. 1992. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, Inc.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"issue":"1","key":"118326_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2457","volume":"32","author":"L. Lamport","year":"1985","unstructured":"Lamport, L. and Melliar-Smith, P. M. 1985. Synchronizing clocks in the presence of faults. Journal of the ACM 32(1): 1\u201336.","journal-title":"Journal of the ACM"},{"issue":"3","key":"118326_CR22","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R. and Pease, M. 1982. The Byzantine generals problem. ACM Trans. on Prog. Lang. and Sys. 4(3): 382\u2013401.","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"118326_CR23","unstructured":"Ullman, J. D. 1984. Computational Aspects of VLSI. Computer Science Press."},{"issue":"1","key":"118326_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(88)90043-0","volume":"77","author":"J. L. Welch","year":"1988","unstructured":"Welch J. L. and Lynch, N. 1988. A new fault-tolerant algorithm for clock synchronization. Information and Computation 77(1): 1\u201336.","journal-title":"Information and Computation"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007914216733.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007914216733\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007914216733.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T07:36:22Z","timestamp":1754638582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007914216733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["118326"],"URL":"https:\/\/doi.org\/10.1023\/a:1007914216733","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}