Undecidability of Weak Bisimilarity for Pushdown Processes

Investor logo

Warning

This publication doesn't include Faculty of Sports Studies. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

SRBA Jiří

Year of publication 2002
Type Article in Proceedings
Conference Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02)
MU Faculty or unit

Faculty of Informatics

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:

You are running an old browser version. We recommend updating your browser to its latest version.

More info