Introducing symmetry to graph rewriting systems with process abstraction

DOI10.1007/978-3-030-23611-3_1zbMATH Open1429.68093OpenAlexW2956049905MaRDI QIDQ2292965FDOQ2292965

Authors: Taichi Tomioka, Yutaro Tsunekawa, Kazunori Ueda 

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23611-3_1

Recommendations

• A calculus of concurrent graph-rewriting processes
• Sharing implementations of graph rewriting systems
• Graph Transformations
• Symbolic reachability graph and partial symmetries
• scientific article; zbMATH DE number 2090850
• Theoretical Computer Science
• scientific article; zbMATH DE number 1951115
• Graph transformation systems: a semantics based on (stochastic) symmetric nets
• Concurrent Rewriting for Graphs with Equivalences
• Pattern graph rewrite systems

zbMATH Keywords

model checkingsymmetry reductionabstractiongraph rewriting systemsLMNtal

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

This page was built for publication: Introducing symmetry to graph rewriting systems with process abstraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292965)