Implementing Realistic Asynchronous Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Implementing Realistic Asynchronous Automata

Résumé

Zielonka's theorem, established 25 years ago, states that any regular language closed under commutation is the language of an asynchronous automaton (a tuple of automata, one per process, exchanging information when performing common actions). Since then, constructing asynchronous automata has been simplified and improved. We first survey these constructions and conclude that the synthesized systems are not realistic in the following sense: existing constructions are either plagued by deadends, non deterministic guesses, or the acceptance condition or choice of actions are not distributed. We tackle this problem by giving (effectively testable) necessary and sufficient conditions which ensure that deadends can be avoided, acceptance condition and choices of action can be distributed, and determinism can be maintained. Finally, we implement our constructions, giving promising results when compared with the few other existing prototypes synthesizing asynchronous automata.

Domaines

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

Dates et versions

hal-00920776 , version 1 (19-12-2013)

Identifiants

  • HAL Id : hal-00920776 , version 1

Citer

Sundararaman Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu. Implementing Realistic Asynchronous Automata. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, Dec 2013, Guwahati, India. pp.213-224. ⟨hal-00920776⟩
719 Consultations
181 Téléchargements

Partager

Gmail Facebook X LinkedIn More