Abstract
The main focus of our work is to analyze and compare the behavior of graph transformation systems (GTSs). Therefore, we use the borrowed context technique to specify the behavior of a single graph with interface in different contexts. This mechanism is used to construct an LTS with graphs as states and rule applications as transitions. Each transition is labeled with the rule name and the borrowed context that is needed to perform the step. This makes the ideas of behavior comparison from LTS theory applicable to GTSs [1,9,6]. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Hülsbusch, M. (2010). Bisimulation theory for graph transformation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6372 LNCS, pp. 391–393). https://doi.org/10.1007/978-3-642-15928-2_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
