Verifying Temporal Properties of Sequential Machines without Building Their State Diagrams

This paper presents the algorithm we have developed for proving that a finite state machine holds some properties expressed in temporal logic. This algorithm does not require the building of the state-transition graph nor the transition relation of the machine, so it overcomes the limits of the methods that have been proposed in the past. The verification algorithm presented here is based on Boolean function manipulations, which are represented by typed decision graphs. Thanks to this canonical representation, all the operations used in the algorithm have a polynomial complexity, expect for one called the computation of the “critical term”. The paper proposes techniques that reduce the computational cost of this operation.

[1]  E. Clarke,et al.  Sequential circuit verification using symbolic model checking , 1990, 27th ACM/IEEE Design Automation Conference.

[2]  Olivier Coudert,et al.  Formal Boolean manipulations for the verification of sequential machines , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[3]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[4]  Gerard J. Holzmann,et al.  Algorithms for Automated Protocol Validation , 1988 .

[5]  Orna Grumberg,et al.  Research on Automatic Verification of Finite-State Concurrent Systems , 1987 .

[6]  R. Bryant Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[7]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.