{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:45:25Z","timestamp":1765993525664},"reference-count":45,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Systems and Software"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0164-1212(98)10034-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:13:11Z","timestamp":1027613591000},"page":"207-221","source":"Crossref","is-referenced-by-count":55,"title":["A taxonomy of distributed termination detection algorithms"],"prefix":"10.1016","volume":"43","author":[{"given":"Jeff","family":"Matocha","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Tracy","family":"Camp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0306-4379(83)90028-5","article-title":"A methodology to solve the distributed termination problem","volume":"8","author":"Arora","year":"1983","journal-title":"Inform. Systems"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0743-7315(90)90099-B","article-title":"A message-optimal algorithm for distributed termination detection","volume":"8","author":"Chandrasekaran","year":"1990","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: Determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB4","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., Misra, J., 1985. A paradigm for detecting quiescent properties in distributed computations. In: Apt, K.R. (Ed.), Logics and Models of Concurrent Systems. Springer, New York","DOI":"10.1007\/978-3-642-82453-1_11"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB5","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., Misra, J., 1986a. An example of stepwise refinement of distributed programs: Quiescence detection. ACM Trans. Programming Languages and Systems 8 (3), 326\u2013343","DOI":"10.1145\/5956.5958"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB6","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., Misra, J., 1986b. How processes learn. Distributed Computing 1 (1), 40\u201352","DOI":"10.1007\/BF01843569"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB7","doi-asserted-by":"crossref","unstructured":"Cohen, S., Lehmann, D., 1983. Dynamic systems and their distributed termination. In: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 29\u201333","DOI":"10.1145\/800220.806678"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB8","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., 1990. Introduction to Algorithms. McGraw-Hill, New York"},{"issue":"5","key":"10.1016\/S0164-1212(98)10034-1_BIB9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","article-title":"Derivation of a termination detection algorithm for distributed computations","volume":"16","author":"Dijkstra","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","article-title":"Termination detection for diffusing computations","volume":"11","author":"Dijkstra","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0164-1212(98)10034-1_BIB11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB12","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"3","key":"10.1016\/S0164-1212(98)10034-1_BIB13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TSE.1982.235257","article-title":"Achieving distributed termination without freezing","volume":"8","author":"Francez","year":"1982","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB14","doi-asserted-by":"crossref","unstructured":"Francez, N., Rodeh, M., Sintzoff, M., 1981. Distributed termination with interval assertions. In: Formalization of Programming Concepts, Lecture Notes in Computer Science, vol. 107. Springer, New York","DOI":"10.1007\/3-540-10699-5_105"},{"issue":"3","key":"10.1016\/S0164-1212(98)10034-1_BIB15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(88)90053-1","article-title":"Ring based termination detection algorithm for distributed computations","volume":"29","author":"Haldar","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"10.1016\/S0164-1212(98)10034-1_BIB16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0020-0190(87)90152-9","article-title":"A distributed algorithm for distributed termination","volume":"25","author":"Hazari","year":"1987","journal-title":"Inform. Process. Lett."},{"issue":"8","key":"10.1016\/S0164-1212(98)10034-1_BIB17","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0020-0190(88)90125-1","article-title":"A fully distributed termination detection scheme","volume":"29","author":"Huang","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB19","doi-asserted-by":"crossref","unstructured":"Huang, S., 1989. Detecting termination of distributed computations by external agents. In: IEEE Nineth International Conference on Distributed Computer Systems, pp. 79\u201384","DOI":"10.1109\/ICDCS.1989.37933"},{"issue":"4","key":"10.1016\/S0164-1212(98)10034-1_BIB20","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(88)90023-3","article-title":"Effects of message loss on the termination of distributed protocols","volume":"27","author":"Koo","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB21","doi-asserted-by":"crossref","unstructured":"Kumar, D., 1985. A class of termination detection algorithms for distributed computations. In: Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 73\u2013100","DOI":"10.1007\/3-540-16042-6_4"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB22","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0743-7315(86)90015-8","article-title":"Termination detection for dynamically distributed systems with non-first-in-first-out communication","volume":"3","author":"Lai","year":"1986","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB23","doi-asserted-by":"crossref","unstructured":"Lai, T., Tseng, Y., and Dong, X., 1992. A more efficient message-optimal algorithm for distributed termination detection. In: Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, pp. 274\u2013281","DOI":"10.1109\/SPDP.1992.242734"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB24","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/71.363410","article-title":"An (n\u22121)-resilient algorithm for distributed termination detection","volume":"6","author":"Lai","year":"1995","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"7","key":"10.1016\/S0164-1212(98)10034-1_BIB25","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/S0164-1212(98)10034-1_BIB26","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"4","key":"10.1016\/S0164-1212(98)10034-1_BIB27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01782776","article-title":"Algorithms for distributed temination detection","volume":"2","author":"Mattern","year":"1987","journal-title":"Distributed Computing"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB28","doi-asserted-by":"crossref","unstructured":"Mattern, F., 1987b. Experience with a new distributed termination detection algorithm. In: Proceedings of the Second International Workshop on Distributed Algorithms, pp. 127\u2013143","DOI":"10.1007\/BFb0019800"},{"issue":"4","key":"10.1016\/S0164-1212(98)10034-1_BIB29","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(89)90212-3","article-title":"Global quiescence detection based on credit distribution and recovery","volume":"30","author":"Mattern","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0164-1212(98)10034-1_BIB30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(94)00129-4","article-title":"Distributed termination detection with roughly synchronized clocks","volume":"52","author":"Mayo","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB31","doi-asserted-by":"crossref","unstructured":"Misra, J., 1983. Detecting termination of distributed computations using markers. In: Proceedings of The Second Annual ACM Symposium on Principles of Distributed Computing, pp. 290\u2013294","DOI":"10.1145\/800221.806729"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB32","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/357153.357156","article-title":"Termination detection of diffusing computations in communicating sequential processes","volume":"4","author":"Misra","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB33","doi-asserted-by":"crossref","unstructured":"Muller, H., 1987. High level petri nets and distributed termination. In: Concurrency and Nets: Advances in Petri Nets. Springer, New York","DOI":"10.1007\/978-3-642-72822-8_23"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0020-0190(83)90089-3","article-title":"A distributed solution to the distributed termination problem","volume":"17","author":"Rana","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB35","unstructured":"Rokusawa, K., Iciyoshi, N., Chikayama, T., Nakashima, H., 1988. An efficient termination detection and abortion algorithm for distributed processing systems. In: Proceedings of the International Conference on Parallel Processing, pp. 18\u201322"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB36","unstructured":"Sanders, B.A., 1987. A method for the construction of probe-based termination detection algorithms. In: Proceedings of IFIP Conference on Distributed Processing, 1987, pp. 249\u2013257"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB37","doi-asserted-by":"crossref","unstructured":"Shavit, N., Francez, N., 1986. A new approach to the detection of locally indicative stability. In: Kott, L. (Ed.), International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 226. Springer, New York, pp. 344\u2013358","DOI":"10.1007\/3-540-16761-7_84"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB38","doi-asserted-by":"crossref","unstructured":"Skyum, S., Eriksen, O., 1986. Symmetric distributed termination. In: The Book of L. Springer, New York","DOI":"10.1007\/978-3-642-95486-3_36"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB39","doi-asserted-by":"crossref","unstructured":"Szymanski, B., Shi, Y., Prywes, N.S., 1985a. Terminating iterative solution of simultaneous equations in distributed message passing systems. In: Proceedings of the Fourth Annual ACM Symposium on the Principles of Distributed Computing, pp. 287\u2013292","DOI":"10.1145\/323596.323623"},{"issue":"10","key":"10.1016\/S0164-1212(98)10034-1_BIB40","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1109\/TSE.1985.231861","article-title":"Synchronized distributed termination","volume":"11","author":"Szymanski","year":"1985","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB41","doi-asserted-by":"crossref","unstructured":"Tel, G., 1994. Introduction to Distributed Algorithms. Cambridge Univ. Press, Cambridge, pp. 264\u2013302","DOI":"10.1007\/BFb0020419"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB42","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","article-title":"Termination detection for distributed computations","volume":"18","author":"Topor","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0164-1212(98)10034-1_BIB43","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1006\/jpdc.1995.1025","article-title":"Detecting termination by weight-throwing in a faulty distributed system","volume":"25","author":"Tseng","year":"1995","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"10.1016\/S0164-1212(98)10034-1_BIB44","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/24.24583","article-title":"Reliable protocols for distributed termination detection","volume":"38","author":"Venkatesan","year":"1989","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/S0164-1212(98)10034-1_BIB45","unstructured":"Ye, X., Keane, J.A., 1991. A distributed termination detection scheme, Tech. Rep. UMCS-91-3-1, University of Manchester, Manchester, England"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121298100341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121298100341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:31:33Z","timestamp":1578713493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121298100341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0164121298100341"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(98)10034-1","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}