Recognizable trace languages, distributed automata and the distribution problem

@article{Petit1993RecognizableTL,
  title={Recognizable trace languages, distributed automata and the distribution problem},
  author={Antoine Petit},
  journal={Acta Informatica},
  year={1993},
  volume={30},
  pages={89-101}
}
We introduce new finite state “parallel machines,” the (ℕ-)distributed automata, for trace languages. We prove that these machines give a new characterization of recognizable trace languages: a trace language is recognizable if and only if it is recognized by a (ℕ-)distributed automaton. At last, we show how the classical problem of distribution of uninterpreted tasks on several processors can be straightforward modelized by recognizable trace languages and solved using (ℕ-)distributed.