scientific article; zbMATH DE number 1231554
From MaRDI portal
Publication:4222869
Recommendations
- A short proof of the decidability of bisimulation for normed BPA- processes
- A note on the complexity of deciding bisimilarity of normed unary processes
- Complexity of deciding bisimilarity between normed BPA and normed BPP
- Branching bisimilarity of normed BPA processes is in NExpTime
- Decidability of bisimulation equivalence for normed pushdown processes
- Normed processes, unique decomposition, and complexity of bisimulation equivalences
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
- Branching bisimilarity of normed BPA processes as a rational monoid
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
Cited in
(15)- A short proof of the decidability of bisimulation for normed BPA- processes
- Comparing expressibility of normed BPA and normed BPP processes
- Undecidable equivalences for basic process algebra
- Effective decomposability of sequential behaviours
- Complexity of deciding bisimilarity between normed BPA and normed BPP
- Regularity of normed PA processes
- Deciding Bisimilarity of Full BPA Processes Locally
- Normed BPA vs. Normed BPP Revisited
- Branching bisimilarity of normed BPA processes as a rational monoid
- Normed processes, unique decomposition, and complexity of bisimulation equivalences
- Checking equality and regularity for normed BPA with silent moves
- Deciding bisimilarity between BPA and BPP processes.
- Basic process algebra with deadlocking states
- Regularity is decidable for normed BPA and normed BPP processes in polynomial time
- Regularity is decidable for normed PA processes in polynomial time
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 Q4222869)
