4 search results - page 1 / 1 » Symbolic Reachability Analysis of Large Finite State Machine... |
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
Reachability analysis of finite state machines is essential to many computer-aided design applications. We present new techniques to improve both approximate and exact reachabilit...
DAC
1994
ACM
13 years 8 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
ISSTA
1998
ACM
13 years 8 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
ASPDAC
2001
ACM
13 years 8 months ago
2001
ACM
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...