Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time

Investor logo

Warning

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

KUČERA Antonín MAYR Richard

Year of publication 1999
Type Article in Proceedings
Conference Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99)
MU Faculty or unit

Faculty of Informatics

Citation
Field Computer hardware and software
Keywords verification; concurrency; weak bisimilarity; infinite-state systems
Related projects:

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