Local Confluence for Rules with Nested Application Conditions
Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence of rewriting systems in a static way. Critical pairs are defined already in the framework of graphs and adhesive rewriting systems. These systems may hold rules with or without negative application conditions. In this paper however, we consider rules with more general application conditions — also called nested application conditions — which in the graph case are equivalent to finite first-order graph conditions. The classical critical pair notion denotes conflicting transformations in a minimal context satisfying the application conditions. This is no longer true for combinations of positive and negative application conditions — an important special case of nested ones — where we have to allow that critical pairs do not satisfy all the application conditions. This leads to a new notion of critical pairs which allows to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. We demonstrate this new theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.
KeywordsCritical pairs local confluence nested application conditions
Unable to display preview. Download preview PDF.
- 1.Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
- 2.Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. In: EATCS Monographs of Theoretical Computer Science. Springer, Heidelberg (2006)Google Scholar
- 3.Knuth, N.E., Bendix, P.B.: Simple word problems in universal algebra. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297 (1970)Google Scholar
- 4.Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Term Graph Rewriting: Theory and Practice, pp. 201–213. John Wiley, Chichester (1993)Google Scholar
- 10.Lambers, L., Ehrig, H., Habel, A., Orejas, F., Golas, U.: Local Confluence for Rules with Nested Application Conditions based on a New Critical Pair Notion. Technical Report 2010-7, Technische Universität Berlin (2010)Google Scholar
- 12.Newman, M.H.A.: On theories with a combinatorial definition of “equivalence”. Annals of Mathematics (43,2), 223–243 (1942)Google Scholar
- 15.Ehrig, H., Habel, A., Lambers, L.: Parallelism and concurrency theorems for rules with nested application conditions. In: Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday. Electronic Communications of the EASST, vol. 26 (2010)Google Scholar
- 18.Pennemann, K.H.: An algorithm for approximating the satisfiability problem of high-level conditions. In: Proc. Int. Workshop on Graph Transformation for Verification and Concurrency (GT-VC 2007). ENTCS, vol. 213, pp. 75–94 (2008), http://formale-sprachen.informatik.uni-oldenburg.de/pub/index.html
- 20.Rensink, A.: Representing first-order logic by graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004)Google Scholar