Loading...
Please wait, while we are loading the content...
Similar Documents
T.: Strong joinability analysis for graph transformation systems (2009)
| Content Provider | CiteSeerX |
|---|---|
| Author | Raiser, Frank Frühwirth, Thom |
| Description | In CHR. In: 5th International Workshop on Computing with Terms and Graphs The notion of confluence is prevalent in graph transformation systems (GTS) as well as constraint handling rules (CHR). This work presents a generalized embedding of GTS in CHR that allows to consider strong derivations in confluence analyses. Confluence of a terminating CHR program is decidable, but confluence of a terminating GTS is undecidable. We show that observable confluence in CHR is a sufficient criterion for confluence of the embedded GTS. For this purpose the automatic confluence check for CHR can be reused. Keywords: |
| File Format | |
| Language | English |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | Strong Derivation Confluence Analysis Terminating Gts Generalized Embedding Sufficient Criterion Terminating Chr Program Graph Transformation System Constraint Handling Rule Observable Confluence Strong Joinability Analysis Embedded Gts Automatic Confluence Check |
| Content Type | Text |
| Resource Type | Article |