{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:39Z","timestamp":1759205319739},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_10","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:13:34Z","timestamp":1188299614000},"page":"106-119","source":"Crossref","is-referenced-by-count":11,"title":["Termination Detection of Distributed Algorithms by Graph Relabelling Systems"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Godard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"M\u00e9tivier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Afif","family":"Sellami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"10_CR1","unstructured":"M. Bauderon, S. Gruner, Y. M\u00e9tivier, M. Mosbah, and A. Sellami. Visualization of distributed algorithms based on labeled rewriting systems. In Second International Workshop on Graph Transformation and Visual Modeling Techniques, Crete, Greece, July 12\u201313, 2001."},{"key":"10_CR2","unstructured":"M. Bauderon, Y. M\u00e9tivier, M. Mosbah, and A. Sellami. From local computations to asynchronous message passing systems. Technical Report RR-1271-02, LaBRI, 2002."},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","first-page":"94","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Billaud","year":"1989","unstructured":"M. Billaud, P. Lafon, Y. M\u00e9tivier, and E. Sopena. Graph rewriting systems with priorities. Lecture notes in computer science, 411:94\u2013106, 1989."},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. M. Chandy","year":"1985","unstructured":"K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Transations on Computer Systems, 3(1):63\u201375, 1985.","journal-title":"ACM Transations on Computer Systems"},{"issue":"2","key":"10_CR5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/357360.357365","volume":"1","author":"K. Mani Chandy","year":"1983","unstructured":"K. Mani Chandy, Laura M. Haas, and Jayadev Misra. Distributed deadlock detection. ACM Transactions on Computer Systems, 1(2):144\u2013156, May 1983.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E. W. Dijkstra","year":"1983","unstructured":"Edsger W. Dijkstra, W. H. J. Feijen, and A. J. M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, 16(5):217\u2013219, 1983.","journal-title":"Information Processing Letters"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"E.W. Dijkstra and C.S. Sholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1\u20134, 1980.","journal-title":"Information Processing Letters"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"S. Dolev. Self-stabilization. The MIT Press, 2000.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"E. Godard, Y. M\u00e9tivier, M. Mosbah, and A. Sellami. Termination detection of distributed algorithms by graph relabelling systems. Technical report, LaBRI-University of Bordeaux 1, 2002.","DOI":"10.1007\/3-540-45832-8_10"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"I. Litovsky and Y. M\u00e9tivier. Computing trees with graph rewriting systems with priorities. Tree automata and languages, pages 115\u2013139, 1992.","DOI":"10.1016\/0304-3975(93)90116-B"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(93)90116-B","volume":"115","author":"I. Litovsky","year":"1993","unstructured":"I. Litovsky and Y. M\u00e9tivier. Computing with graph rewriting systems with priorities. Theoret. Comput. Sci., 115:191\u2013224, 1993.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01294595","volume":"28","author":"I. Litovsky","year":"1995","unstructured":"I. Litovsky, Y. M\u00e9tivier, and E. Sopena. Different local controls for graph relabelling systems. Math. Syst. Theory, 28:41\u201365, 1995.","journal-title":"Math. Syst. Theory"},{"key":"10_CR13","unstructured":"Y. M\u00e9tivier, M. Mosbah, and A. Sellami. Proving distributed algorithms by graph relabeling systems: Examples of trees in networks with processor identities. In Applied Graph Transformations, Grenoble, April, 2002."},{"key":"10_CR14","unstructured":"Y. M\u00e9tivier and G. Tel. Termination detection and universal graph reconstruction. In International Colloquium on structural information and communication complexity, pages 237\u2013251. Carleton scientific press, 2000."},{"key":"10_CR15","unstructured":"M. Mosbah and A. Sellami. Visidia: A tool for the visualization and similation of distributed algorithms. http:\/\/www.labri.fr\/visidia\/ ."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.","DOI":"10.1017\/CBO9781139168724"},{"issue":"1","key":"10_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/151646.151647","volume":"15","author":"Gerard Tel and Friedemann Mattern","year":"1993","unstructured":"Gerard Tel and Friedemann Mattern. The derivation of distributed termination detection algorithms from garbage collection schemes. ACM Transactions on Programming Languages and Systems, 15(1):1\u201335, January 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"B. Szymanski Y. Shi and N. Prywes. Terminating iterative solutions of simultaneous equations in distributed message passing systems. In 4th International Conference on Distributed Computing Systems, pages 287\u2013292, 1985.","DOI":"10.1145\/323596.323623"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:12:59Z","timestamp":1556802779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}