[Paper Review] Bisimilarity of Pushdown Systems is Nonelementary

Michael Benedikt, Stefan Göller+2 more|arXiv (Cornell University)|Oct 29, 2012

Formal Methods in Verification9 references3 citations

TL;DR

This paper establishes that bisimilarity checking for pushdown systems is nonelementary, meaning its computational complexity exceeds any fixed tower of exponentials. The authors construct a reduction using a bisimulation game with encoded counters and non-erasing transducers to simulate nonelementary-size values, proving the problem is strictly harder than EXPTIME and resolving a long-standing complexity gap.

ABSTRACT

Given two pushdown systems, the bisimilarity problem asks whether they are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIME-hardness, which was the previously best known lower bound for this problem. Our lower bound result holds for normed pushdown systems as well.

Motivation & Objective

• To close the complexity gap for bisimilarity of pushdown systems, which was previously only known to be EXPTIME-hard.
• To show that the problem is nonelementary, even in the normed case, by constructing a family of pushdown systems with nonelementarily large bisimulation games.
• To develop a technique using Defender’s Forcing and non-erasing real-time transducers to simulate large counters within the bisimulation game.
• To provide a foundation for extending lower bounds to related problems such as regularity of pushdown systems and weak bisimilarity in basic process algebras.

Proposed method

• The authors design a family of pushdown systems where configurations encode nonelementarily large counters using a recursive encoding inspired by Stockmeyer’s tower functions.
• They introduce auxiliary states and transition rules to simulate the behavior of non-erasing real-time transducers that process stack content to verify transitions deterministically.
• The construction uses Defender’s Forcing to ensure that in the bisimulation game, the Defender must respond correctly to all attacker moves, preserving the invariant of counter equivalence.
• Transitions are extended with new symbols (e.g., zOnesℓ, decℓ⁰) to simulate decrement and zero operations on encoded counters while maintaining stack structure.
• The encoding ensures that any valid bisimulation must preserve the value of counters up to tower functions, forcing the game to last for nonelementary many rounds.
• The final construction links the initial state to a configuration that simulates a full tower-of-exponentials counter, proving the problem cannot be solved in elementary time.

Experimental results

Research questions

• RQ1 Is the bisimilarity problem for pushdown systems nonelementary, or does it admit an elementary upper bound?
• RQ2 Can a bisimulation game be used to simulate nonelementary-size counters through stack-based encoding and transducer simulation?
• RQ3 Does the nonelementary lower bound hold even for normed pushdown systems, where all states can reach a terminal configuration?
• RQ4 Can the technique of Defender’s Forcing be extended to simulate deterministic verification phases in infinite-state systems with complex control flow?
• RQ5 Can this approach be adapted to prove lower bounds for related problems such as regularity of pushdown systems or weak bisimilarity in basic process algebras?

Key findings

• The bisimilarity problem for pushdown systems is nonelementary, meaning it cannot be solved in time bounded by any fixed tower of exponentials.
• The lower bound holds even for normed pushdown systems, where all reachable configurations can reach a terminal state.
• The proof constructs a family of pushdown systems where the bisimulation game requires a nonelementary number of rounds to resolve.
• The key technique involves encoding counters using a recursive stack-based representation that simulates values of the form Tower(ℓ, n) − 2, where Tower is the Ackermann function.
• The use of non-erasing real-time transducers allows deterministic verification of transitions, preserving the invariants needed for the game to simulate large counter values.
• The result implies that no elementary-time algorithm can decide bisimilarity of pushdown systems, closing a long-standing complexity gap.