Graph transformation planning with time and concurrency / vorgelegt von Steffen Ziegert, M.Sc. Paderborn, 2016
Inhalt
- List of Figures
- List of Tables
- List of Algorithms
- List of Listings
- Introduction
- Automated Planning
- Rule-Based Modification of Graphs
- Research Tasks and Contributions
- Application Examples
- Thesis Outline
- Background on Graph Transformations
- Graphs, Graph Morphisms, and Pushouts
- Double Pushout Approach
- Single Pushout Approach
- NACs, Types, and Visual Representation
- Parallel and Sequential Independence
- Background on AI Planning
- Planning with Graph Transformations
- Problem Statement
- Application Example: Reconfiguration of ECUs
- Relaxed Planning Heuristic
- Evaluation
- Related Work
- Discussion
- Durative Graph Transformation Systems
- Application Example: RailCab System
- Durative Graph Transformation Rules
- Syntax
- Timed Graphs and Clock Instances
- Locking Edges and Application Indicators
- Timed Graph Transformation Rules
- Clock Instance and Invariant Rules
- Operational Semantics
- Properties of Durative Graph Transformation Rules
- Correspondence of a Durative Graph Transformation
- Rule Termination and Interleaving Transition Sequences
- Support for Negative Application Conditions
- Concurrency Rules
- Urgency Rules
- Related Work
- Discussion
- Temporal PDDL-Based Planning for Durative Graph Transformation Systems
- Problem Statement
- Application Example: RailCab System (Emphasis on NACs)
- Translation Scheme
- Type Graph
- Durative Graph Transformation Rules
- Forbidden Pairs
- Dangling Edges
- Locking Functionality
- Locks in Durative Rules
- Concurrency Rules
- Urgency Rules
- Prototype and Translation Workflow
- Evaluation of Translation Variants
- Evaluation of Concurrency and Urgency Rules
- Related Work
- Discussion
- Conclusion and Future Work
- Bibliography