E-Book, Englisch, Band 12150, 335 Seiten, eBook
13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings
E-Book, Englisch, Band 12150, 335 Seiten, eBook
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-030-51372-6
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark
The 16 research papers and 4 tool paper presented in this book were carefully reviewed and selected from 40 submissions. One invited paper is also included. The papers deal with the following topics: theoretical advances; application domains; and tool presentations.*The conference was held virtually due to the COVID-19 pandemic.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Theoretical Advances.-
Conditional Bigraphs.- Confluence up to Garbage.- Computing embeddings of directed bigraphs.- A Categorical Semantics for Guarded Petri Nets.- Unfolding Symbolic Attributed Graph Grammars.- Single Pushout Rewriting in Comprehensive Systems.- Initial Conflicts for Transformation Rules with Nested Application Conditions.- Patch Graph Rewriting.- Hypergraph basic categorial grammars.- Multilevel Typed Graph Transformations.-
Application Domains.-
Rewriting Theory for the Life Sciences: A Unifying Framework for CTMC Semantics.- Algebras for tree decomposable graphs.- Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers.- Graph Consistency as a Graduated Property: Consistency-Sustaining and -Improving Graph Transformations.- Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions.- Optimistic and Pessimistic On-the- y Analysis for Metric Temporal Graph Logic.-
Tool Presentations.-
A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java.- Multiscale graph grammars can generate Cayley graphs of groups and monoids.- The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants.- A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale Topologies.
