444 search results - page 8 / 89 » Sensitive state-space exploration |
APN
2003
Springer
14 years 3 months ago
2003
Springer
Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—...
AAAI
1996
13 years 11 months ago
1996
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
ISCAS
2003
IEEE
14 years 3 months ago
2003
IEEE
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
APN
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents the ComBack method for explicit state space exploration. The ComBack method extends the well-known hash compaction method such that full coverage of the state s...
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
Program understanding is central to the development of distributed computations, from the initial coding phase, through testing and debugging, to maintenance and support. Our goal...