A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

Cites Work

Title not available (Why is that?)
Algebra of communicating processes with abstraction
Decidability of bisimulation equivalence for process generating context-free languages
Unique decomposition of processes
Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
A short proof of the decidability of bisimulation for normed BPA- processes

Cited In (30)

Complexity of Weak Bisimilarity and Regularity for BPA and BPP
Partially-commutative context-free processes: expressibility and tractability
Bisimulation and coinduction enhancements: a historical perspective
On the computational complexity of bisimulation, redux
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Pushdown automata, multiset automata, and Petri nets
A complexity analysis of bisimilarity for value-passing processes
Non-interleaving bisimulation equivalences on basic parallel processes
Normed processes, unique decomposition, and complexity of bisimulation equivalences
More on Weak Bisimilarity of Normed Basic Parallel Processes
Undecidable problems in unreliable computations.
Title not available (Why is that?)
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
An efficient algorithm for computing bisimulation equivalence
Deciding Bisimilarity of Full BPA Processes Locally
Title not available (Why is that?)
Partially-Commutative Context-Free Processes
Complexity of deciding bisimilarity between normed BPA and normed BPP
Normed BPA vs. Normed BPP Revisited
Causality, behavioural equivalences, and the security of cyberphysical systems
Petri nets, commutative context-free grammars, and basic parallel processes
Title not available (Why is that?)
Decidability of branching bisimulation on normed commutative context-free processes
High undecidability of weak bisimilarity for Petri nets
A general approach to comparing infinite-state systems with their finite-state specifications
Decidability of branching bisimulation on normed commutative context-free processes
Bisimilarity on basic parallel processes
Effective decomposability of sequential behaviours
Deciding bisimulation and trace equivalences for systems with many identical processes

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)