论文信息 - On Computing the Transitive Closure of a State Transition Relation

On Computing the Transitive Closure of a State Transition Relation

We describe a new, recursive-descent procedure for the computation of the transitive closure of a transition relation. This procedure is the classic binary matrix procedure of [1], adapted to a BDD data structure. We demonstrate its efficacy when compared to standard iterative methods.

[1] Olivier Coudert,et al. A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2] K. Karplus. REPRESENTING BOOLEAN FUNCTIONS WITH IF-THEN-ELSE DAGs , 1988 .

[3] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[4] David S. Johnson,et al. Representing Boolean Functions with If-Then-Else DAGs , 1988 .

[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[6] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.

[7] Joseph Sifakis,et al. Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[8] Edmund M. Clarke,et al. Sequential circuit verification using symbolic model checking , 1991, DAC '90.

[9] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.