Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

TAGT
1998
Springer

favoriteEmaildiscussreport

250views Graph Theory» more TAGT 1998»

Double-Pushout Approach with Injective Matching

13 years 8 months ago

Double-Pushout Approach with Injective Matching

Download www-users.cs.york.ac.uk

Abstract. We investigate and compare four variants of the doublepushout approach to graph transformation. Besides the traditional approach with arbitrary matching and injective right-hand morphisms, we consider three variations by employing injective matching and/or arbitrary right-hand morphisms in rules. For each of the three variations, we clarify whether the well-known commutativity theorems are still valid and

Annegret Habel, Jürgen Müller, Detlef Pl

Real-time Traffic

Graph Theory | Graph Transformation | Injective Matching | Right-hand Morphisms | TAGT 1998 |

claim paper

Related Content

» Changing Labels in the DoublePushout Approach Can Be Treated Categorically

» Modeling Pointer Redirection as Cyclic Termgraph Rewriting

» Termination Criteria for DPO Transformations with Injective Matches

» Learning Shape Prior Models for Object Matching

» Optimally Learning Social Networks with Activations and Suppressions

» FLIPS Hybrid Adaptive Intrusion Prevention

» Building multicast services from unicast forwarding and ephemeral state

» A TestDriven Approach to Developing Pointcut Descriptors in AspectJ

» The dataflow pointcut a formal and practical framework

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1998
Where	TAGT
Authors	Annegret Habel, Jürgen Müller, Detlef Plump

Comments (0)