scientific article; zbMATH DE number 1232246
From MaRDI portal
Publication:4223072
Recommendations
- Decidability of weak bisimilarity for a subset of basic parallel processes
- On the complexity of bisimulation problems for basic parallel processes
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- Non-interleaving bisimulation equivalences on basic parallel processes
- Approximating weak bisimilarity of basic parallel processes
- Strong bisimilarity of simple process algebras: Complexity lower bounds
- Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard
- A short proof of the decidability of bisimulation for normed BPA- processes
- On the parallel complexity of bisimulation on finite systems
- Decidability of bisimulation equivalence for normed pushdown processes
Cited in
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223072)