Refining Undecidability Border of Weak Bisimilarity.
| Authors | |
|---|---|
| Year of publication | 2005 |
| Type | Article in Periodical |
| Magazine / Source | BRICS Notes Series |
| MU Faculty or unit | |
| Citation | |
| Web | http://www.brics.dk/NS/05/4/ |
| Field | Informatics |
| Keywords | process rewrite systems; state extension; infinite-state; (un)decidability; weak bisimulation |
| Description | 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 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. |
| Related projects: |