Abstract
Graph transformation systems (GTSs) can be seen as well-structured transition systems (WSTSs), thus obtaining decidability results for certain classes of GTSs. In earlier work it was shown that well-structuredness can be obtained using the minor ordering as a well-quasi-order. 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. © 2014 Springer-Verlag.
Cite
CITATION STYLE
König, B., & Stückrath, J. (2014). A general framework for well-structured graph transformation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704 LNCS, pp. 467–481). Springer Verlag. https://doi.org/10.1007/978-3-662-44584-6_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
