\title{On the complementation of B{\"u}chi asynchronous cellular
  automata}

\author{Anca Muscholl}
\institute{Universit\"at Stuttgart\\
Institut f\"ur Informatik\\
Breitwiesenstr.~20-22\\
D-70565 Stuttgart}

\begin{abstract}
  We present direct subset automata constructions for asynchronous
  (asynchronous cellular, resp.) automata. This provides a solution
  to the problem of direct determinization for automata with
  distributed control for languages of finite traces. We use the
  subset automaton construction and apply Klarlund's progress
  measure technique in order to complement non-deterministic
  asynchronous cellular B{\"u}chi automata for infinite traces.
  Both constructions yield a super-exponential blow-up in the size
  of local states sets.
\end{abstract}