Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

DOI10.1007/978-3-642-23217-6_36zbMath1344.68164MaRDI QIDQ5894255

Stefan Göller, Anthony Widjaja Lin

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_36

Mathematics Subject Classification ID

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q42: Grammars and rewriting systems

Related Items

Decidable models of integer-manipulating programs with recursive parallelism, Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On decidability of LTL model checking for process rewrite systems
• Algebra of communicating processes with abstraction
• The theory of ends, pushdown automata, and second-order logic
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Process rewrite systems.
• 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
• CONCUR 2005 – Concurrency Theory
• Decidability of model checking with the temporal logic EF
• The regular viewpoint on PA-processes