Highly Undecidable Questions for Process Algebras

Petr Jancar, Jirí Srba
2004 BRICS Report Series  
We show Sigma^1_1-completeness of weak bisimilarity for PA (process algebra), and of weak simulation preorder/equivalence for PDA (pushdown automata), PA and PN (Petri nets). We also show Pi^1_1-hardness of weak omega-trace equivalence for the (sub)classes BPA (basic process algebra) and BPP (basic parallel processes).
doi:10.7146/brics.v11i8.21833 fatcat:etmvtxf2gzbbtbcjddqxqa27um