Date of Original Version

7-1993

Type

Technical Report

Rights Management

All Rights Reserved

Abstract or Description

The temporal logic model checking algorithm of Clarke, Emerson, and Sistla (1986) is modified to represent state graphs using binary decision diagrams (BDD's) and partitioned transition relations. Because this representation captures some of the regularity in the state space of circuits with data path logic, we are able to verify circuits with an extremely large number of states. We demonstrate this new technique on a synchronous pipelined design with approximately 5×10120 states. Our model checking algorithm handles full CTL with fairness constraints. Consequently, we are able to express a number of important liveness and fairness properties, which would otherwise not be expressible in CTL. We give empirical results on the performance of the algorithm applied to both synchronous and asynchronous circuits with data path logic

DOI

10.1109/43.275352

Share

COinS
 

Published In

IEEE Transactions On Computer-Aided Design of Intergrated Circuits and Systems, 13, 4, 401-424.