2002 · 26 citations · 8 references
ComputingComputer EngineeringComputer ScienceFormal MethodsModel-based Systems EngineeringSystems ModelingFinite State Machine ModelingModel CheckingVerificationTransition Systems
We present a CTL model checking algorithm based mainly on forward state traversal, which can check many realistic CTL properties without doing backward state traversal. This algorithm is effective in many situations where backward state traversal is more expensive than forward state traversal. We combine it with BDD-based state traversal techniques using partitioned transition relations. Experimental results show that our method can verify actual CTL properties of large industrial models which cannot be handled by conventional model checkers.
8
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
Implicit state enumeration of finite state machines using BDD's
H.J. Touati, H. Savoj, Binshan Lin et al. · 2002 · 403 citations
Efficient generation of counterexamples and witnesses in symbolic model checking
E. M. Clarke, Orna Grümberg, Kenneth L. McMillan et al. · 1995 · 220 citations · Full text