{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:40Z","timestamp":1762459000427},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_63","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:47:58Z","timestamp":1330199278000},"page":"343-360","source":"Crossref","is-referenced-by-count":17,"title":["Is parallelism already concurrency? Part 1: Derivations in graph grammars"],"prefix":"10.1007","author":[{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"24_CR1","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":"24_CR2","doi-asserted-by":"crossref","unstructured":"I. Castellani, U. Montanari: Graph Grammars for Distributed Systems, in [12], 20\u201338.","DOI":"10.1007\/BFb0000097"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph Grammars and Their Application to Computer Science and Biology, LNCS 73 (1979).","DOI":"10.1007\/BFb0025713"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/03081077608934737","volume":"3","author":"K. Culik II","year":"1976","unstructured":"K. Culik II, A. Lindenmayer: Parallel Rewriting on Graphs and Multidimensional Development, Int. Journ. of Gen. Systems 3, 53\u201366 (1976).","journal-title":"Int. Journ. of Gen. Systems"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. Della Vigna","year":"1978","unstructured":"P. Della Vigna, C. Ghezzi: Context-Free Graph Grammars, Inf. Contr. 37, 207\u2013233 (1978).","journal-title":"Inf. Contr."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars, in [3], 1\u201369.","DOI":"10.1007\/BFb0025714"},{"key":"24_CR7","unstructured":"-: Aspects of concurrency in graph grammars, in [12], 58\u201381."},{"key":"24_CR8","unstructured":"H. Ehrig, H.-J. Kreowski: Church-Rosser Theorems Leading to Parallel and Canonical Derivations in Graph-Grammars, TU Berlin, Comp. Sci. Report 75-27 (1975)."},{"key":"24_CR9","unstructured":"-: Parallel Graph Grammars, in \"Automata, Languages, Development\", (eds. A. Lindenmayer and G. Rozenberg), Amsterdam, 425\u2013442 (1976)."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0306-4379(80)90014-9","volume":"5","author":"H. Ehrig","year":"1980","unstructured":"-: 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":"24_CR11","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: Transformations of Structures: An Algebraic Approach, Math. Syst. Theory 14, 305\u2013334 (1981).","journal-title":"Math. Syst. Theory"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph Grammars and Their Application to Computer Science (2nd Int. Workshop), LNCS 153 (1983).","DOI":"10.1007\/BFb0000094"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Pfender, H.J. Schneider: Graph Grammars: An Algebraic Approach, Proc. of the IEEE Conf. on Automata and Switching Theory, Iowa City, 167\u2013180 (1973).","DOI":"10.1109\/SWAT.1973.11"},{"key":"24_CR14","unstructured":"H. Ehrig, B.K. Rosen: Commutativity of Independent Transformations on Complex Objects, IBM Research Report RC 6251 (1976)."},{"key":"24_CR15","first-page":"165","volume":"64","author":"H. Ehrig","year":"1978","unstructured":"-: Concurrency of Manipulation in Multidimensional Information Structures, LNCS 64, 165\u2013176 (1978).","journal-title":"LNCS"},{"key":"24_CR16","unstructured":"-: Commutativity, Parallelism and Concurrency for Transformations of Structures, TU Berlin, Comp. Sci. Report 79-21 (1979)."},{"key":"24_CR17","unstructured":"-: The Mathematics of Record Handling, SIAM J. COMPUT., Vol. 9, No. 3 (1980)."},{"key":"24_CR18","unstructured":"H. Ehrig, G. Rozenberg: Some Definitional Suggestions for Parallel Graph Grammars, in \"Automata, Languages, Development\", (eds. A. Lindenmayer and G. Rozenberg), Amsterdam, 443\u2013468 (1976)."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"H. Ehrig, J. Staples: Church-Rosser properties for graph replacement systems with unique splitting, in [12], 82\u2013101.","DOI":"10.1007\/BFb0000100"},{"key":"24_CR20","volume-title":"Syntactic Methods in Pattern Recognition","author":"K.S. Fu","year":"1974","unstructured":"K.S. Fu: Syntactic Methods in Pattern Recognition, Academic Press, New York 1974."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan: Petri nets and their relation to graph grammars, in [12], 115\u2013129.","DOI":"10.1007\/BFb0000102"},{"key":"24_CR22","unstructured":"A. Habel: Concurrency in Graph-Grammatiken, TU Berlin, Comp. Sci. Report 80-11 (1980)."},{"key":"24_CR23","unstructured":"A. Habel, H.-J. Kreowski: Characteristics of graph languages generated by edge replacement, University of Bremen, Comp. Sci. Report 3\/85 (1985), to appear in in Theoret. Comp. Sci."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"B. Hoffmann: Modelling compiler generation by graph grammars, in [12], 159\u2013171.","DOI":"10.1007\/BFb0000105"},{"key":"24_CR25","unstructured":"D. Janssens, H.-J. Kreowski, G. Rozenberg, H. Ehrig: Concurrency of Node-Label-Controlled Graph Transformations, University of Antwerp, Comp. Sci. Report 82-38 (1982)."},{"key":"24_CR26","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 grammars, Information Science 20, 191\u2013216 (1980).","journal-title":"Information Science"},{"key":"24_CR27","unstructured":"H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph. D. Thesis, Comp. Sci. Dept., TU Berlin (1977)."},{"key":"24_CR28","unstructured":"-: Anwendungen der Algebraischen Theorie von Graph-Grammatiken auf Konsistenz und Synchronisation in Datenbanksystemen, Techn. Report 78-15, TU Berlin (1978)."},{"key":"24_CR29","first-page":"306","volume":"100","author":"H.-J. Kreowski","year":"1981","unstructured":"-: A Comparison Between Petri-Nets and Graph Grammars, LNCS 100, 306\u2013317 (1981).","journal-title":"LNCS"},{"key":"24_CR30","first-page":"136","volume-title":"Graph Grammar Derivation Processes, Proc. Graphtheoretic Concepts in Computer Science 1983","author":"H.-J. Kreowski","year":"1983","unstructured":"-: Graph Grammar Derivation Processes, Proc. Graphtheoretic Concepts in Computer Science 1983, Trauner Verlag, Linz 1983, 136\u2013150."},{"key":"24_CR31","doi-asserted-by":"crossref","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":"24_CR32","unstructured":"B. Mayoh: Another Model for the Development of Multidimensional Organisms, in \"Automata, Languages, Development\" (eds. A. Lindenmayer, G. Rozenberg), Amsterdam 1976, 469\u2013486."},{"key":"24_CR33","first-page":"165","volume-title":"Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study","author":"B. Mahr","year":"1982","unstructured":"B. Mahr, A. Wilharm: Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study, Proc. Graphtheoretic Concepts in Computer Science 1982, Hanser Verlag, M\u00fcnchen\/Wien 1982, 165\u2013176."},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"A. Meier: A Graph-Relational Approach to Geographic Databases, in [12], 245\u2013254.","DOI":"10.1007\/BFb0000111"},{"key":"24_CR35","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0019-9958(70)90135-X","volume":"16","author":"U.G. Montanari","year":"1970","unstructured":"U.G. Montanari: Separable Graphs, Planar Graphs and Web Grammars, Inf. Contr. 16, 243\u2013267 (1970).","journal-title":"Inf. Contr."},{"key":"24_CR36","unstructured":"R. Munz: Das WEB-Modell, Ph. D. Thesis, Comp. Sci. Dept., University of Stuttgart (1976)."},{"issue":"1","key":"24_CR37","first-page":"16","volume":"8","author":"M. Nagl","year":"1975","unstructured":"M. Nagl: Graph Lindenmayer-Systems and Languages, Arbeitsber. d. Inst. f. Math. Masch. und Datenverar. 8,1, 16\u201363 (1975).","journal-title":"Arbeitsber. d. Inst. f. Math. Masch. und Datenverar"},{"key":"24_CR38","unstructured":"-: Graph-Grammatiken, Verlag Vieweg und Sohn, Braunschweig\/Wiesbaden 1979."},{"key":"24_CR39","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(82)90056-1","volume":"19","author":"P. Padawitz","year":"1982","unstructured":"P. Padawitz: Graph Grammars and Operational Semantics, Theoret. Comp. Sci. 19, 117\u2013141 (1982).","journal-title":"Theoret. Comp. Sci."},{"key":"24_CR40","unstructured":"J.L. Pfaltz, A. Rosenfeld: Web Grammars, Proc. Int. Joint Conf. Art. Intelligence, 609\u2013619 (1969)."},{"key":"24_CR41","first-page":"560","volume":"5","author":"T. Pratt","year":"1971","unstructured":"T. Pratt: Pair Grammars, Graph Languages and String-to-Graph Translations, Journ. Comp. Sci. 5, 560\u2013595 (1971).","journal-title":"Journ. Comp. Sci."},{"key":"24_CR42","first-page":"318","volume":"100","author":"W. Reisig","year":"1981","unstructured":"W. Reisig: A Graph Grammar Representation of Nonsequential Processes, LNCS 100, 318\u2013325 (1981).","journal-title":"LNCS"},{"key":"24_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets, An Introduction","author":"W. Reisig","year":"1985","unstructured":"-: Petri Nets, An Introduction, Springer Verlag, Berlin\/Heidelberg\/New York\/Tokyo 1985."},{"issue":"3","key":"24_CR44","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/1008343.1008344","volume":"7","author":"B.K. Rosen","year":"1975","unstructured":"B.K. Rosen: A Church-Rosser Theorem for Graph Grammars, SIGACT News 7,3,26\u201331 (1975).","journal-title":"SIGACT News"},{"key":"24_CR45","first-page":"307","volume":"7","author":"A. Rosenfeld","year":"1972","unstructured":"A. Rosenfeld, D. Milgram: Web automata and web grammars, Machine Intelligence 7, 307\u2013324 (1972).","journal-title":"Machine Intelligence"},{"key":"24_CR46","unstructured":"H.J. Schneider: Chomsky-Systeme f\u00fcr partielle Ordnungen, Arbeitsber. d. Inst. f. Math. Masch. und Datenverar. 3,3 (1970)."},{"key":"24_CR47","first-page":"192","volume":"26","author":"H.J. Schneider","year":"1975","unstructured":"-: Syntax-Directed Description of Incremental Compilers, LNCS 26, 192\u2013201 (1975).","journal-title":"LNCS"},{"key":"24_CR48","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00288659","volume":"6","author":"H.J. Schneider","year":"1976","unstructured":"H.J. Schneider, H. Ehrig: Grammars on Partial Graphs, Acta Informatica 6, 297\u2013316 (1976).","journal-title":"Acta Informatica"},{"key":"24_CR49","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0019-9958(69)90017-5","volume":"14","author":"A.C. Shaw","year":"1969","unstructured":"A.C. Shaw: A Formal Description Schema as a Basis for Picture Processing Systems, Inf. Contr. 14, 9\u201352 (1969).","journal-title":"Inf. Contr."},{"key":"24_CR50","unstructured":"A. Wilharm: Anwendung der Theorie von Graphgrammatiken auf die Spezifikation der Prozess-Steuerung von Eisenbahnsystemen, TU Berlin, Comp. Sci. Report 81-15 (1981)."}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:35Z","timestamp":1605644135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}