346 search results - page 22 / 70 » Determinizing Asynchronous Automata |
ICCAD
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents an efficient method for verifying hazard freedom in timed asynchronous circuits. Timed circuits are a class of asynchronous circuits that utilize explicit tim...
ICCI
1993
15 years 2 months ago
1993
A distributed algorithm for finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the alg...
APN
2006
Springer
15 years 1 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...
ACSD
2007
IEEE
15 years 4 months ago
2007
IEEE
Signal Transition Graphs (STG) are a formalism for the description of asynchronous circuit behaviour. In this paper we propose (and justify) a formal semantics of nondeterministic...
HYBRID
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We use discrete quadratic Lyapunov functions to design controllers for a class of systems where time intervals between state measurements are longer than time intervals b...