@InProceedings{	  MetivierMW97,
  author	= "Yves M{\'e}tivier and Anca Muscholl and Pierre-Andr{\'e}
		  Wacrenier",
  title		= "About the local detection of termination of local
		  computations in graphs",
  booktitle	= "SIROCCO'97, 4th International Colloquium on Structural
		  Information {\&} Communication Complexity, Monte Verita,
		  Ascona, Switzerland, July 24-26, 1997",
  year		= "1997",
  pages		= "188--200",
  publisher	= "Carleton Scientific",
  abstract	= "In this paper we give a formalization of the problem of
		  locally detecting the global termination of distributed
		  algorithms on graphs. We introduce the notion of quasi
		  $k-$coverings. Using (quasi) $k-$coverings, we present
		  methods for showing that it is not possible to detect
		  locally the global termination of local computations in
		  certain families of graphs. These methods also allow to
		  show that some knowledge, e.g.~the size of the graph, is
		  necessary in order to solve certain problems in a
		  distributed way."
}