413 search results - page 1 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
CONCUR
2003
Springer
13 years 10 months ago
2003
Springer
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 charac...
CSR
2006
Springer
13 years 8 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
CHARME
1995
Springer
13 years 8 months ago
1995
Springer
In this paper we present a method formodeling asynchronous digital circuits by timed automata. The constructed timed automata serve as \mechanical" and veri able objects for a...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
ACSD
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...