{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:56:16Z","timestamp":1773327376967,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1007\/s004460050018","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T04:52:48Z","timestamp":1030251168000},"page":"173-191","source":"Crossref","is-referenced-by-count":60,"title":["Synchronous, asynchronous, and causally ordered communication"],"prefix":"10.1007","volume":"9","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedemann","family":"Mattern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard","family":"Tel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50090173446_CR1","first-page":"9","volume-title":"Proc 5th International Workshop on Distributed Algorithms","author":"M Ahamad","year":"1991","unstructured":"Ahamad M, Burns JE, Hutto PW, Neiger G: Causal memory. In: P Spirakis, S Toueg (eds) Proc 5th International Workshop on Distributed Algorithms. Springer, Berlin Heidelberg New York, LNCS 579: 9\u201330 (1991)"},{"key":"50090173446_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(90)90222-J","volume":"34","author":"M Ahuja","year":"1990","unstructured":"Ahuja M: Flush primitives for asynchronous distributed systems. Inf Proc Lett 34: 5\u201312 (1990)","journal-title":"Inf Proc Lett"},{"key":"50090173446_CR3","doi-asserted-by":"crossref","unstructured":"Baeten JCM, Weijland WP: Process algebra. Vol 18 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1990","DOI":"10.1017\/CBO9780511624193"},{"key":"50090173446_CR4","doi-asserted-by":"crossref","unstructured":"Bal HE: Programming distributed systems. Prentice Hall, 1990","DOI":"10.1145\/382080.382082"},{"key":"50090173446_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/2080.357392","volume":"3","author":"AD Birell","year":"1984","unstructured":"Birell AD, Nelson BJ: Implementing remote procedure calls. ACM Trans Comput Syst 3: 39\u201359 (1984)","journal-title":"ACM Trans Comput Syst"},{"key":"50090173446_CR6","unstructured":"Birman K, van Renesse R (eds): Reliable distributed computing with the Isis toolkit. IEEE Computer Society Press, 1994"},{"key":"50090173446_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"K Birman","year":"1987","unstructured":"Birman K, Joseph TA: Reliable communication in the presence of failures. ACM Trans Comput Syst 5: 47\u201376 (1987)","journal-title":"ACM Trans Comput Syst"},{"key":"50090173446_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: 272\u2013314 (1991)","journal-title":"ACM Trans Comput Syst"},{"key":"50090173446_CR9","doi-asserted-by":"crossref","unstructured":"Bouchitte V, Habib M: The calculation of invariants for ordered sets. In: I Rival (ed) Algorithms and order. Kluwer 1989, pp 231\u2013279","DOI":"10.1007\/978-94-009-2639-4_6"},{"key":"50090173446_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(87)90005-3","volume":"49","author":"L Boug\u00e9","year":"1987","unstructured":"Boug\u00e9 L: Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP. Theor Comput Sci 49: 145\u2013169 (1987)","journal-title":"Theor Comput Sci"},{"key":"50090173446_CR11","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1145\/359642.359651","volume":"21","author":"Hansen P Brinch","year":"1978","unstructured":"Brinch Hansen P: Distributed processes: a distributed programming concept. Commun ACM 21: 934\u2013941 (1978)","journal-title":"Commun ACM"},{"key":"50090173446_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1177\/039219215900702804","volume":"28","author":"M Capek","year":"1959","unstructured":"Capek M: Towards a widening of the notion of causality. Diogenes 28: 63\u201390 (1959)","journal-title":"Diogenes"},{"key":"50090173446_CR13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1177\/039219218303112302","volume":"123","author":"M Capek","year":"1983","unstructured":"Capek M: Time-space rather than space-time. Diogenes 123: 30\u201349 (1983)","journal-title":"Diogenes"},{"key":"50090173446_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"KM Chandy","year":"1985","unstructured":"Chandy KM, Lamport L: Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst 3: 63\u201375 (1985)","journal-title":"ACM Trans Comput Syst"},{"key":"50090173446_CR15","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/24039.24050","volume":"9","author":"A Charlesworth","year":"1987","unstructured":"Charlesworth A: The multiway rendezvous. ACM Trans Program Lang Syst 9: 350\u2013366 (1987)","journal-title":"ACM Trans Program Lang Syst"},{"key":"50090173446_CR16","doi-asserted-by":"crossref","unstructured":"Cypher R, Leu E: The semantics of blocking and non-blocking send and receive primitives. Proc 8th International Parallel Processing Symposium, pp 729\u2013735, 1994","DOI":"10.1109\/IPPS.1994.288223"},{"key":"50090173446_CR17","unstructured":"Davey BA, Priestley HA: Introduction to lattices and order. Cambridge University Press, 1990"},{"key":"50090173446_CR18","unstructured":"Dijkstra EW: Shmuel Safra\u2019s version of termination detection. Tech Rep EWD 998, Department of Computer Science, The University of Texas at Austin, 1987"},{"key":"50090173446_CR19","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"EW Dijkstra","year":"1983","unstructured":"Dijkstra EW, Feijen WHJ, van Gasteren, AJM: Derivation of a termination detection algorithm for distributed computations. Inf Proc Lett 16: 217\u2013219 (1983)","journal-title":"Inf Proc Lett"},{"key":"50090173446_CR20","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/32.41333","volume":"15","author":"M Evangelist","year":"1989","unstructured":"Evangelist M, Francez N, Katz S: Multiparty interactions for interprocess communication and synchronization. IEEE Trans Softw Eng SE-15: 1417\u20131426 (1989)","journal-title":"IEEE Trans Softw Eng"},{"key":"50090173446_CR21","unstructured":"Fidge C: Dynamic analysis of event orderings in message passing systems. PhD thesis, Department of Computer Science, The Australian National University, 1989"},{"issue":"8","key":"50090173446_CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"C Fidge","year":"1991","unstructured":"Fidge C: Logical time in distributed computing systems. Computer 24(8): 28\u201333 (1991)","journal-title":"Computer"},{"key":"50090173446_CR23","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-1-4471-3534-0_18","volume-title":"Specification and verification of concurrent systems","author":"EP Gribomont","year":"1990","unstructured":"Gribomont EP: From synchronous to asynchronous communication. In: C Rattray (ed) Specification and verification of concurrent systems. Springer, Berlin Heidelberg New York 1990, pp 368\u2013383"},{"key":"50090173446_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-57981-8_126","volume-title":"Heigh-performance computing and networking","author":"R Hempel","year":"1994","unstructured":"Hempel R: The MPI standard for message passing. In: W Gentzsch, U Harms (eds) Heigh-performance computing and networking. Springer, Berlin Heidelberg New York, LNCS 797: 247\u2013252 (1994)"},{"key":"50090173446_CR25","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare CAR: Communicating sequential processes. Commun ACM 21: 666\u2013677 (1978)","journal-title":"Commun ACM"},{"key":"50090173446_CR26","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/169701.169682","volume":"15","author":"S Katz","year":"1993","unstructured":"Katz S: A superimposition control construct for distributed systems. ACM Trans Program Lang Syst 15: 337\u2013356 (1993)","journal-title":"ACM Trans Program Lang Syst"},{"key":"50090173446_CR27","doi-asserted-by":"crossref","unstructured":"Kopetz H: Sparse time versus dense time in distributed real-time systems. Proc 12th Int Conf Distr Computing Sys, pp 460\u2013467, 1992","DOI":"10.1109\/ICDCS.1992.235008"},{"key":"50090173446_CR28","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 orderings of events in a distributed system. Commun ACM 21: 558\u2013565 (1978)","journal-title":"Commun ACM"},{"key":"50090173446_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00261260","volume":"16","author":"AJ Martin","year":"1981","unstructured":"Martin AJ: An axiomatic definition of synchronization primitives. Acta Inf 16: 219\u2013235 (1981)","journal-title":"Acta Inf"},{"key":"50090173446_CR30","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":"50090173446_CR31","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-60042-6_14","volume-title":"Theory and practice in distributed systems","author":"F Mattern","year":"1995","unstructured":"Mattern F, Funfrocken S: A non-blocking lightweight implementation of causal order message delivery. In: KP Birman, F Mattern, A Schiper (eds) Theory and practice in distributed systems. Springer, Berlin Heidelberg New York, LNCS 938: 197\u2013213 (1995)"},{"key":"50090173446_CR32","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-10235-3","volume-title":"A calculus of communicating systems","author":"AJRG Milner","year":"1980","unstructured":"Milner AJRG: A calculus of communicating systems. Springer, Berlin Heidelberg New York, LNCS 92 (1980)"},{"key":"50090173446_CR33","first-page":"87","volume-title":"Global stability detection in the asynchronous distributed computations","author":"M Naimi","year":"1988","unstructured":"Naimi M: Global stability detection in the asynchronous distributed computations. Proc IEEE Workshop on Future Trends of Distributed Computing Systems in the 90\u2019s, Hong Kong, pp 87\u201392, 1988"},{"key":"50090173446_CR34","unstructured":"Nelson BJ: Remote procedure call. Tech Rep CS-81-119, Carnegie-Melon University, 1981"},{"key":"50090173446_CR35","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 Proc Lett 39: 343\u2013350 (1991)","journal-title":"Inf Proc Lett"},{"issue":"2","key":"50090173446_CR36","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1145\/155848.155857","volume":"27","author":"R Renesse van","year":"1993","unstructured":"Renesse R van: Causal controversy at Le Mont St. Michel. Oper Syst Rev 27(2): 44\u201353 (1993)","journal-title":"Oper Syst Rev"},{"key":"50090173446_CR37","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-51687-5_45","volume-title":"Distributed algorithms","author":"A Schiper","year":"1989","unstructured":"Schiper A, Eggli J, Sandoz A: A new algorithm to implement causal ordering. In: JC Bermond, M Raynal (eds) Distributed algorithms. Springer, Berlin Heidelberg New York, LNCS 392: 219\u2013223 (1989)"},{"key":"50090173446_CR38","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/579.583","volume":"6","author":"RD Schlichting","year":"1984","unstructured":"Schlichting RD, Schneider FB: Using message passing for distributed programming: proof rules and disciplines. ACM Trans Program Lang Syst 6: 402\u2013431 (1984)","journal-title":"ACM Trans Program Lang Syst"},{"key":"50090173446_CR39","unstructured":"Schmuck F: The use of efficient broadcast protocols in asynchronous distributed systems. Tech Rep 88\u2013928, Cornell University, 1988"},{"key":"50090173446_CR40","unstructured":"Seitz C: Multicomputers. In: CAR Hoare (ed) Developments in concurrency and communication. Addison-Wesley, 1990 pp 131\u2013201"},{"key":"50090173446_CR41","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MC.1984.1659159","volume":"17","author":"SM Shatz","year":"1984","unstructured":"Shatz SM: Communication mechanisms for programming distributed systems. Computer 17: 21\u201328 (1984)","journal-title":"Computer"},{"key":"50090173446_CR42","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/12.280800","volume":"43","author":"T Soneoka","year":"1994","unstructured":"Soneoka T, Ibaraki T: Logically instantaneous Message passing in asynchronous distributed systems. IEEE Trans Comput 43: 513\u2013527 (1994)","journal-title":"IEEE Trans Comput"},{"key":"50090173446_CR43","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6423(95)00002-A","volume":"24","author":"SD Stoller","year":"1995","unstructured":"Stoller SD, Schneider FB: Verifying programs that use causally-ordered message-passing. Science of Computer Programming 24: 105\u2013128 (1995)","journal-title":"Science of Computer Programming"},{"key":"50090173446_CR44","unstructured":"Tanenbaum A: Distributed operating systems. Prentice-Hall, 1995"},{"key":"50090173446_CR45","unstructured":"Tel G: Topics in distributed algorithms. Vol 1 of Cambridge International Series on Parallel Computing. Cambridge University Press, 1991"},{"key":"50090173446_CR46","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","volume":"18","author":"RW Topor","year":"1984","unstructured":"Topor RW: Termination detection for distributed computations. Inf Proc Lett 18: 33\u201336 (1984)","journal-title":"Inf Proc Lett"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050018.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s004460050018\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s004460050018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T11:45:13Z","timestamp":1578397513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s004460050018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["50090173446"],"URL":"https:\/\/doi.org\/10.1007\/s004460050018","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}