2-Nested-Simulation Preorder

• 2-nested-simulation preorder is a behavioral relation that refines ordinary simulation by enforcing both a forward simulation condition and a reverse constraint at a lower nesting level.
• It is modally characterized by the fragment L₂S of Hennessy–Milner logic, marking the first level where restricted negation is introduced.
• The complexity profile features NP-completeness for satisfiability and coNP-completeness for formula primeness, supported by a small-model property and efficient tableau-based algorithms.

The 2-nested-simulation preorder is the second level of the nested-simulation hierarchy introduced by Groote and Vaandrager. It refines ordinary simulation by combining a forward simulation clause with a reverse constraint one nesting level lower, and it is characterized modally by the fragment $\mathcal{L}_{2S}$ of Hennessy–Milner logic. In the cited 2025 analyses, the preorder is studied chiefly through the decision problem of whether a formula is characteristic for some process, a question that is equivalent to satisfiability together with primeness in $\mathcal{L}_{2S}$. The resulting complexity profile makes the $2S$ case a boundary point: harder than plain simulation, but strictly easier than the $n\ge 3$ nested-simulation levels (Aceto et al., 17 Sep 2025).

1. Definition and position in the hierarchy

For finite, loop-free labelled transition systems, ordinary simulation is defined by

$$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$

The $n$-nested simulation preorder is defined inductively by setting $\preceq_{1S}=\preceq_S$, and for $n>1$,

$$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$

Specializing to $n=2$,

$\mathcal{L}_{2S}$0

Thus $\mathcal{L}_{2S}$1-nested simulation strengthens ordinary simulation by requiring not only the usual forward matching condition, but also a reverse simulation condition at one lower nesting level (Aceto et al., 28 May 2025).

Each $\mathcal{L}_{2S}$2 is a preorder, and its kernel is the induced equivalence

$\mathcal{L}_{2S}$3

For $\mathcal{L}_{2S}$4, this yields $\mathcal{L}_{2S}$5. The hierarchy is strict: $\mathcal{L}_{2S}$6 Accordingly, $\mathcal{L}_{2S}$7-nested simulation is strictly finer than simulation, but coarser than $\mathcal{L}_{2S}$8-nested simulation and bisimilarity. This places it at the first level where nesting changes the semantics in a substantial way.

2. Modal characterization by $\mathcal{L}_{2S}$9

The modal language characterizing $2S$0-nested simulation extends the positive simulation fragment by a restricted form of negation. For simulation,

$2S$1

whereas for $2S$2,

$2S$3

Hence

$2S$4

This is the first level at which negation appears, but it is confined to $2S$5-formulae (Aceto et al., 28 May 2025).

Truth is given by the usual Hennessy–Milner semantics; in particular,

$2S$6

and negation is interpreted classically: $2S$7

The fundamental modal characterization is

$2S$8

and therefore, in particular,

$2S$9

This identifies $n\ge 3$0-nested simulation with logical inclusion over $n\ge 3$1. A formula $n\ge 3$2 is characteristic for a process $n\ge 3$3 within $n\ge 3$4 precisely when

$n\ge 3$5

equivalently,

$n\ge 3$6

Such a formula defines exactly the upward cone of $n\ge 3$7 under $n\ge 3$8.

3. Characteristic formulae, primeness, and kernel semantics

A formula $n\ge 3$9 is satisfiable if there is a process that satisfies it. Primeness is defined relative to a logic $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$0 by

$$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$1

for all $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$2. Every unsatisfiable formula is trivially prime. In the $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$3 setting, $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$4 is prime exactly when this implication holds for all $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$5 (Aceto et al., 17 Sep 2025).

The central equivalence is: $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$6 Thus, for $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$7,

$$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$8

This equivalence explains why satisfiability and primeness are the decisive computational subproblems.

The preorder and its kernel lead to two different notions of characteristic formula. Within $$p \preceq_S q \iff \forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ such that } p' \preceq_S q'.$$9, a characteristic formula identifies an upward closure under $n$0. Modulo the kernel $n$1, a formula is characteristic for $n$2 when

$n$3

equivalently,

$n$4

So kernel-level characterization isolates exactly one $n$5-equivalence class rather than an upward cone.

The cited examples of primeness are given in $n$6: $n$7 is prime, whereas $n$8 is not. These examples illustrate the same logical notion used at the $n$9 level.

4. Complexity profile of the $\preceq_{1S}=\preceq_S$0 case

The 2025 results establish a sharp split between the $\preceq_{1S}=\preceq_S$1-nested case and the levels $\preceq_{1S}=\preceq_S$2. For $\preceq_{1S}=\preceq_S$3, satisfiability is NP-complete and the Formula Primality problem is coNP-complete. For $\preceq_{1S}=\preceq_S$4, satisfiability, primeness, and deciding characteristic formulae are PSPACE-complete (Aceto et al., 28 May 2025).

Problem	$\preceq_{1S}=\preceq_S$5 result	Higher-level comparison
Satisfiability in $\preceq_{1S}=\preceq_S$6	NP-complete	PSPACE-complete for $\preceq_{1S}=\preceq_S$7
Formula Primality in $\preceq_{1S}=\preceq_S$8	coNP-complete	PSPACE-complete for $\preceq_{1S}=\preceq_S$9
Characteristic formula decision	In DP when $n>1$0	PSPACE-complete for $n>1$1

The class

$n>1$2

is used exactly as follows. Since characteristic-within-$n>1$3 is equivalent to satisfiable $n>1$4 prime, and satisfiability is in NP while primeness is in coNP, deciding whether a formula is characteristic for a process within $n>1$5 is in DP. For characteristic modulo $n>1$6, the decomposition is satisfiability together with the condition that every two processes satisfying the formula are $n>1$7-equivalent; the first component is in NP and the second in coNP, so this problem is also in DP. The exact stated result is: let $n>1$8. Deciding whether a formula in $n>1$9 is characteristic for a process within $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$0, or modulo $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$1, is in DP.

The lower bounds are weaker than DP-completeness. When $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$2, deciding whether $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$3 is characteristic within $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$4 is US-hard, and deciding whether $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$5 is characteristic modulo $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$6 is coNP-hard. A recurrent misconception is therefore avoided in the cited work: the result for characteristic-formula decision at $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$7 is DP membership, not DP-completeness.

The reason the $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$8 case is easier than $$p \preceq_{nS} q \iff \Big(\forall\, p \xrightarrow{a} p'\;\exists\, q \xrightarrow{a} q' \text{ with } p' \preceq_{nS} q'\Big)\;\wedge\; q \preceq_{(n-1)S} p.$$9 is explicit: for a satisfiable formula $n=2$0, there is always a tableau for $n=2$1—and so a corresponding process satisfying $n=2$2—of polynomial size. This small-model property supports NP for satisfiability and coNP for primeness, whereas the higher nested levels require PSPACE game machinery.

5. Polynomial witness machinery: tableau construction, maximal lower bounds, and primality

The distinctive algorithmic contribution for $n=2$3 is a direct coNP procedure built from three components: a nondeterministic process constructor $n=2$4, a polynomial-time maximal-lower-bound procedure $n=2$5, and the primality checker $n=2$6 (Aceto et al., 17 Sep 2025).

$n=2$7 is a nondeterministic extension of a tableau construction for $n=2$8. If $n=2$9 is satisfiable, some execution outputs a process satisfying $\mathcal{L}_{2S}$00; if $\mathcal{L}_{2S}$01 is unsatisfiable, executions stop without output. The cited presentation emphasizes that lines $\mathcal{L}_{2S}$02–$\mathcal{L}_{2S}$03 implement the tableau construction, while lines $\mathcal{L}_{2S}$04–$\mathcal{L}_{2S}$05 add bounded “box-generated” witness structure exposing failures of simulation when needed. Two size bounds are crucial: if $\mathcal{L}_{2S}$06 outputs a process $\mathcal{L}_{2S}$07, then $\mathcal{L}_{2S}$08 and its depth is at most $\mathcal{L}_{2S}$09; moreover, the output size is at most

$\mathcal{L}_{2S}$10

This polynomial bound is the small-model property exploited throughout.

The maximal lower bound with respect to $\mathcal{L}_{2S}$11, written $\mathcal{L}_{2S}$12 or $\mathcal{L}_{2S}$13, is the second decisive ingredient. Its special structural property is: $\mathcal{L}_{2S}$14 Moreover, one can decide in polynomial time whether $\mathcal{L}_{2S}$15 exists; if it exists, it can be computed in polynomial time and has size at most

$\mathcal{L}_{2S}$16

The constructive definition used in the proof is

$\mathcal{L}_{2S}$17

This recursively builds the common lower bound from simulation-equivalent successors.

The key semantic equivalence is that for $\mathcal{L}_{2S}$18 and $\mathcal{L}_{2S}$19, the following are equivalent: $\mathcal{L}_{2S}$20 and

$\mathcal{L}_{2S}$21

This allows primality to be checked by examining only the maximal lower bound.

The algorithm $\mathcal{L}_{2S}$22 operates by running $\mathcal{L}_{2S}$23 twice to obtain $\mathcal{L}_{2S}$24. If either construction fails to output, the branch accepts, corresponding to unsatisfiability and hence trivial primeness. Otherwise it computes

$\mathcal{L}_{2S}$25

If $\mathcal{L}_{2S}$26 does not exist, the branch rejects; if $\mathcal{L}_{2S}$27, it accepts; otherwise it rejects. The correctness criterion is universal: $\mathcal{L}_{2S}$28 Because each execution is polynomial-time, universal acceptance yields a coNP algorithm, giving coNP-completeness for Formula Primality in $\mathcal{L}_{2S}$29.

For the kernel-style problem, the cited work also describes $\mathcal{L}_{2S}$30, which checks whether every two processes satisfying $\mathcal{L}_{2S}$31 are $\mathcal{L}_{2S}$32-equivalent. This condition is in coNP, and checking $\mathcal{L}_{2S}$33 for given processes can be done in polynomial time.

6. Relation to ordinary simulation algorithms and scope of extrapolation

A separate line of work studies efficient algorithms for ordinary simulation preorder rather than nested simulation. In particular, a 2017 paper develops a framework for computing the coarsest simulation preorder included in an initial preorder, using maximal transitions, $\mathcal{L}_{2S}$34-stability, and partition-relation refinement. Its main complexity theorem gives time

$\mathcal{L}_{2S}$35

and bit-space

$\mathcal{L}_{2S}$36

The paper is explicit that it does not define or compute nested simulation, including $\mathcal{L}_{2S}$37-nested simulation (Cécé, 2017).

What this establishes directly is a strong algorithmic base for ordinary simulation inside an arbitrary initial preorder. A plausible implication is that such a procedure can serve as a primitive in staged constructions of $\mathcal{L}_{2S}$38-nested simulation, because the 2017 framework is parameterized by the initial preorder and organized as a decreasing sequence of stable preorders. The cited note states this relevance carefully: the paper does not explicitly mention nested simulation, does not prove that repeated use computes $\mathcal{L}_{2S}$39-nested simulation, and does not provide complexity analyses for nested or $\mathcal{L}_{2S}$40-nested simulation. Its significance for $\mathcal{L}_{2S}$41 is therefore foundational rather than definitive.

Taken together, the cited sources present the 2-nested-simulation preorder as the second level of a strict behavioral hierarchy, logically characterized by $\mathcal{L}_{2S}$42, semantically tied to upward closures and kernel classes under $\mathcal{L}_{2S}$43, and computationally distinguished by a small-model property and a polynomial-time maximal-lower-bound construction. Those features make $\mathcal{L}_{2S}$44 the threshold level at which nested simulation becomes substantially richer than ordinary simulation while still remaining below the PSPACE behavior of the higher nested levels (Aceto et al., 28 May 2025).