| Alternate document: Details Computing by Graph Transformation II (COMPUGRAPH II) (96) H. Ehrig, G. Taentzer (eds.) |
H. Ehrig, G. Taentzer (eds.)  Home/Search
Context Related
| cs.tuberlin.de/~gabi/gET96a.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wwwwbs.cs.tuberlin....public1996 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper as candidates to represent the processes in a concurrent system or, more exactly, as representatives of equivalent views on the processes. The main results give sufficient conditions for existence and uniqueness of canonical derivations. (Update)
Context of citations to this paper: More
...w.r.t. the number of steps. 1 Introduction Graph rewriting is being investigated in various areas nowadays (see for instance [Cou93, ET96, SPvE93] In this paper, we consider graph rewriting as the underlying operational semantics of rule based (functional or logic)...
...have been moved to the appendix. 2 Preliminaries Many di erent notations are used in the literature to investigate graphs (see [11, 22] for a compilation) The aim of this section is to give brie y some key de nitions in order to make easier the understanding of the...
Cited by: More
On Weakly Orthogonal Constructor-Based Graph Rewriting - Echahed, Janodet (1998) (Correct)
On Collapsing Narrowing - Echahed, Janodet (Correct)
On Constructor-based Graph Rewriting Systems - Echahed, Janodet (1997) (Correct)
Similar documents (at the sentence level):
13.3%: Computing by Graph Transformation II (COMPUGRAPH II) - H. Ehrig, G. Taentzer (Eds.) (1995) (Correct)
Active bibliography (related documents): More All
3.5: Algebraic Approaches to Graph Transformation, Part .. - Corradini.. (1996) (Correct)
1.9: Graph Grammars and Tree Transducers - Engelfriet (1994) (Correct)
1.7: Graph Transformation for Specification and Programming - Andries, Engels, Habel.. (1996) (Correct)
Similar documents based on text: More All
0.2: COMPUGRAPH II: A Survey of Research Goals and Main Results - Ehrig, Taentzer (1995) (Correct)
0.2: Deriving Bisimulation Congruences in the DPO Approach to Graph .. - Ehrig, König (2004) (Correct)
0.2: Parallel High-Level Replacement Systems - Taentzer (1994) (Correct)
Related documents from co-citation: More All
3: Functional Programming and Parallel Graph Rewriting (context) - Plasmeijer, van Eekelen - 1993
3: Equational Term Graph Rewriting - Ariola, Klop - 1993
3: Computing in Systems Described by Equations (context) - O'Donnell - 1977
BibTeX entry: (Update)
H. Ehrig and G. Taentzer. Computing by graph transformation : A survey and annotated bibliography. Bulletin of the EATCS, 59:182--226, June 1996. http://citeseer.ist.psu.edu/ehrig96computing.html More
@article{ ehrig96computing,
author = "Ehrig and Taentzer",
title = "Computing by Graph Transformation: {A} Survey and Annotated Bibliography",
journal = "BEATCS: Bulletin of the European Association for Theoretical Computer Science",
volume = "59",
year = "1996",
url = "citeseer.ist.psu.edu/ehrig96computing.html" }
Citations (may not include all citations):116 Introduction to the algebraic theory of graph grammars (context) - Ehrig - 1979
104 Graph rewriting: An algebraic and logic approach (context) - Courcelle - 1990
79 Graph grammars and their application to computer science and.. (context) - Claus, Ehrig et al. - 1979
71 Transfinite reductions in orthogonal Term Rewriting System - Kennaway, Klop et al. - 1990
64 Algebraic high-level net transformation systems (context) - Padberg, Ehrig et al. - 1995
64 The monadic second-order logic of graphs I: Recognizable set.. (context) - Courcelle - 1990
59 Graph grammars with negative application conditions - Habel, Heckel et al. - 1996
51 Monadic second-order evaluations on tree-decomposable graphs (context) - Courcelle, Mosbah - 1993
50 Workshop on Graph Grammars and their Application to Computer.. (context) - Ehrig, Nagl et al. - 1987
50 Workshop on Graph Grammars and their Application to Computer.. (context) - Ehrig, Nagl et al. - 1983
48 Handle-rewriting hypergraph grammars (context) - Courcelle, Engelfriet et al. - 1993
47 Petri nets are monoids (context) - Meseguer, Montanari - 1990
47 An algebraic theory of graph reduction (context) - Arnborg, Courcelle et al. - 1993
47 Hyperedge replacement graph grammars (context) - Drewes, Habel et al.
45 Graph grammars: an algebraic approach (context) - Ehrig, Pfender et al. - 1973
45 Abstract Petri Nets: A Uniform Approach and Rule-Based Refin.. (context) - Padberg - 1996
43 Fundamenta Informaticae (context) - Corradini, Montanari et al. - 1996
40 Algebraic approach to single-pushout graph transformation (context) - Lowe - 1993
40 AGG --- an implementation of algebraic graph rewriting (context) - Lowe, Beyer - 1993
39 Parallelism and concurrency in high-level replacement system.. (context) - Ehrig, Habel et al. - 1991
38 Graph expressions and graph rewritings (context) - Bauderon, Courcelle - 1987
37 Tutorial introduction to the algebraic approach of graph gra.. (context) - Ehrig, Korff et al.
37 Tutorial introduction to the algebraic approach of graph gra.. (context) - Ehrig - 1987
33 Monadic-second order definable graph transductions: a survey (context) - Courcelle - 1994
32 An algebraic framework for the transformation of attributed .. (context) - Lowe, Korff et al. - 1993
30 Horizontal and vertical structuring of typed graph transform.. - Heckel, Corradini et al. - 1995
29 The monadic second-order logic of graphs V : On closing the .. (context) - Courcelle - 1991
28 the structure of node-label-controlled graph languages (context) - Janssens, Rozenberg - 1980
28 From graph grammars to High Level Replacement Systems (context) - Ehrig, Habel et al. - 1991
26 Algebraic approaches to graph transformation I: Basic concep.. (context) - Corradini, Montanari et al.
26 The monadic second-order logic of graphs VI: On several repr.. (context) - Courcelle - 1994
25 Parallel and Distributed Graph Transformation: Formal Descri.. (context) - Taentzer - 1996
25 An axiomatic definition of context-free rewriting and its ap.. (context) - Courcelle - 1987
24 Computing with graph rewriting systems with priorities (context) - Litovsky, Metivier - 1993
24 Implementing term rewriting by jungle evaluation - Hoffmann, Plump - 1991
24 Pragmatic and semantic aspects of a module concept for graph.. (context) - Ehrig, Engels - 1996
22 Contextual occurrence nets and concurrent constraint program.. (context) - Montanari, Rossi - 1994
22 volume 643 of Lecture Notes in Computer Science (context) - Habel, Grammars - 1992
22 Ensuring consistency of conditional graph grammars -- a cons.. - Heckel, Wagner - 1995
22 The monadic second-order logic of graphs VII : Graphs as rel.. (context) - Courcelle - 1992
21 A graph grammar approach to graphical parsing (context) - Rekers, Schurr - 1995
21 Evaluation of functional expressions by hypergraph rewriting (context) - Plump - 1993
21 The string generating power of context-free hypergraph gramm.. (context) - Engelfriet, Heyker - 1991
20 A model of distributed systems based on graph rewriting (context) - Degano, Montanari - 1987
20 Algebraic approaches to graph transformation II: Single push.. (context) - Ehrig, Heckel et al.
19 Algebraic high-level nets: Petri nets revisited (context) - Ehrig, Padberg et al. - 1994
19 Coverings and minors: application to local computations in g.. (context) - Courcelle, Metivier - 1994
19 Graph grammars based on node rewriting: an introduction to N.. (context) - Engelfriet, Rozenberg - 1991
18 Encapsulated Hierarchical Graphs (context) - Engels, Schurr - 1995
18 A Hybrid Query Language for the Extended Entity Relationship.. - Andries, Engels - 1995
18 Encapsulated Hierarchical Graphs (context) - Engels, Schurr - 1995
18 Graph grammars and tree transducers - Engelfriet - 1994
18 Hyperedge Replacement Jungle Rewriting for Term Rewriting Sy.. (context) - Corradini, Rossi - 1993
18 A Hybrid Query Language for the Extended Entity Relationship.. - Andries, Engels - 1995
17 The monadic second-order logic of graphs X: linear orders (context) - Courcelle - 1996
17 Syntax and Semantics of Hybrid Database Languages (context) - Andries, Engels - 1994
16 the interleaving semantics of transformation units --- A ste.. - Kreowski, Kuske
16 A logical characterization of the sets of hypergraphs define.. (context) - Courcelle, Engelfriet - 1995
16 Term Graph Rewriting is adequate for Rational Parallel Term .. (context) - Corradini, Drewes - 1996
16 An event structure semantics for safe graph grammars (context) - Corradini, Ehrig et al. - 1994
16 The translation power of top-down tree-to-graph transducers (context) - Engelfriet, Vogler - 1994
15 On termination of graph rewriting (context) - Plump - 1995
15 Hypergraph rewriting: Critical pairs and undecidability of c.. (context) - Plump - 1993
15 Collapsed tree rewriting: Completeness (context) - Plump - 1993
15 Graph grammars with application conditions (context) - Ehrig, Habel - 1985
15 Context-free NCE graph grammars (context) - Engelfriet - 1989
15 A characterization of context-free NCE graph languages by mo.. (context) - Engelfriet - 1991
15 A comparison of boundary graph grammars and context-free hyp.. (context) - Engelfriet, Rozenberg - 1990
15 Computation by tree transductions (context) - Drewes - 1996
15 strongly sequential and forward-branching term rewriting sys.. (context) - Durand - 1994
15 techniques and results for high-level replacement systems in.. (context) - Ehrig, Lowe - 1993
14 A tutorial and bibliographical survey of graph grammars (context) - Nagl - 1980
14 On structured graph grammars (context) - Kreowski, Rozenberg - 1990
14 Graph-Grammatiken (context) - Nagl - 1979
14 A parsing algorithm for context-sensitive graph grammars - Rekers, Schurr - 1995
14 The monadic second-order logic of graphs VIII: orientations (context) - Courcelle - 1995
14 Hierarchically distributed graph transformation - Taentzer - 1995
14 Dynamic abstract data types based on algebraic graph transfo.. (context) - Ehrig, Lowe et al. - 1995
14 Collages and patterns generated by hyperedge replacement (context) - Habel, Kreowski et al. - 1993
14 A parsing algorithm for context-sensitive graph grammars - Rekers, Schurr
13 Algebraic approach to graph transformation based on single p.. (context) - Lowe - 1990
13 The category of Typed Graph Grammars and its adjunctions wit.. (context) - Corradini, Ehrig et al. - 1996
13 Collage grammars (context) - Habel, Kreowski - 1991
13 Structural properties of context-free sets of graphs generat.. (context) - Courcelle - 1995
13 Boundary graph grammars with dynamic edge relabeling (context) - Engelfriet, Leih et al. - 1990
13 Algebraic approach to graph transformation based on single p.. (context) - Lowe, Ehrig - 1991
13 th International Workshop on Graph Grammars and Their Applic.. (context) - Ehrig, Kreowski et al. - 1991
13 Language theoretic and algorithmic properties of d-dimension.. (context) - Drewes
12 Context-free graph languages of bounded degree are generated.. (context) - Engelfriet, Heyker et al. - 1994
12 A note on hyperedge replacement (context) - Drewes, Kreowski - 1991
12 Jungle Rewriting: an abstract description of a lazy narrowin.. (context) - Corradini, Wolz - 1994
12 Towards a module concept for graph transformation systems: T.. (context) - Ehrig, Engels - 1995
12 Boundary NLC graph grammars --- basic definitions (context) - Rozenberg, Welzl - 1986
12 the recognition of families of graphs with local computation.. (context) - Litovsky, Metivier et al. - 1995
12 A uniform approach to graph rewriting: the pullback approach - Bauderon - 1995
12 Context-free hypergraph grammars have the same termgeneratin.. (context) - Engelfriet, Heyker - 1992
12 Critical pairs in term graph rewriting (context) - Plump - 1994
11 Semantics of full Statecharts based on graph rewriting (context) - Maggiolo-Schettini, Peron - 1994
11 Implementing Term Rewriting by Graph Reduction: Termination .. (context) - Plump - 1991
11 True concurrency semantics for single pushout graph transfor.. (context) - Korff - 1994
11 True concurrency semantics for single pushout graph transfor.. (context) - Korff - 1995
11 Semantics of full Statecharts based on graph rewriting (context) - Maggiolo-Schettini, Peron - 1993
11 Graph unification and matching (context) - Plump, Habel
11 A comparison between Petri-nets and graph grammars (context) - Kreowski - 1981
11 The monadic second-order logic of graphs II: Infinite graphs.. (context) - Courcelle - 1989
11 The Kronecker product and local computations in graphs (context) - Bottreau, Metivier - 1996
10 Algorithms for graph problems on BNLC structured graphs (context) - Wanke - 1991
10 On polynomial time graph grammars (context) - Brandenburg - 1988
10 Attributed graph transformations with controlled application.. (context) - Heckel, Muller et al. - 1995
10 Defining operational behavior of object specifications by at.. - Wagner, Gogolla
10 Amalgamated graph transformation systems and their use for s.. (context) - Taentzer, Beyer - 1994
10 Amalgamation of graph transformations: a synchronization mec.. (context) - Bohm, Fonio et al. - 1987
10 Formal relationship between graph grammars and Petri nets (context) - Korff, Ribeiro - 1996
10 Term Rewriting in CT \Sigma (context) - Corradini - 1993
10 An Algebra of Graphs and Graph Rewriting (context) - Corradini, Montanari - 1991
10 Manipulation von Graphmanipulationen (context) - Kreowski - 1977
10 Mathematical Systems Theory (context) - Janssens, Rozenberg - 1989
9 Distributed parallelism of graph transformation (context) - Ehrig, Bohm et al. - 1988
9 A kernel language for programmed rewriting (context) - Maggiolo-Schettini, Winkowski - 1995
9 Hans-Jorg Kreowski (context) - Habel - 1991
9 Linear graph grammars: power and complexity (context) - Engelfriet, Leih - 1989
9 Single pushout transformations of equationally defined graph.. (context) - Korff - 1994
9 Decidable Boundedness Problems for Sets of Graphs Generated .. (context) - Habel, Kreowski et al. - 1991
9 Syntaxanalyse von Graphen bei Prazedenz-Graph-Grammatiken (context) - Kaul - 1985
9 Parallelism of manipulations in multidimensional informatica.. (context) - Ehrig, Kreowski - 1976
9 Transformations of structures: an algebraic approach (context) - Ehrig, Kreowski et al. - 1981
9 Graph rewriting for a partial ordering semantics of concurre.. (context) - Montanari, Rossi - 1993
9 Embedding of derivations in high-level replacement systems (context) - Padberg, Taentzer - 1995
8 Graph-Reducible Term Rewriting Systems (context) - Plump - 1991
8 Graphische Spezifikation ausgewahlter Teile von AGG -- einem.. (context) - Conrad, Gajewsky et al. - 1995
8 A categorical approach to vertex replacement: the generation.. (context) - Bauderon - 1994
8 Part I and II (context) - Ehrenfeucht, Rozenberg et al. - 1990
8 Graphische Spezifikation ausgewahlter Teile von AGG --- eine.. (context) - Conrad, Gajewsky et al. - 1995
8 Chain-code pictures and collages generated by hyperedge repl.. (context) - Dassow, Habel et al.
8 for graph transformation systems. Proc. of SEGRAGRA'95 "Grap.. (context) - Taentzer, Schurr et al. - 1995
8 Parallel high-level replacement systems - Taentzer - 1996
8 Computing trees with graph rewriting systems with priorities (context) - Litovsky, Metivier - 1992
8 On hyperedge replacement and BNLC graph grammars (context) - Vogler - 1993
8 An Event Structure Semantics for Graph Grammars with Paralle.. (context) - Corradini, Ehrig et al. - 1996
8 Decomposition trees: structured graph representation and eff.. (context) - Lautemann - 1988
8 Constructor equivalent term rewriting systems - Durand, Salinier - 1993
8 Node replacement in hypergraphs: simulation of hyperedge rep.. (context) - Klempien-Hinrichs
8 Constructor equivalent term rewriting systems are strongly s.. - Durand, Salinier - 1994
8 The complexity of graph languages generated by hyperedge rep.. (context) - Lautemann - 1990
8 and narrowing on term graphs (context) - Habel, Plump et al. - 1995
8 Regular description of context-free graph languages - Engelfriet, van Oostrom - 1995
7 Programmed derivations of relational structures (context) - Maggiolo-Schettini, Winkowski - 1991
7 Concurrent computing: From petri nets to graph grammars - Corradini - 1995
7 Algebraic graph transformations with application conditions (context) - Heckel - 1995
7 Logic Programming as Hypergraph Rewriting (context) - Corradini, Rossi et al. - 1991
7 Parallel and distributed derivations in the single pushout a.. (context) - Ehrig, Lowe - 1993
7 system as Graph Grammar GL system (context) - Using, Graph et al. - 1994
7 Formal development of concurrent systems using algebraic hig.. (context) - Ribeiro, Ehrig et al. - 1993
7 Different local controls for graph relabelling systems - Litovsky, Metivier et al. - 1995
7 Basic notions of universal algebra for language theory and g.. (context) - Courcelle - 1995
7 Computation graphs for actor grammars (context) - Janssens, Lens et al. - 1993
7 Characterization and complexity of uniformly non-primitive l.. (context) - Engelfriet, Harju et al. - 1996
7 Integrated Development of Software: Integrating Different Pe.. (context) - Zamperoni, --- - 1995
7 Generating self-affine fractals by collage grammars (context) - Drewes, Habel et al. - 1995
7 A lower bound on the growth of functions computed by tree tr.. (context) - Drewes - 1994
7 Graph Transformations in Computer Science (context) - Schneider, Ehrig - 1994
6 monadic second-order logic and the theory of graph minors (context) - Courcelle - 1992
6 The monadic second-order logic of graphs III: Tree-decomposi.. (context) - Courcelle - 1992
6 Biological metaphors in designing modular artificial neural .. (context) - Boers, Kuiper et al. - 1993
6 Specification of concurrent systems: from petri nets to grap.. (context) - Corradini, Montanari - 1995
6 Parallel hyperedge replacement (context) - Kreowski - 1992
6 Emptiness problems of eNCE graph languages - Skodinis, Wanke - 1995
6 Pushout-properties: an analysis of gluing constructions for .. (context) - Ehrig, Kreowski - 1979
6 Graph-interpreted graph transformations for concurrent objec.. (context) - Korff - 1996
6 Graph-interpreted graph transformations for concurrent objec.. (context) - Korff - 1994
6 Graph rewriting with unification and composition (context) - Parisi-Presicce, Ehrig et al. - 1987
6 Graph Rewriting using the Annotated Functional Strategy (context) - Koopman, Smetsers et al. - 1993
6 Extended Algebraic Graph Transformations (context) - Lowe - 1990
6 The use of tree transducers to compute translations between .. - Drewes - 1994
6 Computing by Graph Transformations II (context) - Ehrig, Korff - 1993
6 An attributed graph transformation approach to the behaviour.. (context) - Korff, Ribeiro - 1994
6 Transducibility --- symbolic computation by tree-transductio.. (context) - Drewes - 1993
6 An Abstract Machine for Concurrent Modular Systems: CHARM (context) - Corradini, Montanari et al. - 1994
6 A compositional approach to structuring and refinement of ty.. - Corradini, Heckel - 1995
5 Parallel rewriting of graphs through the pullback approach - Bauderon - 1995
5 Algebraic high-level nets and transformations with initial m.. (context) - Ribeiro, Padberg - 1994
5 The monadic second-order logic of graphs IV: Definability pr.. (context) - Courcelle - 1990
5 Recursively defined tree-transductions (context) - Raoult - 1993
5 Embedding of conditional graph transformations - Heckel - 1995
5 Semantics of statecharts based on graph rewriting (context) - Maggiolo-Schettini, Peron - 1992
5 A programming language for deriving hyper-graphs (context) - Maggiolo-Schettini, Winkowski - 1992
5 Checking global graph properties by means of local computati.. - Litovsky, Metivier et al. - 1995
5 connected hypergraphs in cubic time (context) - Drewes - 1993
5 Critical pair analysis in single-pushout graph rewriting (context) - Lowe, Muller - 1995
5 Concatenation of graphs - Engelfriet, Vereijken
5 Specification techniques using dynamic abstract data types a.. (context) - Ehrig, Bardohl - 1994
5 Canonical derivations for high level replacement systems (context) - Ehrig, Kreowski et al. - 1994
5 Correct translations of generalized iterated function system.. (context) - Taubenberger - 1994
5 Concurrent derivations as single pushout graph grammar proce.. - Korff, Ribeiro - 1995
5 The bounded degree problem for eNCE graph grammars (context) - Skodinis, Wanke - 1994
5 COMPUGRAPH II: a survey of research goals and main results - Ehrig, Taentzer - 1995
5 Semantic aspects of the graph and rule centered language GRA.. - Kuske - 1995
4 Graph-Grammars for Distributed Systems (context) - Castellani, Montanari - 1983
4 Introduction to graph grammars with applications to semantic.. (context) - Ehrig, Habel et al. - 1992
4 Recognizing edge replacement graph languages in cubic time (context) - Vogler
[Article contains additional citations not shown here]
Documents on the same site (http://wwwwbs.cs.tu-berlin.de/~ehrig/public1996.html):
Horizontal and Vertical Structuring of Typed Graph.. - Heckel, Corradini.. (1996) (Correct)
Computing by Graph Transformation II (COMPUGRAPH II) - Ehrig, (eds.) (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC