Graph transformation systems (GTSs) can be seen as wellstructured transition systems (WSTSs), thus obtaining decidability results for certain classes of GTSs. In earlier work it was shown that wellstructuredness can be obtained using the minor ordering as a well-quasiorder. In this paper we extend this idea to obtain a general framework in which several types of GTSs can be seen as (restricted) WSTSs. We instantiate this framework with the subgraph ordering and the induced subgraph ordering and apply it to analyse a simple access rights management system.
@article{arxiv.1406.4782,
title = {A General Framework for Well-Structured Graph Transformation Systems},
author = {Barbara König and Jan Stückrath},
journal= {arXiv preprint arXiv:1406.4782},
year = {2014}
}
Comments
Extended version (including proofs) of a paper accepted at CONCUR 2014