Hierarchical verification of asynchronous circuits using temporal logic

https://doi.org/10.1016/0304-3975(85)90223-3Get rights and content
Under an Elsevier user license
open archive

Abstract

Establishing the correctness of complicated asynchronous circuit is in general quite difficult because of the high degree of nondeterminism that is inherent in such devices. Nevertheless, it is also very important in view of the cost involved in design and testing of circuits. We show how to give specifications for circuits in a branching time temporal logic and how to mechanically verify them using a simple and efficient model checker. We also show how to tackle a large and complex circuit by verifying it hierarchically.

Cited by (0)

This research was supported by NSF under Grant No. MCS-82-16706.