@Article{EGHb+12,
AUTHOR = {Ehrig, Hartmut and Golas, Ulrike and Habel, Annegret and Lambers, Leen and Orejas, Fernando},
TITLE = {{M-Adhesive Transformation Systems with Nested Application Conditions, Part 2: Embedding, Critical Pairs and Local Confluence}},
YEAR = {2012},
JOURNAL = {Fundamenta Informaticae},
VOLUME = {118},
NUMBER = {1-2},
PAGES = {35-63},
PUBLISHER = {IOS Press},
PDF = {uploads/pdf/EGHb+12_ACS-Part2.pdf},
OPTacc_pdf = {},
ABSTRACT = {Graph transformation systems have been studied extensively and applied to several areas of computer science like formal language theory, the modeling of databases, concurrent or distributed systems, and visual, logical, and functional programming. In most kinds of applications it is necessary to have the possibility of restricting the applicability of rules. This is usually done by means of application conditions. In this paper, we continue the work of extending the fundamental theory of graph transformation to the case where rules may use arbitrary (nested) application conditions. More precisely, we generalize the Embedding theorem, and we study how local confluence can be checked in this context. In particular, we define a new notion of critical pair which allows us to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. All our results are presented, not for a specific class of graphs, but for any arbitrary ?-adhesive category, which means that our results apply to most kinds of graphical structures. We demonstrate our theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.}
}