Theory of constraints and application conditions: From graphs to high-level structures

Fundamenta Informaticae

Volumn 74, Issue 1, 2006, Pages 135-166

  Ehrig, Hartmut ^a   Ehrig, Karsten ^a   Habel, Annegret ^b   Pennemann, Karl Heinz ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Adhesive HLR categories; Application conditions; Constraints; Graph transformation; Graphs; High level structures

Indexed keywords

ADHESIVES; CONSTRAINT THEORY; CONTROL SYSTEMS; MATHEMATICAL TRANSFORMATIONS;

ADHESIVE HLR CATEGORIES; APPLICATION CONDITIONS; GRAPH TRANSFORMATION; HIGH LEVEL STRUCTURES;

GRAPH THEORY;

EID: 37849186024     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Bottoni, P., Koch, M., Parisi-Presicce, F., Taentzer, G.: Consistency Checking and Visualization of OCL Constraints, in: UML 2000, vol. 1939 of Lecture Notes in Computer Science, Springer-Verlag, 2000, 294-308.
2. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation. Part I: Basic Concepts and Double Pushout Approach, in: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, World Scientific, 1997, 163-245.
3. Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, in: Graph-Grammars and Their Application to Computer Science and Biology, vol. 73 of Lecture Notes in Computer Science, Springer-Verlag, 1979, 1-69.
4. Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.-H.: Constraints and Application Conditions: From Graphs to High-Level Structures, in: Graph Transformations (ICGT'04), vol. 3256 of Lecture Notes in Computer Science, Springer-Verlag, 2004, 287-303.
5. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental Theory of Typed Attributed Graph Transformation based on Adhesive HLR-Categories, Fundamenta Informaticae, 2005, This volume.
6. Ehrig, H., Habel, A.: Graph Grammars with Application Conditions, in: The Book of L (G. Rozenberg, A. Salomaa, Eds.), Springer-Verlag, Berlin, 1986, 87-100.
7. Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: Parallelism and Concurrency in High Level Replacement Systems, Mathematical Structures in Computer Science, 1, 1991, 361-404.
8. Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation, Fundamenta Informaticae, 2005, This volume.
9. Ehrig, H., Heckel, R., Korff, M., Loewe, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic Approaches to Graph Transformation. Part II: Single-Pushout Approach and Comparison with Double Pushout Approach, in: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, World Scientific, 1997, 247-312.
10. Ehrig, H., Lambers, L., Prange, U.: Weak Adhesive High Level Replacement Categories and Systems: A Uniform Framework for Graphs and Petri Net Transformations, Lecture Notes in Computer Science, Springer-Verlag, 2005/2006.
11. Habel, A., Heckel, R., Taentzer, G.: Graph Grammars with Negative Application Conditions, Fundamenta Informaticae, 26, 1996, 287-313.
12. Habel, A., Müller, J., Plump, D.: Double-Pushout Graph Transformation Revisited, Mathematical Structures in Computer Science, 11(5), 2001, 637-688.
13. Habel, A., Pennemann, K.-H.: Nested Constraints and Application Conditions for High-Level Structures, in: Formal Methods in Software and System Modeling (H.-J. Kreowski, U. Montanari, F. Orejas, G. Rozenberg, G. Taentzer, Eds.), vol. 3393 of Lecture Notes in Computer Science, Springer-Verlag, 2005, 293-308.
14. Habel, A., Pennemann, K.-H.: Nested Constraints and Application Conditions for High-Level Structures (Long Version), 2005, In preparation.
15. Heckel, R., Wagner, A.: Ensuring Consistency of Conditional Graph Grammars - A Constructive Approach, in: Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA '95), vol. 2 of Electronic Notes in Theoretical Computer Science, 1995, 95-104.
16. Koch, M., Mancini, L. V., Parisi-Presicce, F.: Foundations for a Graph-Based Approach to the Specification of Access Control Policies, in: Proc. Foundations of Software Science and Computation Structures (FOSSACS 2001), vol. 2030 of Lecture Notes in Computer Science, Springer-Verlag, 2001, 287-302.
17. Koch, M., Mancini, L. V., Parisi-Presicce, F.: A Graph-based Formalism for RBAC, ACM Transactions on Information and System Security (TISSEC), 5 (3), 2002, 332-365.
18. Koch, M., Mancini, L. V., Parisi-Presicce, F.: Graph-based Specification of Access Control Policies, Journal of Computer and System Sciences, 71, 2005, 1-33.
19. Koch, M., Parisi-Presicce, F.: Describing Policies with Graph Constraints and Rules, in: Graph Transformation (ICGT2002), vol. 2505 of Lecture Notes in Computer Science, Springer-Verlag, 2002, 223-238.
20. Lack, S., Sobociński, P.: Adhesive Categories, in: Proc. of Foundations of Software Science and Computation Structures (FOSSACS'04), vol. 2987 of Lecture Notes in Computer Science, Springer-Verlag, 2004, 273-288.
21. Mahr, B., Wilharm, A.: Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study, in: Graph-Theoretic Concepts in Computer Science, Hanser Verlag, München, 1982, 165-176.
22. Plump, D.: Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence, in: Term Graph Rewriting: Theory and Practice, John Wiley, New York, 1993, 201-213.
23. Rensink, A.: Representing first-order logic by graphs, in: Graph Transformations (ICGT'04), vol. 3256 of Lecture Notes in Computer Science, Springer-Verlag, 2004, 319-335.