![Studijní programy](https://cdn.muni.cz/media/3757910/studijni-programy-student-jde-chodbou-masarykova-univerzita.jpg?mode=crop¢er=0.5,0.5&rnd=133754493890000000&heightratio=0.5&width=278)
Zde se nacházíte:
Informace o publikaci
Undecidability of Weak Bisimilarity for Pushdown Processes
Autoři | |
---|---|
Rok publikování | 2002 |
Druh | Článek ve sborníku |
Konference | Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02) |
Fakulta / Pracoviště MU | |
Citace | |
Obor | Teorie informace |
Klíčová slova | weak bisimilarity; pushdown automata; infinite systems |
Popis | 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. |
Související projekty: |