LEADER 05683nam 2200517 450 001 996478861703316 005 20221230063109.0 010 $a3-031-09843-9 035 $a(MiAaPQ)EBC7026790 035 $a(Au-PeEL)EBL7026790 035 $a(CKB)24100779900041 035 $a(PPN)268782660 035 $a(EXLCZ)9924100779900041 100 $a20221230d2022 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aGraph transformation $e15th international conference, ICGT 2022, held as part of STAF 2022, Nantes, France, July 7-8, 2022, proceedings /$fNicolas Behr and Daniel Stru?ber (editors) 210 1$aCham, Switzerland :$cSpringer,$d[2022] 210 4$d©2022 215 $a1 online resource (216 pages) 225 1 $aLecture notes in computer science ;$vVolume 13349 311 08$aPrint version: Behr, Nicolas Graph Transformation Cham : Springer International Publishing AG,c2022 9783031098420 320 $aIncludes bibliographical references and index. 327 $aIntro -- Preface -- Organization -- Graph Theory in Coq: Axiomatizing Isomorphism of Treewidth-Two Graphs (Abstract of Invited Talk) -- Contents -- Theoretical Advances -- Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power -- 1 Introduction -- 2 Contextual Hyperedge Replacement -- 3 Acyclicity of CHR Grammars is Decidable -- 4 Acyclicity Restricts Generative Power -- 5 Conclusions -- References -- Graph Rewriting Components -- 1 Introduction -- 2 Example -- 3 Basic Notions -- 4 Transformation and Runtime Systems -- 5 Components -- 6 Architectural Models -- 7 Structural Operational Semantics -- 8 Conclusion and Related Work -- References -- Decidability of Resilience for Well-Structured Graph Transformation Systems -- 1 Introduction -- 2 Preliminaries -- 2.1 Graph Transformation Systems -- 2.2 Transition Systems and Well-structuredness -- 3 Decidability -- 4 Application to Graph Transformation Systems -- 5 Rule-Specific Criteria -- 6 Related Concepts -- 7 Conclusion -- References -- Probabilistic Metric Temporal Graph Logic -- 1 Introduction -- 2 Probabilistic Timed Automata -- 3 Probabilistic Timed Graph Transformation Systems -- 4 Probabilistic Metric Temporal Graph Logic -- 5 Bounded Model Checking Approach -- 6 Evaluation -- 7 Conclusion and Future Work -- References -- Categories of Differentiable Polynomial Circuits for Machine Learning -- 1 Introduction -- 2 Reverse Derivative Categories -- 3 Reverse Derivatives and Algebraic Presentations -- 4 Polynomial Circuits -- 5 Functional Completeness -- 6 Polynomial Circuits in Machine Learning: Case Studies -- 7 Conclusions and Future Work -- References -- Application Domains -- A Generic Construction for Crossovers of Graph-Like Structures -- 1 Introduction -- 2 Running Example -- 3 Preliminaries: M-Adhesive Categories. 327 $a4 A Pushout-Based Crossover Construction -- 5 Instantiating Existing Approaches to Graph-Based Crossover -- 6 Related Work -- 6.1 Further Approaches for Graph-Based Crossover -- 6.2 Crossover in MDO -- 7 Conclusion -- A Proofs -- References -- Towards Development with Multi-version Models: Detecting Merge Conflicts and Checking Well-Formedness -- 1 Introduction -- 2 Preliminaries -- 3 Single-Version Models -- 4 Multi-version Models as Typed Graphs -- 4.1 Directly Checking Well-Formedness for Multi-version Models -- 5 Directly Checking Merge Results for Multi-version Models -- 5.1 Directly Checking for Merge Conflicts -- 5.2 Directly Checking Well-Formedness for Merge Results -- 6 Evaluation -- 7 Related Work -- 8 Conclusion -- References -- Visual Smart Contracts for DAML -- 1 Introduction -- 2 Visual Models for Smart Contracts -- 3 Templates as Classes -- 4 Choices as Visual Contracts -- 5 Graph Transformation Semantics -- 6 Validation -- 7 Conclusion -- References -- Computational Category-Theoretic Rewriting -- 1 Introduction and Motivation -- 2 Important Categories in Computational Graph Transformation -- 2.1 Graphs and Their Homomorphisms -- 2.2 C-Sets and Their Homomorphisms -- 2.3 Relationships Between C-Sets and Typed Graphs -- 3 Category-Theoretic Rewriting -- 4 Design and Implementation of Generic Categorical Rewriting -- 5 Conclusions and Future Work -- References -- Invariant Analysis for Multi-agent Graph Transformation Systems Using k-Induction -- 1 Introduction -- 2 Labeled Transition Systems and k-Induction -- 3 Graph Transformation and Running Example -- 4 Symbolic States and Steps -- 5 Causality and Independence in GTS -- 6 Causality-Based k-Induction and Pruning Techniques -- 7 Conclusion and Future Work -- References -- Tool Presentation -- Tool Support for Functional Graph Rewriting with Persistent Data Structures - GrapeVine. 327 $a1 Introduction -- 2 Related Work -- 3 GrapeVine Concepts -- 3.1 Overview -- 3.2 A Fully-Persistent Data Structure for Functional Graph Rewriting -- 4 A Taste of Interacting with GrapeVine -- 5 Conclusions and Future Work -- References -- Author Index. 410 0$aLecture notes in computer science ;$vVolume 13349. 606 $aComputer science$vCongresses 606 $aGraph theory$xData processing$vCongresses 606 $aComputer science 615 0$aComputer science 615 0$aGraph theory$xData processing 615 0$aComputer science. 676 $a004 702 $aBehr$b Nicolas 702 $aStru?ber$b Daniel 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996478861703316 996 $aGraph Transformation$92896451 997 $aUNISA