Name
Abstract | ||
|---|---|---|
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our algorithm is compositional: It performs as much computation as possible on the abstract systems, and prunes uninteresting part of the search space as early as possible. It decomposes the state space disjunctively so that each state subset can be checked in isolation to decide language emptiness for the given system. We prove that the strength of an SCC or a set of SCCs decreases monotonically with composition. This allows us to deploy the proper model checking algorithms according to the strength of the SCC at hand. We also propose to use the approximate distance of a fair cycle from the initial states to guide the search. Experimental studies on a set of LTL model checking problems prove the effectiveness of our method. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10703-006-4617-3 | Formal Methods in System Design |
Keywords | DocType | Volume |
language emptiness,model checking,abstraction refinement,LTL,BDD | Journal | 28 |
Issue | ISSN | Citations |
1 | 0925-9856 | 6 |
PageRank | References | Authors |
0.41 | 34 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Wang | 1 | 1109 | 61.81 |
| Roderick Bloem | 2 | 1708 | 101.26 |
| Gary D. Hachtel | 3 | 1069 | 140.38 |
| Kavita Ravi | 4 | 422 | 21.67 |
| Fabio Somenzi | 5 | 3394 | 302.47 |