{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:15:15Z","timestamp":1761488115229},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_24","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T10:48:17Z","timestamp":1221648497000},"page":"351-365","source":"Crossref","is-referenced-by-count":8,"title":["Graph Multiset Transformation as a Framework for Massively Parallel Computation"],"prefix":"10.1007","author":[{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"first","affiliation":[]},{"given":"Sabine","family":"Kuske","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.M. Holland","year":"1975","unstructured":"Holland, J.M.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"24_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The Design of Innovation: Lessons from and for Competent Genetic Algorithms","author":"D.E. Goldberg","year":"2002","unstructured":"Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Addison-Wesley, Reading (2002)"},{"key":"24_CR3","volume-title":"Evolutionary Computation: Toward a New Philosophy of Machine Intelligence","author":"D.B. Fogel","year":"2006","unstructured":"Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, 3rd edn. IEEE Press, Piscataway (2006)","edition":"3"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"24_CR5","volume-title":"DNA Computing \u2014 New Computing Paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing \u2014 New Computing Paradigms. Springer, Heidelberg (1998)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-45711-9_9","volume-title":"Formal and Natural Computing","author":"H.J. Kreowski","year":"2002","unstructured":"Kreowski, H.J.: A sight-seeing tour of the computational landscape of graph transformation. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, pp. 119\u2013137. Springer, Heidelberg (2002)"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1142\/S0218194097000278","volume":"7","author":"H.J. Kreowski","year":"1997","unstructured":"Kreowski, H.J., Kuske, S., Sch\u00fcrr, A.: Nested graph transformation units. International Journal on Software Engineering and Knowledge Engineering\u00a07(4), 479\u2013502 (1997)","journal-title":"International Journal on Software Engineering and Knowledge Engineering"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1142\/9789812815149_0015","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages and Tools","author":"H.J. Kreowski","year":"1999","unstructured":"Kreowski, H.J., Kuske, S.: Graph transformation units and modules. In: Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Applications, Languages and Tools, vol.\u00a02, pp. 607\u2013638. World Scientific, Singapore (1999)"},{"issue":"6","key":"24_CR9","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/s001659970005","volume":"11","author":"H.J. Kreowski","year":"1999","unstructured":"Kreowski, H.J., Kuske, S.: Graph transformation units with interleaving semantics. Formal Aspects of Computing\u00a011(6), 690\u2013723 (1999)","journal-title":"Formal Aspects of Computing"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-3-540-46464-8_23","volume-title":"Theory and Application of Graph Transformations","author":"S. Kuske","year":"2000","unstructured":"Kuske, S.: More about control conditions for transformation units. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 323\u2013337. Springer, Heidelberg (2000)"},{"key":"24_CR11","unstructured":"Kuske, S.: Transformation Units\u2014A Structuring Principle for Graph Transformation Systems. PhD thesis, University of Bremen (2000)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45315-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Habel","year":"2001","unstructured":"Habel, A., Plump, D.: Computational completeness of programming languages based on graph transformation. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.\u00a02030, pp. 230\u2013245. Springer, Heidelberg (2001)"},{"issue":"2","key":"24_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-33204","volume":"33","author":"D. Plump","year":"1998","unstructured":"Plump, D.: Termination of graph rewriting is undecidable. Fundamenta Informaticae\u00a033(2), 201\u2013209 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-45832-8_10","volume-title":"Graph Transformation","author":"E. Godard","year":"2002","unstructured":"Godard, E., M\u00e9tivier, Y., Mosbah, M., Sellami, A.: Termination detection of distributed algorithms by graph relabelling systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 106\u2013119. Springer, Heidelberg (2002)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-540-31984-9_5","volume-title":"Fundamental Approaches to Software Engineering","author":"H. Ehrig","year":"2005","unstructured":"Ehrig, H., Ehrig, K., Taentzer, G., de Lara, J., Varr\u00f3, D., Varr\u00f3-Gyapai, S.: Termination criteria for model transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 49\u201363. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:37:35Z","timestamp":1606185455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}