Preview
Unable to display preview. Download preview PDF.
5. References
Finished and Published Papers (period March 1989–February 1990)
S. Arnborg, B. Courcelle, A. Proskurowski, D. Seese: An Algebraic Theory of Graph Reduction, Techn. Report 90-02, University Bordeaux (1990).
R. Arlt, M. Löwe, M. Röder: Basic Data Structures and Algorithms for Graph Grammar Implementations, Internal Technical Report, TU Berlin (1989).
M. Bauderon: Infinite Hypergraphs, to appear in: Theoretical Computer Science.
B. Courcelle: The Definability of Equational Graphs in Monadic 2nd Order Logic, in: ICALP'89, Springer, LNCS 372, 207–221 (1989).
B. Courcelle: The Monadic 2nd Order Logic of Graphs IV: Definability Properties of Equational Graphs, to appear in: Annals of Pure and Applied Logic.
B. Courcelle: The Monadic 2nd Order Logic of Graphs V: On Closing the Gap between Recognicability and Definability, Techn. Report 89–91, Univ. Bordeaux (1989). To appear in: Theoretical Computer Science.
B. Courcelle: The Monadic 2nd Order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures, Techn. Report 89–99, Univ. Bordeaux (1989). To appear in: Theoretical Computer Science.
J. Engelfriet, L.M. Heyker: The String Generating Power of Context-free Hypergraph Grammars, Techn. Report 89-05, Univ. Leiden (1989). To appear in JCSS.
J. Engelfriet, L.M. Heyker: The Term-generating Power of Context-free Hypergraph Grammars and Attribute Grammars, Techn. Report 89-17, Univ. Leiden (1989).
H. Ehrig, M. Löwe (ed.): Computing by Graph Transformation: Objectives, State-of-the-art, References, Techn. Report 89-14, Techn. Univ. Berlin (1989).
J. Engelfriet: A Regular Characterization of Graph Languages Definable in Monadic Second-order Logic, Tech. Report 89-03, Univ. Leiden (1989).
J. Engelfriet: Context-free NCE Graph Grammars, in: FCT'89, Springer, LNCS 380, 148–161 (1989).
A. Ehrenfeucht, G. Rozenberg: Angular 2-structures, Techn. Report 89-10, Univ. Leiden (1989).
A. Ehrenfeucht, G. Rozenberg: Clans and the Complexity of Dependence Graphs, Report 89-02, Leiden.
A. Habel: Hyperedge Replacement: Grammars and Languages, Dissertation, University Bremen, FB Math./Informatik (1989).
A. Habel: Graph-Theoretic Properties Compatible with Graph Derivations, in WG'88, Springer, LNCS 344, 11–29 (1989).
A. Habel, H.-J. Kreowski: Filtering Hyperedge-Replacement Languages Trough Compatible Properties, Techn. Report, Univ. Bremen 1989, 12. pages
A. Habel, H.-J. Kreowski, C. Lautemann: A Comparison of Compatible, Finite, and Inductive Graph Properties, Techn. Report 7/89, Univ. Bremen (1989).
A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Languages, Acta Informatica 26, 657–677 (1989).
A. Habel, H.-J. Kreowski, W. Vogler: Decidable Boundedness Problems for hyperedge-Replacement Graph Grammars, In J. Diaz, F. Orejas (Eds.): TAPSOFT '89, Proc. of the International Joint Conference on Theory and Practice of Software Development, Vol. 1, Springer-Verlag, Berlin, LNCS 351, 275–289 (1989).
A. Habel, H.-J. Kreowski, W. Vogler: Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement, to appear in: Theoretical Computer Science (1990)
B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting, in Grabowski et al.: Algebraic and Logic Programming, Springer, Berlin, LNCS 351, 275–289 (1989).
B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting, to appear in: RAIRO Theoretical Informatics and Applications (1990).
E. Jeltsch, H.-J. Kreowski: Grammatikalische Inferenz auf der Basis von Hyperkantenersetzung, Techn. Report 9/89, Univ. Bremen (1989).
D. Janssens, M. Lens, G. Rozenberg: Computation Graphs for Actor Grammars, Techn. Report, Univ. Leiden (1989)
D. Janssens, G. Rozenberg: Actor Grammars, in Mathematical System Theory 22, 75–107 (1989).
H.-J. Kreowski, G. Rozenberg: On Structured Graph Grammars, Part I and II, to appear in: Information Sciences (1990).
C. Lautemann: The Complexity of Graph Languages generated by Hyperedge Replacement, Techn. Report 4/89, Univ. Bremen 1989.
C. Lautemann: Tree Decomposition of Graphs and Tree Automata, Techn. Report, Univ. Bremen 1989.
M. Löwe: Implementing Algebraic Specifications by Graph Transformation Systems, Techn. Report 89-26, Techn. Univ. Berlin (1989).
Y. Metiviet, M. Billaud, P. Lafou, E. Sopena: Graph Rewriting Systems with Priorities, in: WG'89, Springer, LNCS 411 (1990).
Y. Metiviet, M. Billaud, P. Lafou, E. Sopena: Graph Rewriting Systems with Priorities: Definitions and Applications, Techn. Report 8908, Univ. Bordeaux (1989).
A. Maggiolo Schettini, G.M. Pinna, J. Winkowski: A Compositional Semantics for Unmarked Predicate/Transition Nets, Fund. Infor. (1990)
F. Parisi-Presicce: Modular System Design Applying Graph Grammars Techniques, in: ICALP'89, Springer, LNCS 372 (1989). To appear in: Theoretical Computer Science.
Papers in Preparation
B. Courcelle, J. Engelfriet, G. Rozenberg: Handle-rewriting Hypergraph Grammars.
B. Courcelle: Graphs as Relational Structures: An Algebraic and Logical Approach.
M. Dauchet, M. Bossu, B. Warin: Rational and Recognizable Sets of Planar Directed Acyclic Graphs.
J. Engelfriet, L.M. Heyker: Context-free Hypergraph Languages of Bounded Degree.
H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce: High-level Replacement Systems.
J. Engelfriet: A Characterization of Context-free Graph Languages Using Monadic Second-order Logic.
H. Ehrig, F. Parisi-Presicce: Algebraic Specification Grammars: A Junction between Module Specifications and Graph Grammars.
J. Engelfriet, H. Vogler: Context-free Hypergraph Grammars and Macro Tree Transducers.
B. Hoffmann, H.-J. Kreowski, M. Löwe, D. Plump: Evaluation of Expressions by Graph Transformation: A Survey.
M. Korff: Application of Graph Grammars to Rule-based Systems.
M. Löwe, H. Ehrig: Algebraic Approach to Graph Transformation Based on Single Pushout Derivations.
G. Lackner, E. Wanke, E. Welzl: On a Class of Polynomial Passable Edge Replacement Grammars.
Y. Metivier, I. Litovsky: Words and Trees Rewriting Systems with Priorities.
A. Maggiolo Schettini, J. Winkowski: A Generalization of Predicate / Transition Nets.
A. Maggiolo Schettini, J. Winkowski: Grammars for Transforming Relational Structures and Predicate/Transition Nets.
D. Plump: Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems.
G.M. Pinna, A. Maggiolo Schettini: Transformations of Pr/T Nets via Translation into Structure Grammars.
J.C. Raoult: Tree Transduction Based on Hyperedge Rewriting.
F. Rossi, A. Corradini, U. Montanari, H. Ehrig, M. Löwe: Graph Grammars and Logic Programming.
H. Schween, G. Taentzer: Application of Graph Grammars to Robotics.
Bibliography of Selected Papers by Project Members and Cooperators
IJ. J. Aalbersberg, G. Rozenberg: Traces, dependency graphs and DNLC grammars; Discr. Appl. Math. 13 (1986), 79–85
IJ. J. Aalbersberg, G. Rozenberg: Theory of traces; Report 86-16, Leiden 1986, to appear in TCS
M. Bauderon, B. Courcelle: Graph expressions and graph rewritings; Math. Syst. Theory 20 (1987), 83–127
P. Boehm, H. Ehrig, U. Hummert, M. Löwe: Towards distributed graph grammars; in [Ehr Nag Roz Ros], 86–98
P. Boehm, H. Fonio, A. Habel: Amalgamation of graph transformations with applications to synchronization; LNCS 185, 267–285 (1985)
P. Boehm, H. Fonio, A. Habel: Amalgamation of graph transformations: A synchronization mechanism, JCSS 34 (1987), 307–408
F.J. Brandenburg: On partially ordered graph-grammars; in [Ehr Nag Roz Ros], 99–111
F. J. Brandenburg: On polynomial time graph grammars; Proc. STACS 1988, LNCS 294, Springer-Verlag, 1988, 227–236
I. Castellani, U. Montanari: Graph grammars for distributed systems; in [Ehr Nag Roz], 20–38
V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph grammars and their application to computer Science and biology, LNCS 73, Springer-Verlag, 1979
B. Courcelle: Recognizability and second order definability for sets of finite graphs; Report I-8634, Bordeaux, 1986. See also [Ehr Nag Roz Ros], 112–146
B. Courcelle: On using context-free graph grammars for analyzing recursive definitions; to appear
B. Courcelle: Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars; Theor. Comp. Sci. 42 (1988), 1–122
B. Courcelle: an axiomatic definition of context-free rewriting and its application to NLC graph-grammars; Theor. Comp. Sci. 55 (1987), 141–181
P. Degano, U. Montanari: A model of distributed systems based on graph rewriting; Journal of the ACM Vol. 34, No 2, April 1987, 411–449
P. Degano, U. Montanari: Concurrent histories: A basis for observing distributed systems; Journal of Computer and System Sciences, 34, 442–461 (1987)
A. Ehrenfeucht, G. Rozenberg: On the structure of dependence graphs; in "Concurrency and Nets" (K. Voss, H.J. Genrich, G. Rozenberg, eds.), Springer-Verlag, 1987, 141–170
H. Ehrig: Introduction to the algebraic theory of graph grammars (a survey); in [Cla Ehr Roz], 1–69
H. Ehrig: Aspects of concurrency in graph grammars; in [Ehr Nag Roz], 58–81
H. Ehrig: Tutorial introduction to the algebraic approach of graph grammars; in [Ehr Nag Roz Ros], 3–14
H. Ehrig, A. Habel: Graph grammars with application conditions; in "The Book of L", G. Rozenberg, A. Salomaa (eds.), Springer-Verlag, 1985, 87–100
H. Ehrig, H.-J. Kreowski: Categorical theory of graphical systems and graph grammars; Conf. Report Algebraic System Theory, Udine 1975, Springer-Verlag, Lecture Notes Econ. Math. Syst. 131 (1976), 323–351
H. Ehrig, H.-J. Kreowski: Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems; Inform. Syst. 5, 225–238 (1980)
H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B.K. Rosen, J. Winkowski: Transformation of structures: An algebraic approach; Math. Syst. Theory 14 (1981), 305–334
H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-grammars and their application to computer science, LNCS 153, Springer-Verlag, 1983
H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.): Graph-grammars and their application to computer science, LNCS 291, Springer-Verlag, 1987
H. Ehrig, B.K. Rosen: Concurrency of manipulation in multidimensional information structures; LNCS 64, 165–176 (1978)
J. Engelfriet: Generating strings with hypergraph grammars; in "Essays on concepts, formalisms, and tools" (eds. P.R.J. Asveld, A. Nijholt), CWI Tract 42, Amsterdam, 1987, 43–58
J. Engelfriet, G. Leih, G. Rozenberg: Apex graph grammars and attribute grammars; Report 87-04, Leiden, 1987, to appear in Acta Informatica. See also [Ehr Nag Roz Ros], 167–185
W. Fabbri, A. Maggiolo-Schettini: A note on structure rewriting systems and Pr/T nets; Dipartimento di Informatica Pisa, Nota Scientifica S-35-84, November 1984
H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan: Petri nets and their relation to graph grammars; in [Ehr Nag Roz], 115–129
H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan: Generalized handle grammars and their relation to Petri nets; EIK 20 (1984), 179–206
A. Habel, H.-J. Kreowski: Characteristics of graph languages generated by edge replacement; TCS 51 (1987), 81–115
A. Habel, H.-J. Kreowski: Some structural aspects of hypergraph languates generated by hyperedge replacement; Proc. STACS 1987, LNCS 247, Springer-Verlag, 1987, 207–219
A. Habel, H.-J. Kreowski: Pretty pattern produced by hyperedge replacement, to appear in Proc. WG 1987
A. Habel, H.-J. Kreowski, D. Plump: Jungle Evaluation, to appear in Proc. 5th Workshop on Specification of Abstract Data Types.
D. Janssens, G. Rozenberg: On the structure of node-label-controlled graph languages; Information Sciences 20 (1980), 191–216
D. Janssens, G. Rozenberg: Neighborhood-uniform NLC grammars; Comput. Vision, Graphics, Image Proc. 35 (1986), 131–151
D. Janssens, G. Rozenberg: Hypergraph systems and their extensions; RAIRO Informatique Theorique 17 (1983), 163–196
D. Janssens, G. Rozenberg: A characterization of context-free string languates by directed node-label controlled graph grammars; Acta Informatica 16 (1981), 63–85
D. Janssens, G. Rozenberg: Basic notions of actor grammars: A graph grammar model for actor computation; in [Ehr Nag Roz Ros], 280–298
H.-J. Kreowski: A comparison between Petri-nets and graph grammars, Springer LNCS 100 (1981), 306–317
H.-J. Kreowski: Graph grammar derivation processes, Proc. Graphtheoretic Concepts in Comp. Sci. 1983, Trauner Verlag, Linz 1983, 136–150
H.-J. Kreowski: Is parallelism already concurrency? — Part I: Derivations in graph grammars; in: [Ehr Nag Roz], 343–360
H.-J. Kreowski, G. Rozenberg: On the constructive descriptiion of graph languages accepted by finite automata, Proc. MFCS 1981, LNCS 118, 1981, 398–409
H.-J. Kreowski, A. Wilharm: Solving conflicts in graph grammar derivation processes, Proc. Workshop, Graphtheoretic Concepts in Comp. Sci. 1985, Trauner Verlag, Linz 1985, 161–180
H.-J. Kreowski, A. Wilharm: Net processes correspond to derivation processes in graph grammars, Theoret. Comp. Sci. 44, 275–305 (1986)
H.-J. Kreowski, A. Wilharm: Is parallelism already concurrency? — Part II: Nonsequential processes in graph grammars; in: [Ehr Nag Roz], 361–377
C. Lautemann: Efficient algorithms on context-free graph languages; to appear in Proc. ICALP 1988
T. Lengauer, K.W. Wagner: The correlation between the complexities of the non-hierarchical and hierarchical version of graph problems; LNCS 247, (1987), 100–113
T. Lengauer, E. Wanke: Efficient solution of connectivity problems on hierarchically defined graphs; to appear in SIAM J. Comput. (1988)
A. Maggiolo-Schettini, M. Napoli, G. Tortora: Web structure: A tool for representing and manipulating programs; IEEE T. on Soft. Eng., 1988, to appear
A. Maggiolo-Schettini, J. Winkowski: Processes of transforming structures; J. Comp. Syst. Sci. 24 (1982), 245–238
A. Maggiolo-Schettini, J. Winkowski: Towards a programming language for manipulating relational data bases; in: D. Bjorner (ed.), Formal Description of Programming Concepts II, North-Holland, Amsterdam, 1983, 265–280
A. Martelli, U. Montanari: Nonserial Dynamic Programming: On the Optimal Strategy of Variable Elimination for the Rectangular Lattice, Journal of Mathematical Analysis and Application, 40, No 1, (Oct 1972), 226–242
J. Meseguer, U. Montanari: Petri nets are monoids; to appear in Proc. Logics in Comp. Sci. 1988
D. Moldovan, F. Parisi-Presicce: Parallelism analysis in rule-based systems using graph grammars; in: [Ehr Nag Roz Ros], 427–439
U. Montanari, F. Rossi: An efficient algorithm for the solution of hierarchical networks of constraints; in [Ehr Nag Roz Ros], 440–457
G. Rozenberg, E. Welzl: Boundary NLC graph grammars — basic definitions, normal forms, and complexity; Inform. Contr. 69 (1986), 136–167
G. Rozenberg, E. Welzl: Graph theoretic closure properties of the family of boundary NLC graph languages; Acta Informatica 23 (1986), 289–309
J. Winkowski, A. Maggiolo-Schettini: An algebra of processes; J. Comp. Syst. Sci. 35 (1987), 206–228
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrig, H., Löwe, M. (1991). Computing by graph transformation: Overall aims and new results. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017422
Download citation
DOI: https://doi.org/10.1007/BFb0017422
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54478-4
Online ISBN: 978-3-540-38395-6
eBook Packages: Springer Book Archive