1159 search results - page 130 / 232 » Binary Decision Graphs |
150
click to vote
CHARME
2001
Springer
15 years 9 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
153
click to vote
DATE
2000
IEEE
15 years 9 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
167
click to vote
ISSTA
1998
ACM
15 years 9 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...
146
click to vote
HPCN
1997
Springer
15 years 9 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
178
click to vote
ICTAI
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper proposes an optimization algorithm for reducing the power dissipation in a sequential circuit. The encoding of the different states in a Finite State Machine is modifie...