On the computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Decomposition and complexity of hereditary history preserving bisimulation on BPP
CONCUR 2005 - Concurrency Theory
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Decidability of performance equivalence for basic parallel processes
Theoretical Computer Science
Normed BPA vs. Normed BPP Revisited
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
Partially-Commutative Context-Free Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
Electronic Notes in Theoretical Computer Science (ENTCS)
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of bisimulation, redux
Information and Computation
More on weak bisimilarity of normed basic parallel processes
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Complexity of deciding bisimilarity between normed BPA and normed BPP
Information and Computation
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Partially-commutative context-free processes: Expressibility and tractability
Information and Computation
Decidability of branching bisimulation on normed commutative context-free processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Weak bisimulation approximants
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
BPA bisimilarity is EXPTIME-hard
Information Processing Letters
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |
The paper shows an algorithmwhich, given a Basic ParallelProcesses (BPP) system, constructs a set of linear mappingswhich characterize the (strong) bisimulation equivalence onthe system. Though the number of the constructed mappingscan be exponential, they can be generated in polynomialspace; this shows that the problem of deciding bisimulationequivalence on BPP is in PSPACE. Combining with thePSPACE-hardness result by Srba, PSPACE-completeness isthus established.