Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time

• Authors: KUČERA Antonín; RICHARD Mayr
• Year of publication: 1998
• Type: Article in Periodical
• Magazine / Source: Technical Report TUM
• MU Faculty or unit: Faculty of Informatics
• Field: Computer hardware and software
• Keywords: process algebras; bisimilarity; finite-state systems

Related projects

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