Paper Info
Title
A General Framework for Well-Structured Graph Transformation Systems.
Abstract
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.
Year
DOI
Venue
2014
10.1007/978-3-662-44584-6_32
CONCUR
DocType
Volume
Citations 
Journal
abs/1406.4782
5
PageRank 
References 
Authors
0.44
15
2
Name
Order
Citations
PageRank
Barbara König1788.13
Jan Stückrath2313.33