Communications of the ACM
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Communication and Concurrency
Verification of Parallel Systems via Decomposition
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Practical verification and synthesis of low latency asynchronous systems
Practical verification and synthesis of low latency asynchronous systems
| Hi-index | 0.00 |
Correct asynchronous hardware design is difficult, and unlike, synchronous hardware, has as yet no widely agreed design rules. Since such hardware forms a parallel system, its verification is liable to encounter state space explosion problems even for designs of relatively small scale. A considerable proportion of the state explosion results from auxiliary processes which copy control to multiple destinations (Forks) or recombine control flows (C-elements). We show how Forks and C-elements can be modelled more simply yet without loss of system properties. We further demonstrate how to reduce the state space of systems in other common design situations involving asymmetric loops in the control flow and Calls to address shared components. The techniques outlined have been applied to two practical designs and in both cases reduced verification times from days to hours on the CWB.