{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:40Z","timestamp":1772119840874,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["EDGEDATA-CM (P2018\/TCS-4499)"],"award-info":[{"award-number":["EDGEDATA-CM (P2018\/TCS-4499)"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Spanish Research Council","award":["QoSData (PID2020-119461GB-I00)"],"award-info":[{"award-number":["QoSData (PID2020-119461GB-I00)"]}]},{"DOI":"10.13039\/501100007511","name":"Universidad Rey Juan Carlos","doi-asserted-by":"publisher","award":["OpenSSDWMN 5G (URJC 2022\/00004\/017)"],"award-info":[{"award-number":["OpenSSDWMN 5G (URJC 2022\/00004\/017)"]}],"id":[{"id":"10.13039\/501100007511","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06187-6","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T13:01:36Z","timestamp":1716382896000},"page":"18728-18760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Timestamp system for causal broadcast communication"],"prefix":"10.1007","volume":"80","author":[{"given":"Isabel","family":"Mu\u00f1oz-Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Ar\u00e9valo-Vi\u00f1uales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"de-las-Heras-Quir\u00f3s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"issue":"1","key":"6187_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"KP Birman","year":"1987","unstructured":"Birman KP, Joseph TA (1987) Reliable communication in the presence of failures. ACM Trans Comput Syst 5(1):47\u201376. https:\/\/doi.org\/10.1145\/7351.7478","journal-title":"ACM Trans Comput Syst"},{"issue":"7","key":"6187_CR2","doi-asserted-by":"publisher","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(7):558\u2013565. https:\/\/doi.org\/10.1145\/359545.359563","journal-title":"Commun ACM"},{"key":"6187_CR3","doi-asserted-by":"publisher","unstructured":"Lloyd W, Freedman MJ, Kaminsky M, Andersen DG (2011) Don\u2019t settle for eventual: scalable causal consistency for wide-area storage with cops. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles. SOSP \u201911, pp. 401\u2013416. ACM, New York. https:\/\/doi.org\/10.1145\/2043556.2043593","DOI":"10.1145\/2043556.2043593"},{"key":"6187_CR4","unstructured":"Baquero C, Almeida PS, Shoker A (2017) Pure operation-based replicated data types. http:\/\/arxiv.org\/abs\/1710.04469"},{"key":"6187_CR5","unstructured":"Fidge CJ (1988) Timestamps in message-passing systems that preserve the partial ordering. In: Proceedings $$11^{{{\\rm th}}}$$ Australasian Computer Science Conference, vol. 10, pp. 56\u201366"},{"key":"6187_CR6","unstructured":"Mattern F (1989) Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms: Proceedings of the International Workshop on Parallel and Distributed Algorithms, vol. 1. Amsterdam, the Netherlands, pp. 215\u2013226"},{"issue":"3","key":"6187_CR7","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/128738.128742","volume":"9","author":"K Birman","year":"1991","unstructured":"Birman K, Schiper A, Stephenson P (1991) Lightweight causal and atomic group multicast. ACM Trans Comput Syst 9(3):272\u2013314. https:\/\/doi.org\/10.1145\/128738.128742","journal-title":"ACM Trans Comput Syst"},{"issue":"1","key":"6187_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","volume":"39","author":"B Charron-Bost","year":"1991","unstructured":"Charron-Bost B (1991) Concerning the size of logical clocks in distributed systems. Inf Process Lett 39(1):11\u201316. https:\/\/doi.org\/10.1016\/0020-0190(91)90055-M","journal-title":"Inf Process Lett"},{"issue":"1","key":"6187_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(92)90028-T","volume":"43","author":"M Singhal","year":"1992","unstructured":"Singhal M, Kshemkalyani A (1992) An efficient implementation of vector clocks. Inf Process Lett 43(1):47\u201352. https:\/\/doi.org\/10.1016\/0020-0190(92)90028-T","journal-title":"Inf Process Lett"},{"key":"6187_CR10","unstructured":"Hadzilacos V, Toueg S (1994) A modular approach to fault-tolerant broadcasts and related problems. https:\/\/api.semanticscholar.org\/CorpusID:13974342"},{"key":"6187_CR11","doi-asserted-by":"publisher","unstructured":"Almeida PS, Baquero C, Fonte V (2008) Interval tree clocks. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) Principles of distributed systems, pp. 259\u2013274. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-92221-6_18","DOI":"10.1007\/978-3-540-92221-6_18"},{"key":"6187_CR12","doi-asserted-by":"publisher","unstructured":"Auvolat A, Frey D, Raynal M, Taiani F (2021) Byzantine-tolerant causal broadcast. Theor Comput Sci 885, 55\u201368. https:\/\/doi.org\/10.1016\/j.tcs.2021.06.021","DOI":"10.1016\/j.tcs.2021.06.021"},{"issue":"4","key":"6187_CR13","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/TPDS.2020.3032293","volume":"32","author":"T Pozzetti","year":"2020","unstructured":"Pozzetti T, Kshemkalyani AD (2020) Resettable encoded vector clock for causality analysis with an application to dynamic race detection. IEEE Trans Parallel Distrib Syst 32(4):772\u2013785. https:\/\/doi.org\/10.1109\/TPDS.2020.3032293","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"6187_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s004460050065","volume":"12","author":"FJ Torres-Rojas","year":"1999","unstructured":"Torres-Rojas FJ, Ahamad M (1999) Plausible clocks: constant size logical clocks for distributed systems. Distrib Comput 12(4):179\u2013195","journal-title":"Distrib Comput"},{"key":"6187_CR15","unstructured":"Ramabaja L (2019) The bloom clock. arXiv preprint arXiv:1905.13064"},{"key":"6187_CR16","doi-asserted-by":"publisher","unstructured":"Kshemkalyani AD, Misra A (2021) The bloom clock to characterize causality in distributed systems. In: Advances in networked-based information systems: the 23rd international conference on network-based information systems (NBiS-2020) 23, pp. 269\u2013279. https:\/\/doi.org\/10.1007\/978-3-030-57811-4_25 . Springer","DOI":"10.1007\/978-3-030-57811-4_25"},{"key":"6187_CR17","doi-asserted-by":"crossref","unstructured":"Rodrigues L, Ver\u00edssimo P (1995) Causal separators for large-scale multicast communication. In: of 15th International Conference on Distributed Computing Systems (ICDCS), pp. 83\u201391. IEEE","DOI":"10.1109\/ICDCS.1995.500006"},{"key":"6187_CR18","doi-asserted-by":"publisher","unstructured":"Baldoni R, Friedman R, Renesse R (1997) The hierarchical daisy architecture for causal delivery. In: Proceedings of 17th International Conference on Distributed Computing Systems, pp. 570\u2013577.https:\/\/doi.org\/10.1109\/ICDCS.1997.603422","DOI":"10.1109\/ICDCS.1997.603422"},{"key":"6187_CR19","unstructured":"Friedman R, Manor S (2004) Causal ordering in deterministic overlay networks. Technical report, Israel Institute of Technology, Haifa, Israel"},{"key":"6187_CR20","doi-asserted-by":"publisher","unstructured":"N\u00e9delec B, Molli P, Most\u00e9faoui A (2018) Breaking the scalability barrier of causal broadcast for large and dynamic systems. In: 2018 IEEE 37th symposium on reliable distributed systems (SRDS), pp. 51\u201360. https:\/\/doi.org\/10.1109\/SRDS.2018.00016","DOI":"10.1109\/SRDS.2018.00016"},{"key":"6187_CR21","doi-asserted-by":"crossref","unstructured":"Attiya H, Welch J (2004) Distributed computing: fundamentals, simulations and advanced topics, $$2^{{{\\rm nd}}}$$ Ed., pp. 175\u2013177. Wiley, Inc., Hoboken","DOI":"10.1002\/0471478210"},{"key":"6187_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38123-2","volume-title":"Distributed algorithms for message-passing systems","author":"M Raynal","year":"2013","unstructured":"Raynal M (2013) Distributed algorithms for message-passing systems, sec.7.2, 7.3, 12.1 and 12.3. Springer, Berlin, Heidelberg"},{"key":"6187_CR23","doi-asserted-by":"publisher","unstructured":"Bouajjani A, Enea C, Guerraoui R, Hamza J (2017) On verifying causal consistency. In: Proceedings of the 44th ACM SIGPLAN symposium on principles of programming languages. POPL \u201917, pp. 626\u2013638. ACM, New York. https:\/\/doi.org\/10.1145\/3009837.3009888","DOI":"10.1145\/3009837.3009888"},{"key":"6187_CR24","unstructured":"Babao\u011flu O, Marzullo K (1993) Consistent global states of distributed systems: fundamental concepts and mechanisms, pp. 55\u201396. ACM Press\/Addison-Wesley Publishing Co."},{"key":"6187_CR25","doi-asserted-by":"crossref","unstructured":"Cachin C, Guerraoui R, Rodrigues L (2011) Introduction to reliable and secure distributed programming, $$2^{{{\\rm nd}}}$$ Ed. Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-15260-3"},{"key":"6187_CR26","doi-asserted-by":"publisher","unstructured":"Nieto A, Gondelman L, Reynaud A, Timany A, Birkedal L (2022) Modular verification of op-based CRDTs in separation logic. Proc ACM Program Lang. 6(OOPSLA2). https:\/\/doi.org\/10.1145\/3563351","DOI":"10.1145\/3563351"},{"key":"6187_CR27","doi-asserted-by":"publisher","unstructured":"Redmond P, Shen G, Vazou N, Kuper L (2023) Verified causal broadcast with liquid haskell. In: Proceedings of the 34th symposium on implementation and application of functional languages. IFL \u201922. ACM, New York. https:\/\/doi.org\/10.1145\/3587216.3587222","DOI":"10.1145\/3587216.3587222"},{"issue":"3","key":"6187_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2187671.2187677","volume":"44","author":"G Cugola","year":"2012","unstructured":"Cugola G, Margara A (2012) Processing flows of information: From data stream to complex event processing. ACM Compt Surv 44(3):1\u201362 https:\/\/doi.org\/10.1145\/2187671.2187677","journal-title":"ACM Compt Surv"},{"key":"6187_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-tolerant message-passing distributed systems: an algorithmic approach","author":"M Raynal","year":"2018","unstructured":"Raynal M (2018) Fault-tolerant message-passing distributed systems: an algorithmic approach. Springer, Berlin"},{"key":"6187_CR30","doi-asserted-by":"publisher","unstructured":"Kshemkalyani AD, Shen M, Voleti B (2020) Prime clock: encoded vector clock to characterize causality in distributed systems. J Parallel Distrib Comput 140, 37\u201351 https:\/\/doi.org\/10.1016\/J.JPDC.2020.02.008","DOI":"10.1016\/J.JPDC.2020.02.008"},{"issue":"7","key":"6187_CR31","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"key":"6187_CR32","doi-asserted-by":"publisher","unstructured":"Misra A, Kshemkalyani AD (2021) The bloom clock for causality testing. In: Distributed computing and internet technology: 17th international conference, ICDCIT 2021, Bhubaneswar, India, 2021, Proceedings 17, pp. 3\u201323. https:\/\/doi.org\/10.1007\/978-3-030-65621-8_1. Springer","DOI":"10.1007\/978-3-030-65621-8_1"},{"issue":"6","key":"6187_CR33","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(92)90107-7","volume":"44","author":"A Acharya","year":"1992","unstructured":"Acharya A, Badrinath B (1992) Recording distributed snopshots based on causal order of message delivery. Inf Process Lett 44(6):317\u2013321. https:\/\/doi.org\/10.1016\/0020-0190(92)90107-7","journal-title":"Inf Process Lett"},{"issue":"6","key":"6187_CR34","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0020-0190(94)00055-7","volume":"50","author":"S Alagar","year":"1994","unstructured":"Alagar S, Venkatesan S (1994) An optimal algorithm for distributed snapshots with causal message ordering. Inf Process Lett 50(6):311\u2013316. https:\/\/doi.org\/10.1016\/0020-0190(94)00055-7","journal-title":"Inf Process Lett"},{"key":"6187_CR35","doi-asserted-by":"publisher","unstructured":"Misra A, Kshemkalyani AD (2022) Detecting causality in the presence of byzantine processes: There is no holy grail. In: 2022 IEEE 21st international symposium on network computing and applications (NCA), vol. 21, pp. 73\u201380. https:\/\/doi.org\/10.1109\/NCA57778.2022.10013644","DOI":"10.1109\/NCA57778.2022.10013644"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06187-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06187-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06187-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T13:46:14Z","timestamp":1732023974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06187-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":35,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6187"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06187-6","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4087327\/v1","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,22]]},"assertion":[{"value":"3 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest that may have affected the content of this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}