Introduction to Graph Rewriting

Uploaded from authorPOINTLite
Views:
 
Category: Education
     
 

Presentation Description

No description available.

Comments

Presentation Transcript

An Introduction to Graph Rewriting: 

An Introduction to Graph Rewriting Thomas Huining Feng http://www.eecs.berkeley.edu/~tfeng/ CHESS, UC Berkeley May 1, 2007 Inspired by Tutorial Introduction to Graph Transformation: A Software Engineering Perspective. Luciano Baresi, Reiko Heckel. ICGT 2002

PacMan: a Motivating Example: 

PacMan: a Motivating Example : Field : Field : Field : Field : Field : Field : Field : Field : Field Field 1 1..4 Type : Ghost Ghost 1 0..1 : PacMan PacMan 1 0..1 : Marble Marble 1 0..1 2

Our 1st Rule: pmove: 

Our 1st Rule: pmove b : Field a : Field : PacMan b : Field a : Field : PacMan 3 LHS (Left Hand Side) RHS (Right Hand Side) : Field : Field : Field : Field : Field : Field : Field : Field : Field : Ghost : PacMan : Marble Host Graph Redex Redex finding is a sub-graph isomorphism problem). Multiple redexes?

Our 2nd Rule: gmove: 

Our 2nd Rule: gmove b : Field a : Field : Ghost b : Field a : Field : Ghost : Field : Field : Field : Field : Field : Field : Field : Field : Field : Ghost : PacMan : Marble

Combining pmove and gmove: 

Combining pmove and gmove 5

catch Rule: 

catch Rule 6 : Field : Field : Field : Field : Field : Field : Field : Field : Field : Ghost : PacMan : Marble

Important Decision: Which Rule to Choose?: 

Important Decision: Which Rule to Choose? 7

Attribute Binding: collect Rule: 

Attribute Binding: collect Rule 8 : Field : Field : Field : Field : Field : Field : Field : Field : Field : Ghost : PacMan 3 : marble : Marble : PacMan 4 : marble

Attribute Binding: collect Rule: 

Attribute Binding: collect Rule 9 : Field : Field : Field : Field : Field : Field : Field : Field : Field : Ghost : PacMan 3 : marble : Marble

Completing the PacMan Game: 

Completing the PacMan Game 10 b : Field a : Field : Ghost b : Field a : Field : Ghost : PacMan sub-case interfering sub-case 1 2 3 3 Priority:

The Graph Rewriting Problem: 

Host Graph – Redex The Graph Rewriting Problem 11 m < BAG_SIZE b : Field a : Field : PacMan m : marble b : Field a : Field : PacMan m+1 : marble : Marble

The Graph Rewriting Problem: 

The Graph Rewriting Problem 12

More on Application Decision: 

More on Application Decision 13

More on Application Decision: 

More on Application Decision 14 Field 1 1..4 Entrance 1 0..1 Kid 1 0..1 Exit 1 0..1

More on Application Decision: 

More on Application Decision 15

Conclusion: 

Conclusion 16