{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:38Z","timestamp":1747548338587},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019800","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T00:25:50Z","timestamp":1131841550000},"page":"127-143","source":"Crossref","is-referenced-by-count":4,"title":["Experience with a new distributed termination detection algorithm"],"prefix":"10.1007","author":[{"given":"Friedemann","family":"Mattern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"11_CR1","series-title":"Technical Report","volume-title":"Verteiltes Probleml\u0151sen am Beispiel von Zahlenr\u00e4tseln \u2014 Ein Experiment mit CSSA","author":"C. Beilken","year":"1986","unstructured":"Beilken C., Mattern F. (1986) Verteiltes Probleml\u0151sen am Beispiel von Zahlenr\u00e4tseln \u2014 Ein Experiment mit CSSA. Technical Report SFB124-29\/86, Department of Computer Science, University of Kaiserslautern, West-Germany"},{"key":"11_CR2","series-title":"Technical Report","volume-title":"Verte\u00eflte Terminierung \u2014 ein wesentlicher Aspekt der Kontrolle in verteilten Systemen","author":"C. Beilken","year":"1985","unstructured":"Beilken C., Mattern F., Reinfrank M. (1985) Verte\u00eflte Terminierung \u2014 ein wesentlicher Aspekt der Kontrolle in verteilten Systemen. Technical Report SFB124-41\/85, Department of Computer Science, University of Kaiserslautern, West-Germany"},{"issue":"4","key":"11_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","volume":"SE-8","author":"E.J.H. Chang","year":"1982","unstructured":"Chang E.J.H. (1982) Echo Algorithms: Depth Parallel Operations on General Graphs. IEEE Transactions on Software Engineering SE-8:4, pp. 391\u2013401","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/358598.358613","volume":"24","author":"K.M. Chandy","year":"1981","unstructured":"Chandy K.M., Misra J. (1981) Asynchronous Distributed Simulation via a Sequence of Parallel Computations. Comm. of the ACM 24:4, pp. 198\u2013205","journal-title":"Comm. of the ACM"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/BF01843569","volume":"1","author":"K.M. Chandy","year":"1986","unstructured":"Chandy K.M., Misra J. (1986) How Processes Learn. Distributed Computing 1, pp. 40\u201352","journal-title":"Distributed Computing"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra E.W., Scholten C.S. (1980) Termination Detection for Diffusing Computations. Information Processing Letters 11:1, pp. 1\u20134","journal-title":"Information Processing Letters"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/24658.24662","volume":"18","author":"D. Eppstein","year":"1987","unstructured":"Eppstein D. (1987) On the NP-Completeness of Cryptarithms. ACM SIGACT News 18:3, pp. 38\u201340","journal-title":"ACM SIGACT News"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"Francez N. (1980) Distributed Termination. ACM Trans. on Prog. Lang. and Sys. 2:1, pp. 42\u201355","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"issue":"3","key":"11_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TSE.1982.235257","volume":"SE-8","author":"N. Francez","year":"1982","unstructured":"Francez N., Rodeh M. (1982) Achieving Distributed Termination without Freezing. IEEE Transactions on Software Engineering SE-8:3, pp. 287\u2013292","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gafni E., Afek Y. (1984) Election and Traversal in Unidirectional Networks. Proc. of the 3rd Annual ACM Symposium on PODC, pp. 190\u2013198","DOI":"10.1145\/800222.806746"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(77)90033-9","volume":"8","author":"C. Hewitt","year":"1977","unstructured":"Hewitt C. (1977) Viewing Control Structures as Patterns of Passing Messages. Art. Intell. 8, pp. 323\u2013364","journal-title":"Art. Intell."},{"issue":"2","key":"11_CR12","first-page":"127","volume":"6","author":"J.-M. Helary","year":"1987","unstructured":"Helary J.-M., Maddi A., Plouzeau N., Raynal M. (1987) Parcours et apprentissage dans un reseau de processus communicants. Technique et Science Informatiques 6:2, pp. 127\u2013139","journal-title":"Technique et Science Informatiques"},{"key":"11_CR13","series-title":"Technical Report","volume-title":"Calcul distribue d'un extremum et du routage associe dans un reseau quelconque","author":"J.-M. Helary","year":"1986","unstructured":"Helary J.-M., Maddi A., Raynal M. (1986) Calcul distribue d'un extremum et du routage associe dans un reseau quelconque. Technical Report 516, INRIA, France"},{"key":"11_CR14","unstructured":"Kornfeld W.A. (1981) The Use of Parallelism to Implement a Heuristic Search. Proc. of the International Joint Conference on Artificial Intelligence, pp. 575\u2013580"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Kumar D. (1985) A Class of Termination Detection Algorithms for Distributed Computations. In: Maheshwari N. (ed) Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag, LNCS 206, pp. 73\u2013100","DOI":"10.1007\/3-540-16042-6_4"},{"key":"11_CR16","series-title":"Technical Report","volume-title":"Stepwise Construction of an Efficient Distributed Traversing Algorithm for General Strongly Connected Directed Graphs","author":"S. Kutten","year":"1987","unstructured":"Kutten S. (1987) Stepwise Construction of an Efficient Distributed Traversing Algorithm for General Strongly Connected Directed Graphs. Technical Report 431 (draft), Technion \u2014 Israel Institute of Technology, Computer Science Department, Haifa, Israel"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0743-7315(86)90015-8","volume":"3","author":"T.-H. Lai","year":"1986","unstructured":"Lai T.-H. (1986) Termination Detection for Dynamic Distributed Systems with Non-first-in-first-out Communication. Journal of Parallel and Distributed Computing 3, pp. 577\u2013599","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"11_CR18","series-title":"Technical Report","volume-title":"The Distributed Programming Language CSSA \u2014 a Very Short Introduction","author":"F. Mattern","year":"1985","unstructured":"Mattern F., Beilken C. (1985) The Distributed Programming Language CSSA \u2014 a Very Short Introduction. Technical Report 123\/85, Department of Computer Science, University of Kaiserslautern, West-Germany"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Mattern F. (1987) Algorithms for Distributed Termination Detection. Distributed Computing 2:4 (to appear)","DOI":"10.1007\/BF01782776"},{"key":"11_CR20","series-title":"Technical Report","volume-title":"Asynchronous Distributed Termination \u2014 Parallel and Symmetric Solutions with Echo Algorithms","author":"F. Mattern","year":"1987","unstructured":"Mattern F. (1987) Asynchronous Distributed Termination \u2014 Parallel and Symmetric Solutions with Echo Algorithms. Technical Report SFB124-21\/87, Department of Computer Science, University of Kaiserslautern, West-Germany"},{"issue":"8","key":"11_CR21","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TSE.1987.233510","volume":"SE-13","author":"J. Nehmer","year":"1987","unstructured":"Nehmer J., Haban D., Mattern F., Rombach D., Wybranietz D. (1987) Key Concepts of the INCAS Multicomputer Project. IEEE Transactions on Software Engineering SE-13:8, pp. 913\u2013923","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segal","year":"1983","unstructured":"Segal A. (1983) Distributed Network Protocols. IEEE Transactions on Inforamtion Theory IT-29:1, pp. 23\u201335","journal-title":"IEEE Transactions on Inforamtion Theory"},{"key":"11_CR23","series-title":"Technical Report","volume-title":"A New Approach to Detection of Locally Indicative Stability","author":"N. Shavit","year":"1986","unstructured":"Shavit N., Francez N. (1986) A New Approach to Detection of Locally Indicative Stability. Technical Report RC 11925, IBM Th. J. Watson Research Center, Yorktown Heights, USA"},{"key":"11_CR24","series-title":"Technical Report","volume-title":"General Symmetric Distributed Termination Detection","author":"R.B. Tan","year":"1986","unstructured":"Tan R.B., Van Leeuwen J. (1986) General Symmetric Distributed Termination Detection. Technical Report RUU-CS-86-2, Computer Science Department, University of Utrecht, Utrecht, The Netherlands"},{"key":"11_CR25","unstructured":"Tel G. (1987) Directed Network Protocols. In: Gafni E., Raynal M., Santoro N., van Leeuwen J., Zaks S. (eds) Proc. 2nd Int. Workshop on Distributed Algorithms, Springer-Verlag, LNCS"},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","volume":"18","author":"R.W. Topor","year":"1984","unstructured":"Topor R.W. (1984) Termination Detection for Distributed Computations. Information Processing Letters 18:1, pp. 33\u201336","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T05:15:15Z","timestamp":1549257315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0019800","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}