{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:17:11Z","timestamp":1768004231369,"version":"3.49.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1007\/bf02277859","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T18:39:49Z","timestamp":1138214389000},"page":"149-174","source":"Crossref","is-referenced-by-count":230,"title":["Detecting causal relationships in distributed computations: In search of the holy grail"],"prefix":"10.1007","volume":"7","author":[{"given":"Reinhard","family":"Schwarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedemann","family":"Mattern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02277859_CR1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(92)90107-7","volume":"44","author":"A Acharya","year":"1992","unstructured":"Acharya A, Badrinath BR: Recording distributed snapshots based on causal order of message delivery. Inf Process Lett 44: 317\u2013321 (1992)","journal-title":"Inf Process Lett"},{"key":"BF02277859_CR2","doi-asserted-by":"crossref","unstructured":"Ahmad M, Hutto PW, John R: Implementing and programming causal distributed shared memory. Proc 11th Int Conference on Distributed Computing Systems, Arlington, Texas, pp 274\u2013281, 1991","DOI":"10.1109\/ICDCS.1991.148677"},{"key":"BF02277859_CR3","doi-asserted-by":"crossref","unstructured":"Ahuja M, Carlson T, Gahlot A, Shands D: Timestamping events for inferring \u2018affects\u2019 relation and potential causality. Proc 15th IEEE Int Computer Software and Application Conference COMPSAC 91, Tokyo, pp 606\u2013611, 1991","DOI":"10.1109\/CMPSAC.1991.170249"},{"key":"BF02277859_CR4","volume-title":"Efficient reconstruction of the causal relationship in distributed computations","author":"P Baldy","year":"1992","unstructured":"Baldy P, Dicky H, Medina R, Morvan M, Vilarem JF: Efficient reconstruction of the causal relationship in distributed computations. Technical Report 92-013, Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier, Montpellier 1992"},{"issue":"3","key":"BF02277859_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0164-1212(83)90011-0","volume":"4","author":"PC Bates","year":"1983","unstructured":"Bates PC, Wileden JC: High-level debugging of distributed systems: the behavioral abstraction approach. J Syst Softw 4(3): 255\u2013264 (1983)","journal-title":"J Syst Softw"},{"issue":"1","key":"BF02277859_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/37499.37515","volume":"22","author":"K Birman","year":"1987","unstructured":"Birman K, Joseph T: Exploiting virtual synchrony in distributed systems. Operating Syst Rev 22(1): 123\u2013138 (1987)","journal-title":"Operating Syst Rev"},{"key":"BF02277859_CR7","doi-asserted-by":"crossref","DOI":"10.21236\/ADA238065","volume-title":"The process group approach to reliable distributed computing","author":"K Birman","year":"1991","unstructured":"Birman K: The process group approach to reliable distributed computing. Technical Report, Computer Science Department, Cornell University, Ithaca, New York 1991"},{"issue":"3","key":"BF02277859_CR8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1145\/128738.128742","volume":"9","author":"K Birman","year":"1991","unstructured":"Birman K, Schiper A, Stephenson P: Lightweight causal and atomic group multicast. ACM Trans Comput Syst 9(3): 272\u2013314 (1991)","journal-title":"ACM Trans Comput Syst"},{"issue":"2","key":"BF02277859_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0164-1212(83)90012-2","volume":"2","author":"B Bruegge","year":"1983","unstructured":"Bruegge B, Hibbard P: Generalized Path Expressions. J Syst Softw 2(2): 265\u2013276 (1983)","journal-title":"J Syst Softw"},{"issue":"1","key":"BF02277859_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"31","author":"KM Chandy","year":"1985","unstructured":"Chandy KM, Lamport L: Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst 31(1): 63\u201375 (1985)","journal-title":"ACM Trans Comput Syst"},{"key":"BF02277859_CR11","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-51687-5_31","volume-title":"Distributed algorithms","author":"B Charron-Bost","year":"1989","unstructured":"Charron-Bost B: Combinatorics and geometry of consistent cuts: application to concurrency theory. In: Bermond JC, Raynal M (eds) Distributed algorithms. LNCS, vol 392. Springer, Berlin Heidelberg New York 1989, pp 45\u201356"},{"key":"BF02277859_CR12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","volume":"39","author":"B Charron-Bost","year":"1991","unstructured":"Charron-Bost B: Concerning the size of logical clocks in distributed systems. Inf Process Lett 39: 11\u201316 (1991)","journal-title":"Inf Process Lett"},{"key":"BF02277859_CR13","volume-title":"Local and temporal predicates in distributed systems","author":"B Charron-Bost","year":"1992","unstructured":"Charron-Bost B, Delporte-Gallet C, Fauconnier H: Local and temporal predicates in distributed systems. Technical Report, LITP, IBP, Universit\u00e9 Paris 7, Paris 1992"},{"key":"BF02277859_CR14","unstructured":"Charron-Bost B, Mattern F, Tel G: Synchronous, asynchronous, and causally ordered communication. Distrib Comput (to appear)"},{"key":"BF02277859_CR15","doi-asserted-by":"crossref","unstructured":"Cooper R, Marzullo K: Consistent detection of global predicates. Proc ACM\/ONR Workshop on Parallel and Distributed Debugging, Santa Cruz, California 1991, pp 163\u2013173","DOI":"10.1145\/122759.122774"},{"key":"BF02277859_CR16","series-title":"LNCS","first-page":"363","volume-title":"Proc of the 9th Annual Symposium on Theoretical Aspects of Computer Science STACS '92","author":"C Diehl","year":"1992","unstructured":"Diehl C, Jard C: Interval approximations and message causality in distributed systems. In: Finkel A, Jantzen M (eds) Proc of the 9th Annual Symposium on Theoretical Aspects of Computer Science STACS '92, LNCS, vol 577, Springer, Berlin Heidelberg New York 1992, pp 363\u2013374"},{"key":"BF02277859_CR17","unstructured":"Fidge CJ: Timestamps in message-passing systems that preserve the partial ordering. Proc 11th Australian Computer Science Conference, University of Queensland, pp 55\u201366, 1988"},{"issue":"1","key":"BF02277859_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/69215.69233","volume":"24","author":"CJ Fidge","year":"1989","unstructured":"Fidge CJ: Partial orders for parallel debugging. ACM SIGPLAN Notices 24(1): 183\u2013194 (1989)","journal-title":"ACM SIGPLAN Notices"},{"key":"BF02277859_CR19","volume-title":"Dynamic analysis of event orderings in message passing systems","author":"CJ Fidge","year":"1989","unstructured":"Fidge CJ: Dynamic analysis of event orderings in message passing systems. PhD Thesis, Department of Computer Science, Australian National University, Canberra 1989"},{"issue":"8","key":"BF02277859_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"CJ Fidge","year":"1991","unstructured":"Fidge CJ: Logical time in distributed computing systems. IEEE Comput 24(8): 28\u201333 (1991)","journal-title":"IEEE Comput"},{"key":"BF02277859_CR21","doi-asserted-by":"crossref","unstructured":"Fischer MJ, Michael A: Sacrificing serializability to attain high availability of data in an unreliable network. Proc ACM SIGACT-SIGOPS Symposium on Principles of Database Systems, pp 70\u201375, 1982","DOI":"10.1145\/588111.588124"},{"key":"BF02277859_CR22","volume-title":"Interval orders and interval graphs","author":"PC Fishburn","year":"1985","unstructured":"Fishburn PC: Interval orders and interval graphs. Wiley, New York 1985"},{"key":"BF02277859_CR23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW: Algorithm 97, shortest path. Commun ACM 5: 345 (1962)","journal-title":"Commun ACM"},{"key":"BF02277859_CR24","doi-asserted-by":"crossref","unstructured":"Fowler J, Zwaenepoel W: Causal distributed breakpoints. Proc 10th Int Conference on Distributed Computing Systems, Paris, pp 134\u2013141, 1990","DOI":"10.1109\/ICDCS.1990.89277"},{"issue":"3","key":"BF02277859_CR25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/spe.4380160304","volume":"16","author":"J Gait","year":"1986","unstructured":"Gait J: A probe effect in concurrent programs. Softw Pract Exper 16 (3): 225\u2013233 (1986)","journal-title":"Softw Pract Exper"},{"key":"BF02277859_CR26","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-56287-7_110","volume-title":"Proc 12th Conference on the Foundation of Software Technology and Theoretical Computer Science","author":"VK Garg","year":"1992","unstructured":"Garg VK, Waldecker B: Detection of unstable predicates in distributed programs. In: Shyamasundra R (ed) Proc 12th Conference on the Foundation of Software Technology and Theoretical Computer Science, LNCS, vol 652. Springer, Berlin Heidelberg New York 1992, pp 253\u2013264"},{"key":"BF02277859_CR27","doi-asserted-by":"crossref","unstructured":"Haban D, Weigel W: Global events and global breakpoints in distributed systems. Proc 21st Annual Hawaii Int Conference on System Sciences, pp 166\u2013175, 1988","DOI":"10.1109\/HICSS.1988.11802"},{"key":"BF02277859_CR28","volume-title":"Technical Report SFB124-08\/1991","author":"D Haban","year":"1991","unstructured":"Haban D, Zhou S, Maurer D, Wilhelm R: Specification and detection of global breakpoints in distributed systems. Technical Report SFB124-08\/1991, Universit\u00e4t des Saarlandes, Saarbr\u00fccken 1991"},{"key":"BF02277859_CR29","series-title":"NATO ASI Series F","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/978-3-642-82453-1_17","volume-title":"Logics and models of concurrent systems","author":"D Harel","year":"1985","unstructured":"Harel D, Pnueli A: On the development of reactive systems. In: Apt K (ed) Logics and models of concurrent systems, NATO ASI Series F, vol 13. Springer, Berlin Heidelberg New York 1985, pp 477\u2013498"},{"issue":"3","key":"BF02277859_CR30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/99164.99166","volume":"25","author":"W Hseush","year":"1990","unstructured":"Hseush W, Kaiser GE: Modeling concurrency in parallel debugging. ACM SIGPLAN Notices 25(3): 11\u201320 (1990)","journal-title":"ACM SIGPLAN Notices"},{"key":"BF02277859_CR31","doi-asserted-by":"crossref","unstructured":"Hutto P, Ahamad M: Slow memory: weakening consistency to enhance concurrency in distributed shared memories. Proc 10th Int Conference on Distributed Computing Systems, Paris, pp 302\u2013309, 1990","DOI":"10.1109\/ICDCS.1990.89297"},{"issue":"3","key":"BF02277859_CR32","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/0196-6774(90)90022-7","volume":"11","author":"DB Johnson","year":"1990","unstructured":"Johnson DB, Zwaenepoel W: Recovery in distributed systems using optimistic message logging and checkpointing. J Algorithms 11(3): 462\u2013491 (1990)","journal-title":"J Algorithms"},{"key":"BF02277859_CR33","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(90)90096-Z","volume":"75","author":"S Katz","year":"1990","unstructured":"Katz S, Peled D: Interleaving set temporal logic. Theor Comput Sci 75: 263\u2013287 (1990)","journal-title":"Theor Comput Sci"},{"key":"BF02277859_CR34","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02252682","volume":"6","author":"S Katz","year":"1992","unstructured":"Katz S, Peled D: Verification of distributed programs using representative interleaving sequences. Distrib Comput 6: 107\u2013120 (1992)","journal-title":"Distrib Comput"},{"key":"BF02277859_CR35","doi-asserted-by":"crossref","unstructured":"Kearns JP, Koodalattupuram B: Immediate ordered service in distributed systems. Proc 9th Int Conference on Distributed Computing Systems, Newport Beach, California, 611\u2013618, 1989","DOI":"10.1109\/ICDCS.1989.37995"},{"issue":"7","key":"BF02277859_CR36","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport L: Time, clocks, and the ordering of events in a distributed system. Commun ACM 21 (7): 558\u2013565 (1978)","journal-title":"Commun ACM"},{"issue":"4","key":"BF02277859_CR37","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TC.1987.1676929","volume":"36","author":"TJ LeBlanc","year":"1987","unstructured":"LeBlanc TJ, Mellor-Crummey JM: Debugging parallel programs with instant replay. IEEE Trans Comput 36(4): 471\u2013482 (1987)","journal-title":"IEEE Trans Comput"},{"key":"BF02277859_CR38","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BFb0032948","volume-title":"Proc 2nd European Distributed Memory Computing Conference, Munich, Germany","author":"E Leu","year":"1991","unstructured":"Leu E, Schiper A, Zramdini A: Efficient excution replay for distributed memory architectures. In: Bode A (ed) Proc 2nd European Distributed Memory Computing Conference, Munich, Germany, LNCS, vol 487. Springer, Berlin Heidelberg New York 1991, pp 315\u2013324"},{"key":"BF02277859_CR39","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0743-7315(92)90058-U","volume":"15","author":"Y Manabe","year":"1992","unstructured":"Manabe Y, Imase M: Global conditions in debugging distributed programs. J Parallel Distrib Comput 15: 62\u201369 (1992)","journal-title":"J Parallel Distrib Comput"},{"key":"BF02277859_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The temporal logic of reactive and concurrent systems","author":"Z Manna","year":"1992","unstructured":"Manna Z, Pnueli A: The temporal logic of reactive and concurrent systems. Springer, Berlin Heidelberg New York 1992"},{"key":"BF02277859_CR41","series-title":"LNCS","first-page":"254","volume-title":"Proc 5th Workshop on Distributed Algorithms (WDAG-91), Delphi, Greece","author":"K Marzullo","year":"1991","unstructured":"Marzullo K, Neiger G: Detection of global state predicates. In: Toueg S, Spirakis PG, Kirousis L (eds) Proc 5th Workshop on Distributed Algorithms (WDAG-91), Delphi, Greece, LNCS, vol 579. Springer, Berlin Heidelberg New York 1991, pp 254\u2013272"},{"issue":"SD-1-8","key":"BF02277859_CR42","first-page":"373","volume":"6","author":"T Masuzawa","year":"1992","unstructured":"Masuzawa T, Tokura N: A causal distributed breakpoint algorithm for distributed debugger. Proc ICICE Fall Conf (SD-1-8) 6: 373\u2013374 (1992)","journal-title":"Proc ICICE Fall Conf"},{"key":"BF02277859_CR43","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F Mattern","year":"1987","unstructured":"Mattern F: Algorithms for distributed termination detection. Distrib Comput 2: 161\u2013175 (1987)","journal-title":"Distrib Comput"},{"key":"BF02277859_CR44","unstructured":"Mattern F: Virtual time and global states in distributed systems. In: Cosnard M et al. (eds) Proc Workshop on Parallel and Distributed Algorithms, Chateau de Bonas, Oct. 1988, Elsevier, North Holland, 1989, pp 215\u2013226"},{"key":"BF02277859_CR45","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1006\/jpdc.1993.1075","volume":"18","author":"F Mattern","year":"1993","unstructured":"Mattern F: Efficient algorithms for distributed snapshots and global virtual time approximation. J Parallel Distrib Comput 18: 423\u2013434 (1993)","journal-title":"J Parallel Distrib Comput"},{"key":"BF02277859_CR46","doi-asserted-by":"crossref","unstructured":"Medina R: Incremental garbage collection of causal relationship computation in distributed systems. Proc 5th IEEE Symposium on Parallel and Distributed Processing, Irving, Texas, 1993","DOI":"10.1109\/SPDP.1993.395472"},{"key":"BF02277859_CR47","doi-asserted-by":"crossref","unstructured":"Meldal S, Sankar S, Vera J: Exploiting locality in maintaining potential causality. Proc 10th Annual ACM Symposium on Principles of Distributed Computing, Montreal, Canada, pp 231\u2013239, 1991","DOI":"10.1145\/112600.112620"},{"key":"BF02277859_CR48","unstructured":"Miller BP, Choi JD: Breakpoints and halting in distributed programs. Proc 8th Int Conference on Distributed Computing Systems, pp 316\u2013323, 1988"},{"key":"BF02277859_CR49","first-page":"56","volume-title":"Das Relativit\u00e4tsprinzip. Eine Sammlung von Abhandlungen","author":"H Minkowski","year":"1915","unstructured":"Minkowski H: Raum und Zeit. In: Lorentz HA, Einstein A, Minkowski H: Das Relativit\u00e4tsprinzip. Eine Sammlung von Abhandlungen. Teubner, Leipzig 1915, pp 56\u201368"},{"key":"BF02277859_CR50","doi-asserted-by":"crossref","unstructured":"Netzer RHB, Miller BP: Optimal tracing and replay for debugging message-passing parallel programs. Proc Supercomputing '92, Minneapolis, pp 502\u2013511, 1992","DOI":"10.1109\/SUPERC.1992.236654"},{"key":"BF02277859_CR51","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen M, Plotkin G, Winskel G: Petri nets, event structures and domains, part I. Theor Comput Sci 13: 85\u2013108 (1981)","journal-title":"Theor Comput Sci"},{"key":"BF02277859_CR52","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(87)90164-5","volume":"25","author":"E Ochmanski","year":"1987","unstructured":"Ochmanski E: Inevitability in concurrent systems. Inf Process Lett 25: 221\u2013225 (1987)","journal-title":"Inf Process Lett"},{"issue":"2","key":"BF02277859_CR53","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02252679","volume":"6","author":"P Panangaden","year":"1992","unstructured":"Panangaden P, Taylor K: Concurrent common knowledge: defining agreement for asynchronous systems. Distrib Comput 6(2): 73\u201393 (1992)","journal-title":"Distrib Comput"},{"issue":"3","key":"BF02277859_CR54","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/52.88942","volume":"8","author":"MK Ponamgi","year":"1991","unstructured":"Ponamgi MK, Hseush W, Kaiser GE: Debugging multithreaded programs with MPD. IEEE Software, 8(3): 37\u201343 (1991)","journal-title":"IEEE Software"},{"issue":"1","key":"BF02277859_CR55","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V Pratt","year":"1986","unstructured":"Pratt V: Modeling concurrency with partial orders. Int J Parallel Program 15(1): 33\u201371 (1986)","journal-title":"Int J Parallel Program"},{"key":"BF02277859_CR56","doi-asserted-by":"crossref","unstructured":"Pratt V: Modeling concurrency with geometry. Proc 18th Annual Symposium on Principles of Programming Languages (POPL-91), pp 311\u2013322, 1991","DOI":"10.1145\/99583.99625"},{"key":"BF02277859_CR57","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/BFb0023846","volume-title":"Proc LATIN '92, LNCS, vol 583","author":"V Pratt","year":"1992","unstructured":"Pratt V: Arithmetic+Logic+Geometry=Concurrency. In: Simon I (ed) Proc LATIN '92, LNCS, vol 583. Springer, Berlin Heidelberg New York 1992, pp 430\u2013447"},{"key":"BF02277859_CR58","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0020-0190(91)90008-6","volume":"39","author":"M Raynal","year":"1991","unstructured":"Raynal M, Schiper A, Toueg S: The causal ordering abstraction and a simple way to implement it. Inf Process Lett 39: 343\u2013350 (1991)","journal-title":"Inf Process Lett"},{"key":"BF02277859_CR59","series-title":"LNCS","first-page":"238","volume-title":"Advances in Petri nets","author":"W Reisig","year":"1987","unstructured":"Reisig W: A strong part of concurreney. In: Rozenberg G (ed) Advances in Petri nets, LNCS, vol 266. Springer, Berlin Heidelberg New York 1987, pp 238\u2013272"},{"key":"BF02277859_CR60","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-50403-6_37","volume-title":"Proc Concurrency '88","author":"W Reisig","year":"1988","unstructured":"Reisig W: Temporal logic and causality in concurrent systems. In: Vogt FH (ed) Proc Concurrency '88, LNCS, vol 335. Springer, Berlin Heidelberg New York 1988, pp 121\u2013139"},{"key":"BF02277859_CR61","volume-title":"Technical Report SFB342\/30\/91A","author":"W Reisig","year":"1991","unstructured":"Reisig W: Parallel composition of liveness. Technical Report SFB342\/30\/91A, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen 1991"},{"issue":"2","key":"BF02277859_CR62","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/155848.155857","volume":"27","author":"R Renesse van","year":"1993","unstructured":"van Renesse R: Causal controversy at Le Mont St.-Michel. ACM Operating Syst Rev 27(2):44\u201353 (1993)","journal-title":"ACM Operating Syst Rev"},{"key":"BF02277859_CR63","volume-title":"A characterization of consistent distributed snapshots using causal order","author":"A Sandoz","year":"1992","unstructured":"Sandoz A, Schiper A: A characterization of consistent distributed snapshots using causal order. Technical Report 92-14, D\u00e9partement d'Informatique, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, Lausanne 1992"},{"key":"BF02277859_CR64","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-51687-5_45","volume-title":"Proc Workshop on Distributed Algorithms, Nice, France","author":"A Schiper","year":"1989","unstructured":"Schiper A, Eggli J, Sandoz A: A new algorithm to implement causal ordering. In: Bermond JC, Raynal M (eds) Proc Workshop on Distributed Algorithms, Nice, France, LNCS, vol 392. Springer, Berlin Heidelberg New York 1989, pp 219\u2013232"},{"key":"BF02277859_CR65","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(92)90028-T","volume":"43","author":"M Singhal","year":"1992","unstructured":"Singhal M, Kshemkalyani A: An efficient implementation of vector clocks. Inf Process Lett 43: 47\u201352 (1992)","journal-title":"Inf Process Lett"},{"key":"BF02277859_CR66","doi-asserted-by":"crossref","unstructured":"Spezialetti M, Kearns JP: Simultaneous regions: a framework for the consistent monitoring of distributed systems. Proc 9th Int Conference on Distributed Computing Systems, Newport Beach, California, pp 61\u201368, 1989","DOI":"10.1109\/ICDCS.1989.37931"},{"key":"BF02277859_CR67","unstructured":"Stone JM: Visualizing concurrent processes. Technical Report RC 12973, IBM TJ Watson Research Center 1987"},{"key":"BF02277859_CR68","doi-asserted-by":"crossref","unstructured":"Stone JM: Debugging concurrent processes: a case study. Proc SIGPLAN Conf on Programming Language Design and Implementation, Atlanta, Georgia, pp 145\u2013153, 1988","DOI":"10.1145\/53990.54005"},{"issue":"1","key":"BF02277859_CR69","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/69215.69237","volume":"24","author":"JM Stone","year":"1989","unstructured":"Stone JM: A graphical representation of concurrent processes. ACM SIGPLAN Notices 24(1): 226\u2013235 (1989)","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"BF02277859_CR70","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1145\/3959.3962","volume":"3","author":"R Strom","year":"1985","unstructured":"Strom R, Yemini S: Optimistic recovery in distributed systems. ACM Trans Comput Syst 3 (3): 204\u2013226 (1985)","journal-title":"ACM Trans Comput Syst"},{"key":"BF02277859_CR71","doi-asserted-by":"crossref","first-page":"386","DOI":"10.4064\/fm-16-1-386-389","volume":"16","author":"E Szpilrajn","year":"1930","unstructured":"Szpilrajn E: Sur l'extension de l'ordre partiel. Fund Math 16: 386\u2013389 (1930)","journal-title":"Fund Math"},{"key":"BF02277859_CR72","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall S: A theorem on Boolean matrices. J ACM 9: 11\u201312 (1962)","journal-title":"J ACM"},{"key":"BF02277859_CR73","series-title":"LNCS","first-page":"364","volume-title":"Proc Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands","author":"G Winskel","year":"1988","unstructured":"Winskel G: An introduction to event structures. In: de Bakker JW, de Roever WP, Rozenberg G (eds) Proc Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands, LNCS, vol 354. Springer, Berlin Heidelberg New York 1988, pp 364\u2013397"},{"key":"BF02277859_CR74","doi-asserted-by":"crossref","unstructured":"Wuu GTJ, Bernstein AJ: Efficient solutions to the replicated log and dictionary problems. Proc ACM Symposium on Principles of Distributed Computing, pp 233\u2013242, 1984","DOI":"10.1145\/800222.806750"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02277859.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02277859\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02277859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T12:47:21Z","timestamp":1736254041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02277859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":74,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF02277859"],"URL":"https:\/\/doi.org\/10.1007\/bf02277859","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}