{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:18Z","timestamp":1725455898228},"publisher-location":"Berlin\/Heidelberg","reference-count":115,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354054478X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017422","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:32:12Z","timestamp":1132644732000},"page":"688-703","source":"Crossref","is-referenced-by-count":1,"title":["Computing by graph transformation: Overall aims and new results"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[]},{"given":"Michael","family":"L\u00f6we","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski, D. Seese: An Algebraic Theory of Graph Reduction, Techn. Report 90-02, University Bordeaux (1990)."},{"key":"50_CR2","unstructured":"R. Arlt, M. L\u00f6we, M. R\u00f6der: Basic Data Structures and Algorithms for Graph Grammar Implementations, Internal Technical Report, TU Berlin (1989)."},{"key":"50_CR3","unstructured":"M. Bauderon: Infinite Hypergraphs, to appear in: Theoretical Computer Science."},{"key":"50_CR4","first-page":"207","volume":"372","author":"B. Courcelle","year":"1989","unstructured":"B. Courcelle: The Definability of Equational Graphs in Monadic 2nd Order Logic, in: ICALP'89, Springer, LNCS 372, 207\u2013221 (1989).","journal-title":"LNCS"},{"key":"50_CR5","unstructured":"B. Courcelle: The Monadic 2nd Order Logic of Graphs IV: Definability Properties of Equational Graphs, to appear in: Annals of Pure and Applied Logic."},{"key":"50_CR6","unstructured":"B. Courcelle: The Monadic 2nd Order Logic of Graphs V: On Closing the Gap between Recognicability and Definability, Techn. Report 89\u201391, Univ. Bordeaux (1989). To appear in: Theoretical Computer Science."},{"key":"50_CR7","unstructured":"B. Courcelle: The Monadic 2nd Order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures, Techn. Report 89\u201399, Univ. Bordeaux (1989). To appear in: Theoretical Computer Science."},{"key":"50_CR8","unstructured":"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."},{"key":"50_CR9","unstructured":"J. Engelfriet, L.M. Heyker: The Term-generating Power of Context-free Hypergraph Grammars and Attribute Grammars, Techn. Report 89-17, Univ. Leiden (1989)."},{"key":"50_CR10","unstructured":"H. Ehrig, M. L\u00f6we (ed.): Computing by Graph Transformation: Objectives, State-of-the-art, References, Techn. Report 89-14, Techn. Univ. Berlin (1989)."},{"key":"50_CR11","unstructured":"J. Engelfriet: A Regular Characterization of Graph Languages Definable in Monadic Second-order Logic, Tech. Report 89-03, Univ. Leiden (1989)."},{"key":"50_CR12","first-page":"148","volume":"380","author":"J. Engelfriet","year":"1989","unstructured":"J. Engelfriet: Context-free NCE Graph Grammars, in: FCT'89, Springer, LNCS 380, 148\u2013161 (1989).","journal-title":"LNCS"},{"key":"50_CR13","unstructured":"A. Ehrenfeucht, G. Rozenberg: Angular 2-structures, Techn. Report 89-10, Univ. Leiden (1989)."},{"key":"50_CR14","unstructured":"A. Ehrenfeucht, G. Rozenberg: Clans and the Complexity of Dependence Graphs, Report 89-02, Leiden."},{"key":"50_CR15","unstructured":"A. Habel: Hyperedge Replacement: Grammars and Languages, Dissertation, University Bremen, FB Math.\/Informatik (1989)."},{"key":"50_CR16","first-page":"11","volume":"344","author":"A. Habel","year":"1989","unstructured":"A. Habel: Graph-Theoretic Properties Compatible with Graph Derivations, in WG'88, Springer, LNCS 344, 11\u201329 (1989).","journal-title":"LNCS"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"A. Habel, H.-J. Kreowski: Filtering Hyperedge-Replacement Languages Trough Compatible Properties, Techn. Report, Univ. Bremen 1989, 12. pages","DOI":"10.1007\/3-540-52292-1_8"},{"key":"50_CR18","unstructured":"A. Habel, H.-J. Kreowski, C. Lautemann: A Comparison of Compatible, Finite, and Inductive Graph Properties, Techn. Report 7\/89, Univ. Bremen (1989)."},{"key":"50_CR19","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/BF00288976","volume":"26","author":"A. Habel","year":"1989","unstructured":"A. Habel, H.-J. Kreowski, W. Vogler: Metatheorems for Decision Problems on Hyperedge Replacement Languages, Acta Informatica 26, 657\u2013677 (1989).","journal-title":"Acta Informatica"},{"key":"50_CR20","series-title":"LNCS","first-page":"275","volume-title":"TAPSOFT '89, Proc. of the International Joint Conference on Theory and Practice of Software Development, Vol. 1","author":"A. Habel","year":"1989","unstructured":"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\u2013289 (1989)."},{"key":"50_CR21","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1016\/0304-3975(90)90106-R"},{"key":"50_CR22","series-title":"LNCS","first-page":"275","volume-title":"Algebraic and Logic Programming","author":"B. Hoffmann","year":"1989","unstructured":"B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting, in Grabowski et al.: Algebraic and Logic Programming, Springer, Berlin, LNCS 351, 275\u2013289 (1989)."},{"key":"50_CR23","unstructured":"B. Hoffmann, D. Plump: Jungle Evaluation for Efficient Term Rewriting, to appear in: RAIRO Theoretical Informatics and Applications (1990)."},{"key":"50_CR24","unstructured":"E. Jeltsch, H.-J. Kreowski: Grammatikalische Inferenz auf der Basis von Hyperkantenersetzung, Techn. Report 9\/89, Univ. Bremen (1989)."},{"key":"50_CR25","doi-asserted-by":"crossref","unstructured":"D. Janssens, M. Lens, G. Rozenberg: Computation Graphs for Actor Grammars, Techn. Report, Univ. Leiden (1989)","DOI":"10.1007\/BF02088293"},{"key":"50_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02088293","volume":"22","author":"D. Janssens","year":"1989","unstructured":"D. Janssens, G. Rozenberg: Actor Grammars, in Mathematical System Theory 22, 75\u2013107 (1989).","journal-title":"Mathematical System Theory"},{"key":"50_CR27","unstructured":"H.-J. Kreowski, G. Rozenberg: On Structured Graph Grammars, Part I and II, to appear in: Information Sciences (1990)."},{"key":"50_CR28","unstructured":"C. Lautemann: The Complexity of Graph Languages generated by Hyperedge Replacement, Techn. Report 4\/89, Univ. Bremen 1989."},{"key":"50_CR29","unstructured":"C. Lautemann: Tree Decomposition of Graphs and Tree Automata, Techn. Report, Univ. Bremen 1989."},{"key":"50_CR30","unstructured":"M. L\u00f6we: Implementing Algebraic Specifications by Graph Transformation Systems, Techn. Report 89-26, Techn. Univ. Berlin (1989)."},{"key":"50_CR31","unstructured":"Y. Metiviet, M. Billaud, P. Lafou, E. Sopena: Graph Rewriting Systems with Priorities, in: WG'89, Springer, LNCS 411 (1990)."},{"key":"50_CR32","unstructured":"Y. Metiviet, M. Billaud, P. Lafou, E. Sopena: Graph Rewriting Systems with Priorities: Definitions and Applications, Techn. Report 8908, Univ. Bordeaux (1989)."},{"key":"50_CR33","doi-asserted-by":"crossref","unstructured":"A. Maggiolo Schettini, G.M. Pinna, J. Winkowski: A Compositional Semantics for Unmarked Predicate\/Transition Nets, Fund. Infor. (1990)","DOI":"10.3233\/FI-1991-14106"},{"key":"50_CR34","doi-asserted-by":"crossref","unstructured":"F. Parisi-Presicce: Modular System Design Applying Graph Grammars Techniques, in: ICALP'89, Springer, LNCS 372 (1989). To appear in: Theoretical Computer Science.","DOI":"10.1007\/BFb0035788"},{"key":"50_CR35","unstructured":"B. Courcelle, J. Engelfriet, G. Rozenberg: Handle-rewriting Hypergraph Grammars."},{"key":"50_CR36","unstructured":"B. Courcelle: Graphs as Relational Structures: An Algebraic and Logical Approach."},{"key":"50_CR37","unstructured":"M. Dauchet, M. Bossu, B. Warin: Rational and Recognizable Sets of Planar Directed Acyclic Graphs."},{"key":"50_CR38","unstructured":"J. Engelfriet, L.M. Heyker: Context-free Hypergraph Languages of Bounded Degree."},{"key":"50_CR39","unstructured":"H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce: High-level Replacement Systems."},{"key":"50_CR40","unstructured":"J. Engelfriet: A Characterization of Context-free Graph Languages Using Monadic Second-order Logic."},{"key":"50_CR41","unstructured":"H. Ehrig, F. Parisi-Presicce: Algebraic Specification Grammars: A Junction between Module Specifications and Graph Grammars."},{"key":"50_CR42","unstructured":"J. Engelfriet, H. Vogler: Context-free Hypergraph Grammars and Macro Tree Transducers."},{"key":"50_CR43","unstructured":"B. Hoffmann, H.-J. Kreowski, M. L\u00f6we, D. Plump: Evaluation of Expressions by Graph Transformation: A Survey."},{"key":"50_CR44","unstructured":"M. Korff: Application of Graph Grammars to Rule-based Systems."},{"key":"50_CR45","unstructured":"M. L\u00f6we, H. Ehrig: Algebraic Approach to Graph Transformation Based on Single Pushout Derivations."},{"key":"50_CR46","unstructured":"G. Lackner, E. Wanke, E. Welzl: On a Class of Polynomial Passable Edge Replacement Grammars."},{"key":"50_CR47","unstructured":"Y. Metivier, I. Litovsky: Words and Trees Rewriting Systems with Priorities."},{"key":"50_CR48","unstructured":"A. Maggiolo Schettini, J. Winkowski: A Generalization of Predicate \/ Transition Nets."},{"key":"50_CR49","unstructured":"A. Maggiolo Schettini, J. Winkowski: Grammars for Transforming Relational Structures and Predicate\/Transition Nets."},{"key":"50_CR50","unstructured":"D. Plump: Implementing Term Rewriting by Graph Reduction: Termination of Combined Systems."},{"key":"50_CR51","unstructured":"G.M. Pinna, A. Maggiolo Schettini: Transformations of Pr\/T Nets via Translation into Structure Grammars."},{"key":"50_CR52","unstructured":"J.C. Raoult: Tree Transduction Based on Hyperedge Rewriting."},{"key":"50_CR53","unstructured":"F. Rossi, A. Corradini, U. Montanari, H. Ehrig, M. L\u00f6we: Graph Grammars and Logic Programming."},{"key":"50_CR54","unstructured":"H. Schween, G. Taentzer: Application of Graph Grammars to Robotics."},{"key":"50_CR55","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(86)90070-3","volume":"13","author":"I. J. Aalbersberg","year":"1986","unstructured":"IJ. J. Aalbersberg, G. Rozenberg: Traces, dependency graphs and DNLC grammars; Discr. Appl. Math. 13 (1986), 79\u201385","journal-title":"Discr. Appl. Math."},{"key":"50_CR56","unstructured":"IJ. J. Aalbersberg, G. Rozenberg: Theory of traces; Report 86-16, Leiden 1986, to appear in TCS"},{"key":"50_CR57","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon, B. Courcelle: Graph expressions and graph rewritings; Math. Syst. Theory 20 (1987), 83\u2013127","journal-title":"Math. Syst. Theory"},{"key":"50_CR58","doi-asserted-by":"crossref","unstructured":"P. Boehm, H. Ehrig, U. Hummert, M. L\u00f6we: Towards distributed graph grammars; in [Ehr Nag Roz Ros], 86\u201398","DOI":"10.1007\/3-540-18771-5_47"},{"key":"50_CR59","first-page":"267","volume":"185","author":"P. Boehm","year":"1985","unstructured":"P. Boehm, H. Fonio, A. Habel: Amalgamation of graph transformations with applications to synchronization; LNCS 185, 267\u2013285 (1985)","journal-title":"LNCS"},{"key":"50_CR60","first-page":"307","volume":"34","author":"P. Boehm","year":"1987","unstructured":"P. Boehm, H. Fonio, A. Habel: Amalgamation of graph transformations: A synchronization mechanism, JCSS 34 (1987), 307\u2013408","journal-title":"JCSS"},{"key":"50_CR61","doi-asserted-by":"crossref","unstructured":"F.J. Brandenburg: On partially ordered graph-grammars; in [Ehr Nag Roz Ros], 99\u2013111","DOI":"10.1007\/3-540-18771-5_48"},{"key":"50_CR62","first-page":"227","volume":"294","author":"F. J. Brandenburg","year":"1988","unstructured":"F. J. Brandenburg: On polynomial time graph grammars; Proc. STACS 1988, LNCS 294, Springer-Verlag, 1988, 227\u2013236","journal-title":"LNCS"},{"key":"50_CR63","doi-asserted-by":"crossref","unstructured":"I. Castellani, U. Montanari: Graph grammars for distributed systems; in [Ehr Nag Roz], 20\u201338","DOI":"10.1007\/BFb0000097"},{"key":"50_CR64","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph grammars and their application to computer Science and biology, LNCS 73, Springer-Verlag, 1979","DOI":"10.1007\/BFb0025713"},{"key":"50_CR65","unstructured":"B. Courcelle: Recognizability and second order definability for sets of finite graphs; Report I-8634, Bordeaux, 1986. See also [Ehr Nag Roz Ros], 112\u2013146"},{"key":"50_CR66","unstructured":"B. Courcelle: On using context-free graph grammars for analyzing recursive definitions; to appear"},{"key":"50_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","volume":"42","author":"B. Courcelle","year":"1988","unstructured":"B. Courcelle: Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars; Theor. Comp. Sci. 42 (1988), 1\u2013122","journal-title":"Theor. Comp. Sci."},{"key":"50_CR68","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle: an axiomatic definition of context-free rewriting and its application to NLC graph-grammars; Theor. Comp. Sci. 55 (1987), 141\u2013181","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"50_CR69","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/23005.24038","volume":"34","author":"P. Degano","year":"1987","unstructured":"P. Degano, U. Montanari: A model of distributed systems based on graph rewriting; Journal of the ACM Vol. 34, No 2, April 1987, 411\u2013449","journal-title":"Journal of the ACM"},{"key":"50_CR70","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/0022-0000(87)90032-8","volume":"34","author":"P. Degano","year":"1987","unstructured":"P. Degano, U. Montanari: Concurrent histories: A basis for observing distributed systems; Journal of Computer and System Sciences, 34, 442\u2013461 (1987)","journal-title":"Journal of Computer and System Sciences"},{"key":"50_CR71","doi-asserted-by":"crossref","unstructured":"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\u2013170","DOI":"10.1007\/978-3-642-72822-8_11"},{"key":"50_CR72","doi-asserted-by":"crossref","unstructured":"H. Ehrig: Introduction to the algebraic theory of graph grammars (a survey); in [Cla Ehr Roz], 1\u201369","DOI":"10.1007\/BFb0025714"},{"key":"50_CR73","doi-asserted-by":"crossref","unstructured":"H. Ehrig: Aspects of concurrency in graph grammars; in [Ehr Nag Roz], 58\u201381","DOI":"10.1007\/BFb0000099"},{"key":"50_CR74","unstructured":"H. Ehrig: Tutorial introduction to the algebraic approach of graph grammars; in [Ehr Nag Roz Ros], 3\u201314"},{"key":"50_CR75","doi-asserted-by":"crossref","unstructured":"H. Ehrig, A. Habel: Graph grammars with application conditions; in \"The Book of L\", G. Rozenberg, A. Salomaa (eds.), Springer-Verlag, 1985, 87\u2013100","DOI":"10.1007\/978-3-642-95486-3_7"},{"key":"50_CR76","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-642-48895-5_23","volume":"131","author":"H. Ehrig","year":"1976","unstructured":"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\u2013351","journal-title":"Springer-Verlag, Lecture Notes Econ. Math. Syst."},{"key":"50_CR77","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0306-4379(80)90014-9","volume":"5","author":"H. Ehrig","year":"1980","unstructured":"H. Ehrig, H.-J. Kreowski: Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems; Inform. Syst. 5, 225\u2013238 (1980)","journal-title":"Inform. Syst."},{"key":"50_CR78","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01752403","volume":"14","author":"H. Ehrig","year":"1981","unstructured":"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\u2013334","journal-title":"Math. Syst. Theory"},{"key":"50_CR79","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-grammars and their application to computer science, LNCS 153, Springer-Verlag, 1983","DOI":"10.1007\/BFb0000094"},{"key":"50_CR80","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.): Graph-grammars and their application to computer science, LNCS 291, Springer-Verlag, 1987","DOI":"10.1007\/3-540-18771-5"},{"key":"50_CR81","first-page":"165","volume":"64","author":"H. Ehrig","year":"1978","unstructured":"H. Ehrig, B.K. Rosen: Concurrency of manipulation in multidimensional information structures; LNCS 64, 165\u2013176 (1978)","journal-title":"LNCS"},{"key":"50_CR82","first-page":"43","volume":"42","author":"J. Engelfriet","year":"1987","unstructured":"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\u201358","journal-title":"CWI Tract"},{"key":"50_CR83","doi-asserted-by":"crossref","unstructured":"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\u2013185","DOI":"10.1007\/3-540-18771-5_52"},{"key":"50_CR84","unstructured":"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"},{"key":"50_CR85","doi-asserted-by":"crossref","unstructured":"H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan: Petri nets and their relation to graph grammars; in [Ehr Nag Roz], 115\u2013129","DOI":"10.1007\/BFb0000102"},{"key":"50_CR86","first-page":"179","volume":"20","author":"H.J. Genrich","year":"1984","unstructured":"H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan: Generalized handle grammars and their relation to Petri nets; EIK 20 (1984), 179\u2013206","journal-title":"EIK"},{"key":"50_CR87","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0304-3975(87)90050-8","volume":"51","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Characteristics of graph languages generated by edge replacement; TCS 51 (1987), 81\u2013115","journal-title":"TCS"},{"key":"50_CR88","first-page":"207","volume":"247","author":"A. Habel","year":"1987","unstructured":"A. Habel, H.-J. Kreowski: Some structural aspects of hypergraph languates generated by hyperedge replacement; Proc. STACS 1987, LNCS 247, Springer-Verlag, 1987, 207\u2013219","journal-title":"LNCS"},{"key":"50_CR89","doi-asserted-by":"crossref","unstructured":"A. Habel, H.-J. Kreowski: Pretty pattern produced by hyperedge replacement, to appear in Proc. WG 1987","DOI":"10.1007\/3-540-18771-5_41"},{"key":"50_CR90","unstructured":"A. Habel, H.-J. Kreowski, D. Plump: Jungle Evaluation, to appear in Proc. 5th Workshop on Specification of Abstract Data Types."},{"key":"50_CR91","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens, G. Rozenberg: On the structure of node-label-controlled graph languages; Information Sciences 20 (1980), 191\u2013216","journal-title":"Information Sciences"},{"key":"50_CR92","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(86)90023-X","volume":"35","author":"D. Janssens","year":"1986","unstructured":"D. Janssens, G. Rozenberg: Neighborhood-uniform NLC grammars; Comput. Vision, Graphics, Image Proc. 35 (1986), 131\u2013151","journal-title":"Comput. Vision, Graphics, Image Proc."},{"key":"50_CR93","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1051\/ita\/1983170201631","volume":"17","author":"D. Janssens","year":"1983","unstructured":"D. Janssens, G. Rozenberg: Hypergraph systems and their extensions; RAIRO Informatique Theorique 17 (1983), 163\u2013196","journal-title":"RAIRO Informatique Theorique"},{"key":"50_CR94","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00289591","volume":"16","author":"D. Janssens","year":"1981","unstructured":"D. Janssens, G. Rozenberg: A characterization of context-free string languates by directed node-label controlled graph grammars; Acta Informatica 16 (1981), 63\u201385","journal-title":"Acta Informatica"},{"key":"50_CR95","doi-asserted-by":"crossref","unstructured":"D. Janssens, G. Rozenberg: Basic notions of actor grammars: A graph grammar model for actor computation; in [Ehr Nag Roz Ros], 280\u2013298","DOI":"10.1007\/3-540-18771-5_59"},{"key":"50_CR96","first-page":"306","volume":"100","author":"H.-J. Kreowski","year":"1981","unstructured":"H.-J. Kreowski: A comparison between Petri-nets and graph grammars, Springer LNCS 100 (1981), 306\u2013317","journal-title":"Springer LNCS"},{"key":"50_CR97","unstructured":"H.-J. Kreowski: Graph grammar derivation processes, Proc. Graphtheoretic Concepts in Comp. Sci. 1983, Trauner Verlag, Linz 1983, 136\u2013150"},{"key":"50_CR98","doi-asserted-by":"crossref","unstructured":"H.-J. Kreowski: Is parallelism already concurrency? \u2014 Part I: Derivations in graph grammars; in: [Ehr Nag Roz], 343\u2013360","DOI":"10.1007\/3-540-18771-5_63"},{"key":"50_CR99","first-page":"398","volume":"118","author":"H.-J. Kreowski","year":"1981","unstructured":"H.-J. Kreowski, G. Rozenberg: On the constructive descriptiion of graph languages accepted by finite automata, Proc. MFCS 1981, LNCS 118, 1981, 398\u2013409","journal-title":"LNCS"},{"key":"50_CR100","unstructured":"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\u2013180"},{"key":"50_CR101","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0304-3975(86)90124-6","volume":"44","author":"H.-J. Kreowski","year":"1986","unstructured":"H.-J. Kreowski, A. Wilharm: Net processes correspond to derivation processes in graph grammars, Theoret. Comp. Sci. 44, 275\u2013305 (1986)","journal-title":"Theoret. Comp. Sci."},{"key":"50_CR102","doi-asserted-by":"crossref","unstructured":"H.-J. Kreowski, A. Wilharm: Is parallelism already concurrency? \u2014 Part II: Nonsequential processes in graph grammars; in: [Ehr Nag Roz], 361\u2013377","DOI":"10.1007\/3-540-18771-5_64"},{"key":"50_CR103","doi-asserted-by":"crossref","unstructured":"C. Lautemann: Efficient algorithms on context-free graph languages; to appear in Proc. ICALP 1988","DOI":"10.1007\/3-540-19488-6_128"},{"key":"50_CR104","first-page":"100","volume":"247","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer, K.W. Wagner: The correlation between the complexities of the non-hierarchical and hierarchical version of graph problems; LNCS 247, (1987), 100\u2013113","journal-title":"LNCS"},{"key":"50_CR105","doi-asserted-by":"crossref","unstructured":"T. Lengauer, E. Wanke: Efficient solution of connectivity problems on hierarchically defined graphs; to appear in SIAM J. Comput. (1988)","DOI":"10.1137\/0217068"},{"key":"50_CR106","doi-asserted-by":"crossref","unstructured":"A. Maggiolo-Schettini, M. Napoli, G. Tortora: Web structure: A tool for representing and manipulating programs; IEEE T. on Soft. Eng., 1988, to appear","DOI":"10.1109\/32.9050"},{"key":"50_CR107","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0022-0000(82)90029-0","volume":"24","author":"A. Maggiolo-Schettini","year":"1982","unstructured":"A. Maggiolo-Schettini, J. Winkowski: Processes of transforming structures; J. Comp. Syst. Sci. 24 (1982), 245\u2013238","journal-title":"J. Comp. Syst. Sci."},{"key":"50_CR108","first-page":"265","volume-title":"Formal Description of Programming Concepts II","author":"A. Maggiolo-Schettini","year":"1983","unstructured":"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\u2013280"},{"issue":"1","key":"50_CR109","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0022-247X(72)90046-7","volume":"40","author":"A. Martelli","year":"1972","unstructured":"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\u2013242","journal-title":"Journal of Mathematical Analysis and Application"},{"key":"50_CR110","unstructured":"J. Meseguer, U. Montanari: Petri nets are monoids; to appear in Proc. Logics in Comp. Sci. 1988"},{"key":"50_CR111","doi-asserted-by":"crossref","unstructured":"D. Moldovan, F. Parisi-Presicce: Parallelism analysis in rule-based systems using graph grammars; in: [Ehr Nag Roz Ros], 427\u2013439","DOI":"10.1007\/3-540-18771-5_68"},{"key":"50_CR112","doi-asserted-by":"crossref","unstructured":"U. Montanari, F. Rossi: An efficient algorithm for the solution of hierarchical networks of constraints; in [Ehr Nag Roz Ros], 440\u2013457","DOI":"10.1007\/3-540-18771-5_69"},{"key":"50_CR113","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Boundary NLC graph grammars \u2014 basic definitions, normal forms, and complexity; Inform. Contr. 69 (1986), 136\u2013167","journal-title":"Inform. Contr."},{"key":"50_CR114","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Graph theoretic closure properties of the family of boundary NLC graph languages; Acta Informatica 23 (1986), 289\u2013309","journal-title":"Acta Informatica"},{"key":"50_CR115","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/0022-0000(87)90013-4","volume":"35","author":"J. Winkowski","year":"1987","unstructured":"J. Winkowski, A. Maggiolo-Schettini: An algebra of processes; J. Comp. Syst. Sci. 35 (1987), 206\u2013228","journal-title":"J. Comp. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017422.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T03:49:17Z","timestamp":1626752957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354054478X"],"references-count":115,"URL":"https:\/\/doi.org\/10.1007\/bfb0017422","relation":{},"subject":[]}}