{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:39:14Z","timestamp":1743122354358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030129873"},{"type":"electronic","value":"9783030129880"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12988-0_10","type":"book-chapter","created":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:50:09Z","timestamp":1548982209000},"page":"161-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Model Transformation with Triple Graph Grammars and Non-terminal Symbols"],"prefix":"10.1007","author":[{"given":"William","family":"da Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Max","family":"Bureck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ina","family":"Schieferdecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Hein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Anjorin, A., Leblebici, E., Sch\u00fcrr, A.: 20 years of triple graph grammars: a roadmap for future research. Electron. Commun. EASST 73 (2016). \n                    https:\/\/doi.org\/10.14279\/tuj.eceasst.73.1031","DOI":"10.14279\/tuj.eceasst.73.1031"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-54804-8_24","volume-title":"Fundamental Approaches to Software Engineering","author":"A Anjorin","year":"2014","unstructured":"Anjorin, A., Saller, K., Lochau, M., Sch\u00fcrr, A.: Modularizing triple graph grammars using rule refinement. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 340\u2013354. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-642-54804-8_24"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24721-0_16","volume-title":"Fundamental Approaches to Software Engineering","author":"R Bardohl","year":"2004","unstructured":"Bardohl, R., Ehrig, H., de Lara, J., Taentzer, G.: Integrating meta-modelling aspects with\u00a0graph\u00a0transformation\u00a0for\u00a0efficient visual language definition and model manipulation. In: Wermelinger, M., Margaria-Steffen, T. (eds.) FASE 2004. LNCS, vol. 2984, pp. 214\u2013228. Springer, Heidelberg (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-24721-0_16"},{"issue":"1\u20133","key":"10_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2004.09.040","volume":"332","author":"FJ Brandenburg","year":"2005","unstructured":"Brandenburg, F.J., Skodinis, K.: Finite graph automata for linear and boundary graph languages. Theor. Comput. Sci. 332(1\u20133), 199\u2013232 (2005). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2004.09.040","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-21145-9_2","volume-title":"Graph Transformation","author":"F Drewes","year":"2015","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Predictive top-down parsing for hyperedge replacement grammars. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 19\u201334. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-21145-9_2"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-319-61470-0_7","volume-title":"Graph Transformation","author":"F Drewes","year":"2017","unstructured":"Drewes, F., Hoffmann, B., Minas, M.: Predictive shift-reduce parsing for hyperedge replacement grammars. In: de Lara, J., Plump, D. (eds.) ICGT 2017. LNCS, vol. 10373, pp. 106\u2013122. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-61470-0_7"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"F. DREWES","year":"1997","unstructured":"Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement graph grammars. In: Handbook Of Graph Grammars and Computing by Graph Transformation: Volume 1: Foundations, pp. 95\u2013162. World Scientific (1997). \n                    https:\/\/doi.org\/10.1142\/9789812384720_0002"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1142\/3303","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"H Ehrig","year":"1999","unstructured":"Ehrig, H., Rozenberg, G., Kreowski, H.J., Montanari, U.: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 3. World Scientific, Singapore (1999). \n                    https:\/\/doi.org\/10.1142\/3303"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0890-5401(90)90038-J","volume":"84","author":"J Engelfiet","year":"1990","unstructured":"Engelfiet, J., Rozenberg, G.: A comparison of boundary graph grammars and context-free hypergraph grammars. Inf. Comput. 84(2), 163\u2013206 (1990). \n                    https:\/\/doi.org\/10.1016\/0890-5401(90)90038-J","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"10_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(97)00212-0","volume":"201","author":"M Flasi\u0144ski","year":"1998","unstructured":"Flasi\u0144ski, M.: Power properties of NLC graph grammars with a polynomial membership problem. Theor. Comput. Sci. 201(1\u20132), 189\u2013231 (1998). \n                    https:\/\/doi.org\/10.1016\/S0304-3975(97)00212-0","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0031-3203(93)90083-9","volume":"26","author":"M Flasi\u0144ski","year":"1993","unstructured":"Flasi\u0144ski, M.: On the parsing of deterministic graph languages for syntactic pattern recognition. Pattern Recognit. 26(1), 1\u201316 (1993). \n                    https:\/\/doi.org\/10.1016\/0031-3203(93)90083-9","journal-title":"Pattern Recognit."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-11331-9_24","volume-title":"Computer Vision and Graphics","author":"M Flasi\u0144ski","year":"2014","unstructured":"Flasi\u0144ski, M., Flasi\u0144ska, Z.: Characteristics of bottom-up parsable edNLC graph languages for syntactic pattern recognition. In: Chmielewski, L.J., Kozera, R., Shin, B.-S., Wojciechowski, K. (eds.) ICCVG 2014. LNCS, vol. 8671, pp. 195\u2013202. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-11331-9_24"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.entcs.2008.04.048","volume":"211","author":"F Hermann","year":"2008","unstructured":"Hermann, F., Ehrig, H., Taentzer, G.: A typed attributed graph grammar with inheritance for the abstract syntax of UML class and sequence diagrams. Electron. Notes Theor. Comput. Sci. 211, 261\u2013269 (2008). \n                    https:\/\/doi.org\/10.1016\/j.entcs.2008.04.048","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-31847-7_6","volume-title":"Formal Methods in Software and Systems Modeling","author":"B Hoffmann","year":"2005","unstructured":"Hoffmann, B.: Graph transformation with variables. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 101\u2013115. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/978-3-540-31847-7_6"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(82)90088-3","volume":"21","author":"D Janssens","year":"1982","unstructured":"Janssens, D., Rozenberg, G.: Graph grammars with neighbourhood-controlled embedding. Theor. Comput. Sci. 21(1), 55\u201374 (1982). \n                    https:\/\/doi.org\/10.1016\/0304-3975(82)90088-3","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"10_CR16","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/PL00013320","volume":"37","author":"C Kim","year":"2001","unstructured":"Kim, C.: Efficient recognition algorithms for boundary and linear eNCE graph languages. Acta Inform. 37(9), 619\u2013632 (2001). \n                    https:\/\/doi.org\/10.1007\/PL00013320","journal-title":"Acta Inform."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2012.02.038","volume":"438","author":"C Kim","year":"2012","unstructured":"Kim, C.: On the structure of linear apex NLC graph grammars. Theor. Comput. Sci. 438, 28\u201333 (2012). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2012.02.038","journal-title":"Theor. Comput. Sci."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-17322-6_8","volume-title":"Graph Transformations and Model-Driven Engineering","author":"F Klar","year":"2010","unstructured":"Klar, F., Lauder, M., K\u00f6nigs, A., Sch\u00fcrr, A.: Extended triple graph grammars with efficient and compatible graph translators. In: Engels, G., Lewerentz, C., Sch\u00e4fer, W., Sch\u00fcrr, A., Westfechtel, B. (eds.) Graph Transformations and Model-Driven Engineering. LNCS, vol. 5765, pp. 141\u2013174. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-17322-6_8"},{"issue":"1\u20133","key":"10_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G Rozenberg","year":"1986","unstructured":"Rozenberg, G., Welzl, E.: Boundary NLC graph grammars-basic definitions, normal forms, and complexity. Inf. Control. 69(1\u20133), 136\u2013167 (1986). \n                    https:\/\/doi.org\/10.1016\/S0019-9958(86)80045-6","journal-title":"Inf. Control."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-59071-4_45","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Sch\u00fcrr","year":"1995","unstructured":"Sch\u00fcrr, A.: Specification of graph translators with triple graph grammars. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 151\u2013163. Springer, Heidelberg (1995). \n                    https:\/\/doi.org\/10.1007\/3-540-59071-4_45"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-46464-8_4","volume-title":"Theory and Application of Graph Transformations","author":"K Skodinis","year":"2000","unstructured":"Skodinis, K., Wanke, E.: Neighborhood-preserving node replacements. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 45\u201358. Springer, Heidelberg (2000). \n                    https:\/\/doi.org\/10.1007\/978-3-540-46464-8_4"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(91)90035-Z","volume":"94","author":"E Wanke","year":"1991","unstructured":"Wanke, E.: Algorithms for graph problems on BNLC structured graphs. Inf. Comput. 94(1), 93\u2013122 (1991). \n                    https:\/\/doi.org\/10.1016\/0890-5401(91)90035-Z","journal-title":"Inf. Comput."}],"container-title":["Communications in Computer and Information Science","Formal Techniques for Safety-Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12988-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:49:58Z","timestamp":1558396198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12988-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030129873","9783030129880"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12988-0_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FTSCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Formal Techniques for Safety-Critical Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ftscs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ftscs.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}