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

• 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
• Field: Computer hardware and software
• Keywords: verification; concurrency; weak bisimilarity; infinite-state systems

Related projects

• (Un)decidable Problems in Process Algebras
• Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing