14 search results - page 3 / 3 » Unfolding Synthesis of Asynchronous Automata |
ACSD
2005
IEEE
13 years 11 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...
FOSSACS
2009
Springer
14 years 3 days ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
ATS
2000
IEEE
13 years 9 months ago
2000
IEEE
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper pre...
HYBRID
1994
Springer
13 years 9 months ago
1994
Springer
This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for...