首页 | 本学科首页   官方微博 | 高级检索  
     


Refining the Undecidability Border of Weak Bisimilarity
Authors:Mojmír K&#x;etínský  Vojt ch &#x;ehk  Jan Strej ek
Affiliation:Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic
Abstract:Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (MSA, also known as parallel pushdown processes, PPDA). Its decidability is an open question for basic process algebras (BPA) and basic parallel processes (BPP). We move the undecidability border towards these classes by showing that the equivalence remains undecidable for weakly extended versions of BPA and BPP. In fact, we show that the weak bisimulation equivalence problem is undecidable even for normed subclasses of BPA and BPP extended with a finite constraint system.
Keywords:weak bisimulation  infinite-state systems  decidability
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号