Graph Subsumption in Abstract State Space Exploration
Logic in Computer Science
2012-10-25 v1
Abstract
In this paper we present the extension of an existing method for abstract graph-based state space exploration, called neighbourhood abstraction, with a reduction technique based on subsumption. Basically, one abstract state subsumes another when it covers more concrete states; in such a case, the subsumed state need not be included in the state space, thus giving a reduction. We explain the theory and especially also report on a number of experiments, which show that subsumption indeed drastically reduces both the state space and the resources (time and memory) needed to compute it.
Cite
@article{arxiv.1210.6413,
title = {Graph Subsumption in Abstract State Space Exploration},
author = {Eduardo Zambon and Arend Rensink},
journal= {arXiv preprint arXiv:1210.6413},
year = {2012}
}
Comments
In Proceedings GRAPHITE 2012, arXiv:1210.6118