{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:45Z","timestamp":1725663045679},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_69","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:50:50Z","timestamp":1330195850000},"page":"196-205","source":"Crossref","is-referenced-by-count":1,"title":["A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication"],"prefix":"10.1007","author":[{"given":"Ten-Hwang","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"Chandy, K. M. and Lamport, L. \u201cDistributed snapshots: determining global states of distributed systems\u201d. ACM Trans. Comp. Syst. 3, 1 (1985), 63\u201375.","journal-title":"ACM Trans. Comp. Syst."},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01843564","volume":"1","author":"K. M. Chandy","year":"1986","unstructured":"Chandy, K. M. and Misra, J. \u201cHow processes learn\u201d. Distributed Computing 1, 1 (1986). (Extended abstract available in Proc. Fourth Annual ACM Symp. on Principles of Distributed Computing, pp. 204\u2013214, 1985.).","journal-title":"Distributed Computing"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Cohen, S. and Lehmann, D. Dynamic systems and their distributed termination. Proc. First Annual ACM Symp. on Principles of Distributed Computing, Ottawa, August, 1982, pp. 29\u201333.","DOI":"10.1145\/800220.806678"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra, E.W., Scholoten, C.S. \u201cTermination detection for diffusing computations\u201d. Inform. Processing Lett. 11 (1980), 1\u20134.","journal-title":"Inform. Processing Lett."},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E.W. Dijkstra","year":"1983","unstructured":"Dijkstra, E.W., Feijen, W.H.J., and van Gasteren, A.J.M. \u201cDerivation of a termination detection algorithm for distributed computations\u201d. Inform. Processing Lett. 16 (1983), 217\u2013219.","journal-title":"Inform. Processing Lett."},{"key":"21_CR6","volume-title":"Coordinated Computing","author":"R. Filman","year":"1984","unstructured":"Filman, R. and Friedman, D.. Coordinated Computing. McGraw-Hill Book Co., New York, 1984."},{"issue":"1","key":"21_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"Francez, N. and Rodeh, M. \u201cDistributed termination\u201d. ACM Trans. Program. Lang. Syst. 2, 1 (1980), 42\u201355.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Francez, N., Rodeh, M., and Sintzoff, M. Distributed termination with interval assertions. Proc. Intl. Colloq. Formalization of Programming Concepts, Peniscola, Spain, April, 1981, pp. 280\u2013291. Lecture Notes in Computer Science, Vol. 107, Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10699-5_105"},{"issue":"3","key":"21_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. and Rodeh, M. \u201cAchieving distributed termination without freezing\u201d. IEEE Trans. Software Engineering SE-8, 3 (1982), 287\u2013292.","journal-title":"IEEE Trans. Software Engineering"},{"key":"21_CR10","volume-title":"Termination detection for dynamic distributed systems with non-first-in-first-out communication","author":"T. H. Lai","year":"1985","unstructured":"Lai, T. H. Termination detection for dynamic distributed systems with non-first-in-first-out communication. Dept. of Computer and Information, Ohio State Univ., Columbus, Ohio, 1985."},{"key":"21_CR11","unstructured":"Lozinskii, E. A remark on distributed termination. Proc. Fifth Intl. Conf. on Distributed Computing Systems, Denver, 1985, pp. 416\u2013419."},{"issue":"1","key":"21_CR12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/357153.357156","volume":"4","author":"J. Misra","year":"1982","unstructured":"Misra, J. and Chandy, K. M. \u201cTermination Detection of diffusing computations in communicating sequential processes\u201d. ACM Trans. Program. Lang. Syst. 4, 1 (1982), 37\u201343.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Misra, J. Detecting termination of distributed computations using markers. Proc. Second Annual ACM Symp. on Principles of Distributed Computing, Montreal, August, 1983, pp. 290\u2013294.","DOI":"10.1145\/800221.806729"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Szymanski, B., Shi, Y., and Prywes, N. Terminating iterative solution of simultaneous equations in distributed message passing systems. Proc. Fourth Annual ACM Symp. on Principles of Distributed Computing, Minaki, Ontario, August, 1985, pp. 287\u2013292.","DOI":"10.1145\/323596.323623"},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","volume":"18","author":"R. Topor","year":"1984","unstructured":"Topor, R. \u201cTermination detection for distributed computations\u201d. Inform. Processing Lett. 18 (1984), 33\u201336.","journal-title":"Inform. Processing Lett."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:11Z","timestamp":1619557511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}