8 search results - page 2 / 2 » Normed BPA vs. Normed BPP Revisited |
ENTCS
2000
15 years 15 days ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
101
Voted
ENTCS
2006
15 years 21 days ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
77
Voted
ICALP
1999
Springer
15 years 5 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...