Refining the process rewrite systems hierarchy via ground tree rewrite systems
From MaRDI portal
(Redirected from Refining the process rewrite systems hierarchy via ground tree rewrite systems)
Refining the process rewrite systems hierarchy via ground tree rewrite systems (scientific article; zbMATH DE number 6483231)
Refining the process rewrite systems hierarchy via ground tree rewrite systems (scientific article; zbMATH DE number 6483231)
Recommendations
Cites work
- Algebra of communicating processes with abstraction
- Algorithmic metatheorems for decidable LTL model checking over infinite systems
- Branching time and abstraction in bisimulation semantics
- CONCUR 2005 – Concurrency Theory
- Decidability of model checking with the temporal logic EF
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1222559 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- Process rewrite systems.
- Refining the process rewrite systems hierarchy via ground tree rewrite systems
- Term Rewriting and All That
- The equality problem for vector addition systems is undecidable
- The regular viewpoint on PA-processes
- The theory of ends, pushdown automata, and second-order logic
- Tree generating regular systems
- Verification on infinite structures.
- Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)
Cited in
(2)
This page was built for publication: Refining the process rewrite systems hierarchy via ground tree rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892174)