On the automated design of technical systems / André Schulz. 2001
Content
- 1 Introduction
- 2 A Design Task
- 3 Graph Grammar Model for Design
- 3.1 Design Tasks and Graph Transformation Rules
- 3.2 Context-free Design Graph Grammar
- 3.3 Context-sensitive Design Graph Grammar
- 3.4 On the Semantics of Labels
- 4 Analyzing Systems
- 4.1 Structure Analysis by Graph Grammars
- 4.2 Caramel Syrup Example
- 4.3 Behavior Analysis by Simulation
- 5 Synthesizing Systems
- 5.1 Structure Synthesis by Graph Grammars
- 5.2 Caramel Syrup Example Reviewed
- 5.3 Graph Topology Restrictions
- 5.4 Search Techniques
- 6 Design Language
- 7 Classes, Complexity and Design Evaluation
- 7.1 Classical and Design Graph Grammars
- 7.1.1 The Connecting Approach
- 7.1.2 The Gluing Approach
- 7.1.3 Hybrid Approaches
- 7.1.4 Design Graph Grammars
- 7.2 Relationship to PGRS
- 7.3 The Problem of Matching
- 7.3.1 Context and Its Consequences
- 7.3.2 The Subgraph Matching Problem
- 7.3.3 Context within Backward Execution
- 7.4 Foundations of Derivations and Membership
- 7.5 Membership and Derivation in Design
- 8 Summary
- A Applications in Design
