Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

DOI10.1145/2629679zbMath1354.68139OpenAlexW2065713030MaRDI QIDQ5892174

Stefan Göller, Anthony Widjaja Lin

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2629679

zbMATH Keywords

treesrewrite systemshierarchyground terms

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebra of communicating processes with abstraction
• The theory of ends, pushdown automata, and second-order logic
• The equality problem for vector addition systems is undecidable
• Process rewrite systems.
• Weakly-Synchronized Ground Tree Rewriting
• Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
• Branching time and abstraction in bisimulation semantics
• Term Rewriting and All That
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Tree generating regular systems
• Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
• CONCUR 2005 – Concurrency Theory
• Decidability of model checking with the temporal logic EF
• The regular viewpoint on PA-processes