Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CONCUR
2003
Springer

favoriteEmaildiscussreport

86views Distributed And Parallel Com...» more CONCUR 2003»

Synthesis of Distributed Algorithms Using Asynchronous Automata

13 years 9 months ago

Synthesis of Distributed Algorithms Using Asynchronous Automata

Download www.fmi.uni-stuttgart.de

Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework. Theorems by Zielonka and Morin are then used to develop and implement a synthesis algorithm. Finally, we apply the developed algorithms to the classic problem of mutual exclusion.

Alin Stefanescu, Javier Esparza, Anca Muscholl

Real-time Traffic

Asynchronous Automata | CONCUR 2003 | Safe Asynchronous Automata | Synthesis Problem |

claim paper

Related Content

» Unfolding Synthesis of Asynchronous Automata

» Timing analysis of asynchronous circuits using timed automata

» Bounded Synthesis

» Complexity Results for Checking Distributed Implementability

» Modeling and synthesis of service composition using tree automata

» Interface synthesis and protocol conversion

» Dealing with practical limitations of distributed timed model checking for timed automata

» Symbolic Controller Synthesis for Discrete and Timed Systems

» Transformations for the Synthesis and Optimization of Asynchronous Distributed Control

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CONCUR
Authors	Alin Stefanescu, Javier Esparza, Anca Muscholl

Comments (0)