Undecidability of bisimilarity by defender's forcing

TLDR: The decidability question for weak bisimilarity on PA (Process Algebra) processes is solved, showing that the problem is undecidable and even Σ11-complete, and several versions of the undecidability problems for prefix rewrite systems (or pushdown automata) as Π01-complete or Σ 11-complete.

Abstract: Stirling l1996, 1998r proved the decidability of bisimilarity on so-called normed pushdown processes. This result was substantially extended by Senizergues l1998, 2005r who showed the decidability of bisimilarity for regular (or equational) graphs of finite out-degree; this essentially coincides with weak bisimilarity of processes generated by (unnormed) pushdown automata where the e-transitions can only deterministically pop the stack. The question of decidability of bisimilarity for the more general class of so called Type -1 systems, which is equivalent to weak bisimilarity on unrestricted e-popping pushdown processes, was left open. This was repeatedly indicated by both Stirling and Senizergues. Here we answer the question negatively, that is, we show the undecidability of bisimilarity on Type -1 systems, even in the normed case.We achieve the result by applying a technique we call Defender's Forcing, referring to the bisimulation games. The idea is simple, yet powerful. We demonstrate its versatility by deriving further results in a uniform way. First, we classify several versions of the undecidable problems for prefix rewrite systems (or pushdown automata) as Π01-complete or Σ11-complete. Second, we solve the decidability question for weak bisimilarity on PA (Process Algebra) processes, showing that the problem is undecidable and even Σ11-complete. Third, we show Σ11-completeness of weak bisimilarity for so-called parallel pushdown (or multiset) automata, a subclass of (labeled, place/transition) Petri nets.