Constrained Reachability of Process Rewrite Systems
From MaRDI portal
Recommendations
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On computing reachability sets of process rewrite systems
- Reachability analysis of synchronized PA systems
- Process rewrite systems.
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
Cited in
(6)- Reachability analysis of synchronized PA systems
- Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)
- Constraint-based reachability
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On computing reachability sets of process rewrite systems
This page was built for publication: Constrained Reachability of Process Rewrite Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393418)