Undecidability of Weak Bisimilarity for Pushdown Processes
| Authors | |
|---|---|
| Year of publication | 2002 |
| Type | Article in Proceedings |
| Conference | Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02) |
| MU Faculty or unit | |
| Citation | |
| Field | Information theory |
| Keywords | weak bisimilarity; pushdown automata; infinite systems |
| Description | We prove undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar. We also show that this undecidability result extends to a subclass of pushdown processes satisfying the normedness condition. |
| Related projects: |