14 search results - page 1 / 3 » Unfolding Synthesis of Asynchronous Automata |
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...
APN
2006
Springer
13 years 8 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
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...
ACSD
2004
IEEE
13 years 8 months ago
2004
IEEE
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of...
ACSD
1998
IEEE
13 years 9 months ago
1998
IEEE
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...