2 search results - page 1 / 1 » Highly Undecidable Questions for Process Algebras |
IFIP
2004
Springer
13 years 11 months ago
2004
Springer
ENTCS
2006
13 years 6 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...