On recognizable trace languages
Résumé
Traces are a classical model of distributed computations. The theory of recognizable trace languages has been developed since the 1980s, but it has failed to achieve the same descriptive power as the theory of languages of finite words. We introduce a new algebraic model to discuss and classify recognizable trace languages, which takes explicitly into account the multiplicative structure, but also the independence structure of the trace monoid. We show that this tool allows the proof of an Eilenberg-like variety theorem, and that it can be used to give an algebraic characterization of the levels of the alternation hierarchy for first-order logic.
Fichier principal
automatha07.pdf (74.07 Ko)
Télécharger le fichier
2007-06-MondelloHandout.pdf (99.32 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre