Local confluence for rules with nested application conditions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6372 LNCS, Issue , 2010, Pages 330-345

  Ehrig, Hartmut ^a   Habel, Annegret ^b   Lambers, Leen ^c   Orejas, Fernando ^d   Golas, Ulrike ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

^c UNIVERSITY OF POTSDAM   (Germany)

^d UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Critical pairs; local confluence; nested application conditions

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRITICAL PAIRS; FIRST-ORDER GRAPHS; GENERAL APPLICATIONS; GRAPH TRANSFORMATION SYSTEM; LOCAL CONFLUENCE; NEGATIVE APPLICATION CONDITIONS; NESTED APPLICATION CONDITIONS; TRANSFORMATION SYSTEMS;

GRAPH THEORY;

EID: 78649820576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15928-2_22     Document Type: Conference Paper

References (20)

1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. In: EATCS Monographs of Theoretical Computer Science. Springer, Heidelberg (2006)
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)
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)
5. Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol. 3838, pp. 280-308. Springer, Heidelberg (2005)
6. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26, 287-313 (1996) (Pubitemid 126715013)
7. Lambers, L., Ehrig, H., Prange, U., Orejas, F.: Embedding and confluence of graph transformations with negative application conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 162-177. Springer, Heidelberg (2008)
8. Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Mathematical Structures in Computer Science 19, 245-296 (2009)
9. Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 313-400. World Scientific, Singapore (1997)
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)
11. Lack, S., Sobociński, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 273-288. Springer, Heidelberg (2004)
12. Newman, M.H.A.: On theories with a combinatorial definition of "equivalence". Annals of Mathematics (43,2), 223-243 (1942)
13. Koch, M., Mancini, L.V., Parisi-Presicce, F.: Graph-based specification of access control policies. Journal of Computer and System Sciences 71, 1-33 (2005) (Pubitemid 40644915)
14. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae 74(1), 135-166 (2006) (Pubitemid 44826574)
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)
16. Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 179-198. Springer, Heidelberg (2008)
17. Pennemann, K.H.: Resolution-like theorem proving for high-level conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 289-304. Springer, Heidelberg (2008)
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
19. Lambers, L., Ehrig, H., Orejas, F.: Conflict detection for graph transformation with negative application conditions. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 61-76. Springer, Heidelberg (2006)
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)