Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata

Résumé

Asynchronous automata are parallel compositions of finite-state processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be represented by a deterministic asynchronous automaton. In this paper we improve the construction, in that the size of the obtained asynchronous automaton is polynomial in the size of a given DFA and simply exponential in the number of processes. We show that our construction is optimal within the class of automata produced by Zielonka-type constructions. In particular, we provide the first non trivial lower bound on the size of asynchronous automata.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
icalpfinal.pdf (465.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00672834 , version 1 (22-02-2012)

Identifiants

  • HAL Id : hal-00672834 , version 1

Citer

Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. International Conference on AUTOMATA, LANGUAGES AND PROGRAMMING, 2010, France. pp.52-63. ⟨hal-00672834⟩
281 Consultations
224 Téléchargements

Partager

Gmail Facebook X LinkedIn More