Model Checking with formula-dependent abstract models (2001)
| Venue: | In Computer-Aided Verification (CAV), volume 2102 of LNCS |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Asteroth01modelchecking,
author = {Alexander Asteroth and Christel Baier and Ulrich Aßmann},
title = {Model Checking with formula-dependent abstract models},
booktitle = {In Computer-Aided Verification (CAV), volume 2102 of LNCS},
year = {2001},
pages = {155--168}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a model checking algorithm for ∀CTL (and full CTL) which uses an iterative abstraction refinement strategy. In each iteration we call a standard model checker for the abstract models A_i. If A_i does not satisfy Φ we refine the abstract model A_i yielding another abstract model A_i+1 and (re-)call the model checker to A_i+1. Otherwise the formula holds for the original system M. Our algorithm terminates at least for all transition systems M that have a finite simulation or bisimulation quotient. In contrast to other abstraction refinement algorithms, we always work with abstract models whose size just depend on the length of the formula Φ (but not on the size of the system which might be infinite).
