Introducing symmetry to graph rewriting systems with process abstraction

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

Kazunori Ueda, Yutaro Tsunekawa, Taichi Tomioka

Publication date: 6 February 2020

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

zbMATH Keywords

model checkingabstractionsymmetry reductiongraph rewriting systemsLMNtal

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Graph transformation systems: a semantics based on (stochastic) symmetric nets 👍 👎
• A calculus of concurrent graph-rewriting processes 👍 👎
• Sharing implementations of graph rewriting systems 👍 👎
• Pattern graph rewrite systems 👍 👎
• Symbolic reachability graph and partial symmetries 👍 👎
• Graph Transformations 👍 👎
• Theoretical Computer Science 👍 👎
• Concurrent Rewriting for Graphs with Equivalences 👍 👎

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)