1 option
Graph Transformation : 14th International Conference, ICGT 2021, Held as Part of STAF 2021, Virtual Event, June 24-25, 2021, Proceedings / edited by Fabio Gadducci, Timo Kehrer.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12741
- Theoretical Computer Science and General Issues, 2512-2029 ; 12741
- Language:
- English
- Subjects (All):
- Computer science-Mathematics.
- Discrete mathematics.
- Computer graphics.
- Algorithms.
- Data structures (Computer science).
- Information theory.
- Computer programming.
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Design and Analysis of Algorithms.
- Data Structures and Information Theory.
- Programming Techniques.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Computer Graphics.
- Design and Analysis of Algorithms.
- Data Structures and Information Theory.
- Programming Techniques.
- Physical Description:
- 1 online resource (XII, 303 pages) : 64 illustrations, 10 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 14th International Conference on Graph Transformation, ICGT 2021, which took place virtually during June 24-25, 2021. The 14 full papers and 2 tool papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the following topics: theoretical advances; application domains; and tool presentations.
- Contents:
- Theoretical Advances
- Concurrency Theorems for Non-linear Rewriting Theories
- A Generalized Concurrent Rule Construction for Double-Pushout Rewriting
- Transformations of Reaction Systems over Categories by means of Epi-Mono Factorization and Functors
- Graph Rewriting and Relabeling with PBPO+
- Incorrectness Logic for Graph Programs
- Powerful and NP-Complete: Hypergraph Lambek Grammars
- Evaluation Diversity for Graph Conditions
- Application Domains
- Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching
- Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars
- Nets with Mana: A Framework for Chemical Reaction Modelling
- A Case Study on the Graph-transformational Modeling and Analysis of Puzzles
- Interval Probabilistic Timed Graph Transformation Systems
- Verifying Graph Programs with Monadic Second-Order Logic
- On the Complexity of Simulating Probabilistic Timed Graph Transformation Systems
- Tool Presentations
- Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars
- GrapePress - A Computational Notebook for Graph Transformations.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-78946-6
- 9783030789466
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.