@InProceedings{	  dm93,
  author	= "Volker Diekert and Anca Muscholl",
  address	= "Heidelberg",
  booktitle	= "Proc. 10th Annual Symposium on Theoretical Aspects of
		  Computer Science (STACS'93), W{\"u}rzburg (Germany), 1993",
  editor	= "P. Enjalbert and A. Finkel and K. W. Wagner",
  volume	= "665",
  pages		= "617--628",
  publisher	= "Springer-Verlag",
  series	= "Lecture Notes in Computer Science",
  title		= "Deterministic asynchronous automata for infinite traces",
  year		= "1993",
  note		= "Extended version in \cite{dm94a}",
  abstract	= "This paper shows the equivalence between the family of
		  recognizable languages over infinite traces and the family
		  of languages accepted by deterministic asynchronous
		  cellular Muller automata. We thus give a proper
		  generalization of McNaughton's Theorem from infinite words
		  to infinite traces, thus solving one of the main open
		  problems in this field. As a special case we obtain that
		  every closed (w.r.t.~the independence relation) word
		  language is accepted by some $I$-diamond deterministic
		  Muller automaton.",
  doi		= "10.1007/3-540-56503-5_61"
}