Counterexample-guided abstraction refinement for the analysis of graph transformation systems (2006)
Cached
Download Links
- [www.ti.inf.uni-due.de]
- [www.fmi.uni-stuttgart.de]
- DBLP
Other Repositories/Bibliography
| Venue: | IN: PROC. OF TACAS ’06 |
| Citations: | 10 - 2 self |
BibTeX
@INPROCEEDINGS{König06counterexample-guidedabstraction,
author = {Barbara König and Vitali Kozioura},
title = {Counterexample-guided abstraction refinement for the analysis of graph transformation systems},
booktitle = {IN: PROC. OF TACAS ’06},
year = {2006},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Graph transformation systems are a general specification language for systems with dynamically changing topologies, such as mobile and distributed systems. We propose a counterexample-guided abstraction refinement technique which is based on the over-approximation of graph transformation systems (gts) by Petri nets. We show that a spurious counterexample is caused by merging nodes during the approximation. We present a technique for identifying these merged nodes and splitting them using abstraction refinement, which removes the spurious run. The technique has been implemented in the Augur tool and experimental results are discussed.
