Name
Abstract | ||
|---|---|---|
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes by showing that the equivalence remains undecidable for weakly extended versions of BPA and BPP. In fact, we show that the weak bisimulation equivalence problem is undecidable even for normed subclasses of BPA and BPP extended with a finite constraint system. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.entcs.2005.11.014 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
process algebra,decidability | Discrete mathematics,Combinatorics,Multiset,Automaton,Decidability,Equivalence (measure theory),Mathematics,Bisimulation equivalence,Undecidable problem | Journal |
Volume | Issue | ISSN |
149 | 1 | 1571-0661 |
Citations | PageRank | References |
1 | 0.34 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mojmír Křetínský | 1 | 56 | 3.62 |
| Vojtěch Řehák | 2 | 68 | 5.99 |
| Jan Strejcek | 3 | 99 | 13.83 |