Well-structured graph transformation systems

Graph transformation systems (GTSs) can be seen as well-structured transition systems (WSTSs) and via well-structuredness it is possible to obtain decidability results for certain classes of GTSs. We present a generic framework, parameterized over the well-quasi-order (wqo), in which several types of GTSs can be seen as (restricted) WSTSs. We instantiate this framework with three orders: the minor ordering, the subgraph ordering and the induced subgraph ordering. Furthermore we consider two case studies where we apply the theory to analyze a leader election protocol and a simple access rights management system with our tool Uncover.

Authors

• Barbara König
• Jan Stückrath

Keywords

No keywords are indexed for this paper.