Introducing symmetry to graph rewriting systems with process abstraction

DOI10.1007/978-3-030-23611-3_1MaRDI QIDQ2292965zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

abstractiongraph rewriting systemsLMNtalmodel checkingsymmetry reduction

Mathematics Subject Classification ID

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

Recommendations

• A calculus of concurrent graph-rewriting processes
• Sharing implementations of graph rewriting systems
• Graph Transformations
• Symbolic reachability graph and partial symmetries
• A logic for analyzing abstractions of graph transformation systems
• Theoretical Computer Science
• Graph rewrite systems for software design transformations
• Graph transformation systems: a semantics based on (stochastic) symmetric nets
• Concurrent Rewriting for Graphs with Equivalences
• Pattern graph rewrite systems

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)