Handbook of Graph Grammars and Computing by Graph Transformation
- 553 Seiten
- 20 Lesestunden
Graph grammars originated in the late 1960s, driven by interests in pattern recognition and compiler construction. Over the years, their applications have expanded significantly, encompassing software specification, VLSI layout, database design, modeling of concurrent systems, parallel computer architectures, logic programming, computer animation, developmental biology, music composition, and visual languages, among others. Graph grammars and transformations extend formal language theory and term rewriting, establishing a fundamental programming paradigm where computation integrates specification, programming, and implementation. In the past 25 years, this field has matured into a theoretically robust area of research, now grounded in solid foundations presented in this volume. The first volume of the Handbook of Graph Grammars and Computing by Graph Transformations offers a comprehensive overview of the foundational approaches to rule-based graph specification, including algebraic, logic, node-based, (hyper)edge-based rewriting, programmed graph rewriting, and 2-structures. Written in a tutorial and survey style, the book aims to enhance its accessibility and usefulness for researchers and practitioners alike.
