A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
From MaRDI portal
Publication:4715674
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- A short proof of the decidability of bisimulation for normed BPA- processes
- Algebra of communicating processes with abstraction
- Decidability of bisimulation equivalence for process generating context-free languages
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
- Unique decomposition of processes
Cited in
(30)- Petri nets, commutative context-free grammars, and basic parallel processes
- Decidability of branching bisimulation on normed commutative context-free processes
- A complexity analysis of bisimilarity for value-passing processes
- Deciding Bisimilarity of Full BPA Processes Locally
- Bisimilarity on basic parallel processes
- Effective decomposability of sequential behaviours
- scientific article; zbMATH DE number 1231554 (Why is no real title available?)
- scientific article; zbMATH DE number 1232246 (Why is no real title available?)
- Complexity of Weak Bisimilarity and Regularity for BPA and BPP
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- Decidability of branching bisimulation on normed commutative context-free processes
- More on Weak Bisimilarity of Normed Basic Parallel Processes
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Normed processes, unique decomposition, and complexity of bisimulation equivalences
- Bisimulation and coinduction enhancements: a historical perspective
- scientific article; zbMATH DE number 2086414 (Why is no real title available?)
- High undecidability of weak bisimilarity for Petri nets
- Non-interleaving bisimulation equivalences on basic parallel processes
- Normed BPA vs. Normed BPP Revisited
- On the computational complexity of bisimulation, redux
- A general approach to comparing infinite-state systems with their finite-state specifications
- Causality, behavioural equivalences, and the security of cyberphysical systems
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Undecidable problems in unreliable computations.
- Partially-commutative context-free processes: expressibility and tractability
- An efficient algorithm for computing bisimulation equivalence
- Complexity of deciding bisimilarity between normed BPA and normed BPP
- Partially-Commutative Context-Free Processes
- Pushdown automata, multiset automata, and Petri nets
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
This page was built for publication: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715674)
