Monotonic abstraction-refinement for CTL (2004)
| Venue: | In TACAS |
| Citations: | 23 - 3 self |
BibTeX
@INPROCEEDINGS{Shoham04monotonicabstraction-refinement,
author = {Sharon Shoham and Orna Grumberg},
title = {Monotonic abstraction-refinement for CTL},
booktitle = {In TACAS},
year = {2004},
pages = {546--560},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. The goal of this work is to improve the efficiency and effectiveness of the abstraction-refinement framework for CTL over the 3-valued semantics. We start by proposing a symbolic (BDD-based) approach for this framework. Next, we generalize the definition of abstract models in order to provide a monotonic abstraction-refinement framework. To do so, we introduce the notion of hypertransitions. model in which more CTL formulae can be proved or disproved. We suggest an automatic construction of an initial abstract model and its successive refined models. We complete the framework by adjusting the BDD-based approach to the new monotonic framework. Thus, we obtain a monotonic, symbolic framework that is suitable for both verification and falsification of full CTL. 1
