High-density reachability analysis
We address the problem of reachability analysis for large finite state systems. Symbolic techniques have revolutionized reachability analysis but still have limitations in traversing large systems. We present techniques to improve the symbolic breadth-first traversal and compute a lower bound on the...
Saved in:
Published in | Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design pp. 154 - 158 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
Washington, DC, USA
IEEE Computer Society
01.12.1995
|
Series | ACM Conferences |
Subjects | |
Online Access | Get full text |
ISBN | 9780818672132 0818672137 |
DOI | 10.5555/224841.224874 |
Cover
Summary: | We address the problem of reachability analysis for large finite state systems. Symbolic techniques have revolutionized reachability analysis but still have limitations in traversing large systems. We present techniques to improve the symbolic breadth-first traversal and compute a lower bound on the reachable states. We identify the problem as one of density during traversal and our techniques seek to improve the same. Our results show a marked improvement on the existing breadth-first traversal methods. |
---|---|
ISBN: | 9780818672132 0818672137 |
DOI: | 10.5555/224841.224874 |