---
title: Small-Signal Security Region (SSSR)
url: https://www.emergentmind.com/topics/small-signal-security-region-sssr
type: topic
---

# Small-Signal Security Region (SSSR)

Small-Signal Security Region (SSSR) denotes the set of operating points, parameters, or injection vectors for which a power-system equilibrium exists and the associated small-signal model is asymptotically stable. In the cited literature, the concept is defined on parameter space or power injection space rather than only at a single operating point, and it is characterized by the left-half-plane location of the eigenvalues of the reduced Jacobian together with regularity of the algebraic subsystem. In this sense, “security” is the operational interpretation of the underlying stability region rather than a sharply distinct mathematical object [1511.06399]. Subsequent work broadens the concept toward robust inner approximations in DAE state space, projection-based admissible regions under uncertain wind injections, empirical boundary-sampling procedures, and data-driven or online surrogates for secure-region membership [1811.03805].

## 1. Classical formulation in differential-algebraic models

A standard starting point is the parameterized power-system DAE
\[
\begin{cases}
\dot{x} = F(x,y,p) \\
0 = G(x,y,p),
\end{cases}
\]
where \(x\in\mathbb{R}^n\) are state variables, \(y\in\mathbb{R}^m\) are algebraic variables, and \(p\in\mathbb{R}^l\) is a parameter vector [1511.06399]. Linearization at an equilibrium gives
\[
\begin{bmatrix}
\Delta \dot{x} \\
0
\end{bmatrix}
=
\begin{bmatrix}
A & B \\
C & D
\end{bmatrix}
\begin{bmatrix}
\Delta x \\
\Delta y
\end{bmatrix},
\]
and, when \(D\) is nonsingular, reduction to state space yields
\[
\Delta \dot{x} = \tilde A\,\Delta x,\qquad \tilde A = A - B D^{-1} C.
\]
The eigenvalues \(\lambda_i\) of \(\tilde A\) provide the classical small-signal criterion: the equilibrium is small-signal stable when \(\Re(\lambda_i) < 0\) for all modes [1511.06399].

On this basis, the SSSR is defined as
\[
\Omega_{\text{SSSR}} := \left\{ p\ \middle|\ \max_i \{\Re(\lambda_i)\} < 0,\; D \text{ is nonsingular} \right\}.
\]
Its boundary is
\[
\partial \Omega_{\text{SSSR}} := \left\{ p\ \middle|\ \max_i \{\Re(\lambda_i)\} = 0 \right\}
\cup
\left\{ p\ \middle|\ D \text{ is singular} \right\}.
\]
The cited formulation associates \(\max_i \Re(\lambda_i)=0\) with Hopf bifurcation or saddle-node bifurcation, and \(D\) singularity with singularity induced bifurcation [1511.06399].

This definition makes SSSR a region-wise generalization of pointwise eigen-analysis. Instead of asking whether one operating point is stable, it asks which parameter vectors or injection patterns produce equilibria that remain small-signal stable. In the conventional generation-injection setting, the parameter vector may be taken as
\[
p_s = [p_{s1},p_{s2},\dots,p_{s n_s}]^T,
\]
with active-power balance
\[
p_{s1}+p_{s2}+\cdots+p_{s n_s}=L,
\]
so that the SSSR becomes a region in synchronous-generator injection space [1511.06399].

## 2. Geometric interpretations and region variants

The classical SSSR is a subset of parameter or injection space, but the literature develops several related geometric views. In the wind-integration setting, the SSSR is extended from conventional synchronous-generator injections \(p_s\) to an augmented injection vector
\[
p_e = [p_{s1},\dots,p_{s n_s},p_{w1},\dots,p_{w n_w}]^T,
\]
which includes both synchronous-generation injections and wind power injections (WPIs). Under AGC participation factors \(\gamma\), the paper defines an extended \(\gamma\)-SSSR in this higher-dimensional injection space and then projects it onto WPI space to obtain the admissible region of wind generation considering small-signal stability (SSAR):
\[
\Omega_{\text{SSAR}_{p_w}^{\gamma}} = \operatorname{proj}_{p_w}\!\left(\Omega_{\text{SSSR}_{p_e}^{\gamma}}\right).
\]
Geometrically, the extended SSSR is the stable set in joint SG+wind injection coordinates, while SSAR is its projection onto wind-injection coordinates [1511.06399].

This projection view is significant because uncertain WPIs do not merely perturb one equilibrium; they relocate equilibria, alter \(A,B,C,D\), and therefore change \(\tilde A\) and its eigenvalues. The cited wind paper treats this effect primarily through equilibrium relocation while neglecting WTG dynamics in the main development, assumes algebraic balancing through AGC participation factors, and uses the projected region to quantify how much uncertain wind generation can be accommodated without breaking small-signal stability [1511.06399]. It also assumes exciter parameters are in proper ranges so that no holes exist in the relevant extended SSSR.

A distinct geometric variant appears in DAE-based robust certification. There, the constructed object is not the exact SSSR in the classical necessary-and-sufficient sense, but a robustly stable inner subset in the state-algebraic variable space \(z=(x,y)\). The intended interpretation is a region of feasible equilibria or operating points embedded in the DAE state-algebraic space, not an arbitrary transient-state invariant set. This shifts the region concept from parameter space toward state space while remaining tied to equilibrium feasibility and small-signal stability [1811.03805].

## 3. Exact spectral tests and conservative robust certificates

For semi-explicit DAEs
\[
\begin{aligned}
\dot{\mathbf{x}} &= f(\mathbf{x},\mathbf{y}) \\
0 &= g(\mathbf{x},\mathbf{y}),
\end{aligned}
\]
the reduced Jacobian is
\[
J_r = A - B D^{-1} C,
\]
and the exact benchmark remains
\[
\text{small-signal stability} \iff \operatorname{Re}\big(\lambda(J_r)\big)<0.
\]
The DAE-based robust framework constructs a bridge between the reduced model and the original DAE Jacobian
\[
J(\mathbf{x},\mathbf{y})=
\begin{bmatrix}
A & B \\
C & D
\end{bmatrix}
\]
through generalized reduced and unreduced Jacobians
\[
F_r = P J_r,\qquad
F = Z^T J,\qquad
Z=
\begin{bmatrix}
P & 0 \\
R & Q
\end{bmatrix},
\]
with \(P\in S_n^+\), \(R\in\mathbb{R}^{m\times n}\), and \(Q\in\mathbb{R}^{m\times m}\) [1811.03805].

The key surrogate is the logarithmic norm
\[
\mu_p(M) := \lim_{\epsilon\rightarrow0^+}\frac{1}{\epsilon}\left(\|I+\epsilon M\|_p - 1\right),
\]
with
\[
\mu_2(M)=\lambda_{\max}\!\left(\frac{M+M^T}{2}\right).
\]
The central lemma gives
\[
\mu_p(F_r)\le \mu_p(F),
\]
and the resulting sufficient condition is
\[
\mu_p(F)<0.
\]
Thus, negativity of the matrix measure of a generalized unreduced Jacobian certifies small-signal stability of the DAE system, even though it is only a sufficient condition and not equivalent to the exact eigenvalue test [1811.03805].

For \(p=2\), the certificate is written as a BMI
\[
F(\mathbf{z},Z)+ F^T(\mathbf{z},Z)- \zeta I \preceq 0,
\]
with \(P\succ0\) and \(\zeta<0\). Because this BMI is bilinear in \(Z\) and \(J(\mathbf{z})\), hence nonconvex and \(\mathcal{NP}\)-hard, the tractable step is to fix a certificate matrix \(Z^\star\) at a base equilibrium \(\mathbf z^\star\), solve
\[
J(\mathbf{z}^\star)^T Z + Z^T J(\mathbf{z}^\star)-\zeta I \preceq 0,
\]
and then certify a box uncertainty set
\[
\mathcal U=\prod_k \mathcal U_k,\qquad \mathcal U_k=[\underline z_k,\overline z_k]
\]
through the robust SDP
\[
J(\mathbf{z})^T Z^\star + (Z^\star)^T J(\mathbf{z}) - \zeta I \preceq 0,\qquad \forall \mathbf z\in\mathcal U.
\]
If the optimal \(\zeta^\star<0\), all feasible equilibria in \(\mathcal U\) are certified stable. The cited work explicitly characterizes this as an inner approximation of the BMI-defined region and therefore also an inner approximation of the true eigenvalue-based SSSR [1811.03805].

In the reported 2-bus study, the BMI-certified stable area was always contained in the true stable area and was close to it in a two-dimensional state plane; the robust SDP/LMI also produced convex stable regions in transformed variable planes. This suggests a conservative but optimization-friendly approximation to SSSR-like sets under operating-point variability, especially when repeated reduced-Jacobian eigenvalue checks are undesirable.

## 4. Boundary construction, sampling, and security-margin formulations

Recent boundary-oriented work operationalizes the secure region as the intersection of AC feasibility and small-signal security margin constraints. In that setting, an operating point is feasible if it satisfies steady-state operational constraints, stable if it is small-signal stable, and secure if it is both feasible and small-signal stable. The controllable operating-point vector is
\[
\mathbf{x} =
\begin{bmatrix}
P_{G_i} \\
|V_j| \\
S_{D_k}
\end{bmatrix},
\]
for non-slack generator active powers, generator-bus voltage magnitudes, and load-bus complex powers. The practical security boundary is then defined jointly by the AC-feasible region boundary and a minimum damping-ratio boundary, with case studies using
\[
\zeta_{\min}=3\%
\]
for the least damped mode [2501.09513].

The same work defines a high-information-content region
\[
\Omega = \{ \operatorname{OP}_k \in \Psi \mid \gamma - \beta < \gamma_k < \gamma + \beta \},
\]
where \(\gamma\) is the security-boundary value of the chosen margin, \(\gamma_k\) is the security index at \(\operatorname{OP}_k\), and \(\beta\) is a tolerance band. The computational pipeline combines optimization-based bound tightening, separating hyperplanes derived from a QC relaxation of AC-OPF, Hit-and-Run sampling in the remaining convex polytope, directed walks toward the boundary using damping-ratio sensitivity, and final AC-feasibility repair. The directed-walk step uses
\[
d(\operatorname{OP}_k)=|\gamma_k-\gamma|,\qquad
\operatorname{OP}_{k+1} = \operatorname{OP}_k - \alpha_k \cdot \nabla d(\operatorname{OP}_k),
\]
with adaptive step size \(\alpha_k\) chosen according to distance-to-boundary tiers [2501.09513].

This methodology does not derive an analytic SSSR manifold; it samples near a composite boundary empirically. In the reported PGLib-OPF 39-bus and 162-bus studies, the proposed method yielded \(85\%\) and \(79\%\) of samples in the HIC region, respectively. Decision-tree classifiers trained on these boundary-enriched datasets achieved better F1-scores on explicit boundary test sets than naïve Latin hypercube sampling or a Gaussian importance-sampling benchmark: \(0.77\) versus \(0.67\) and \(0.64\) on the 39-bus boundary set, and \(0.72\) versus \(0.42\) and \(0.48\) on the 162-bus boundary set [2501.09513]. This indicates that, in practical security assessment, preserving boundary geometry and balancing samples on both sides of the secure/insecure divide can materially improve learned region discrimination.

## 5. Data-driven and online approximations of secure-region membership

One line of work replaces explicit geometric construction by learned membership testing. A graph neural network formulation for real-time small-signal security assessment defines binary security under an \(N\!-\!1\) contingency criterion: output \(1\) if the operating point satisfies the small-signal security criterion for all contingencies considered, output \(0\) otherwise. Labels are generated by varying generator active powers and load active/reactive powers, solving OPF, simulating all single-line contingencies, applying a 3-phase fault at \(t=0.1\,\text{s}\) and clearing it at \(t=0.15\,\text{s}\), then checking whether the damping ratio
\[
\zeta = \frac{-\sigma}{\sqrt{\sigma^2 + \omega^2}}
\]
satisfies \(\zeta\ge 0.03\) for every contingency. The learned classifier therefore can be interpreted as an implicit approximation of the indicator function of an SSSR-like secure set, although it does not explicitly construct a geometric region [2406.02964].

In that GNN approach, each bus carries node features
\[
[X]_i=[v_i,p_i,q_i]\in\mathbb{R}^3,
\]
and graph filtering is defined by
\[
H(S)x = \sum_{k=0}^{K} h_k S^k x.
\]
The IEEE 68-bus and NPCC 140-bus case studies reported best accuracies of \(95.70 \pm 1.50\%\) and \(96.72 \pm 0.25\%\) for the proposed GNNs, versus \(94.32 \pm 1.48\%\) and \(94.72 \pm 0.42\%\) for CNN baselines; training times were \(11.5\) min and \(13.5\) min for the GNNs, versus \(87.3\) min and \(83.4\) min for the CNNs. Under \(0\%\), \(10\%\), and \(20\%\) missing data at unhighlighted buses, the reported GNN accuracy remained unchanged up to \(20\%\) missing data, whereas CNN performance degraded sharply [2406.02964]. For SSSR use, this is best interpreted as fast secure/insecure membership testing rather than direct boundary computation.

A different data-driven direction estimates a confidence-qualified secure neighborhood around a stable equilibrium in state space. Starting from the reduced DAE Jacobian
\[
\mathbf{A}(\mathbf{x},\mathbf{y}) =
\frac{\partial\mathbf{f}}{\partial\mathbf{x}}
-
\frac{\partial\mathbf{f}}{\partial\mathbf{y}}
\left(\frac{\partial\mathbf{g}}{\partial\mathbf{y}}\right)^{-1}
\frac{\partial\mathbf{g}}{\partial\mathbf{x}},
\]
the cited method assumes \(\mathbf{A}\) is Hurwitz at the current operating point, constructs a converse Lyapunov function
\[
V(\mathbf{x}) = \int_0^\infty \alpha(\|\phi(\mathbf{x},t)\|)\,dt,
\]
learns it from trajectory data with a windowed online Gaussian process, and defines the estimated secure region
\[
\Omega_\delta^N = \left\{ \mathbf{x}\in \mathbb{R}^n \mid \mu_h^N(\mathbf{x})+\beta_\delta \sigma_h^N(\mathbf{x}) \le \hat V_{\max}^N \right\},
\qquad
\beta_\delta=\Phi^{-1}\left(\frac{1+\delta}{2}\right).
\]
This object is not a classical SSSR; it is a probabilistic inner approximation of a region of attraction or dynamic secure set in state space. Still, it is closely related operationally because it tracks a changing secure neighborhood around a small-signal-stable equilibrium. The reported microgrid study used a \(9\)-bus, \(3\)-generator system, window width \(h=100\), an RBF kernel, a \(90\%\) confidence region, and computation time around \(5\) seconds in Matlab 2017b [1911.10459].

## 6. Cybersecurity and inverter-dominated extensions

Cyber-physical work uses the same small-signal boundary concept in reverse: instead of constructing the stable set, it asks whether constrained perturbations can force an operating point to leave it. In a false-data-injection framework, the operating point is altered through attacked load measurements, AC power flow is re-solved, and the resulting linearized model is checked for instability via the criterion
\[
\textrm{\bf Real}(\lambda) > 0.
\]
The attack synthesis problem couples AC network equations, operating constraints, and small-signal eigenvalue constraints. Although no full SSSR is explicitly computed, the method studies attack-induced crossing of a small-signal stability boundary. On the WSCC 3-machine 9-bus system, \(7{,}500\) uniformly random attack vectors produced only one destabilizing case, for an empirical success rate of about \(0.013\%\), whereas an informed attacker could still drive the system unstable even with limited measurement access [2102.10587]. In SSSR terms, the work is about reachability of the unstable complement of the stable region under attack constraints.

In inverter-dominated systems, the SSSR has been reformulated explicitly for switched grid-following/grid-forming control. For a parameter vector \(\bm p\in\mathbb{R}^l\) and eigenvalues \(\lambda_i(\bm p)\) of the small-signal state matrix \(\bm A(\bm p)\), the region is defined as
\[
\bm{\Omega}:= \left\{ \bm{p}\in\mathcal{S} \mid \max_i \left[\mathrm{Re}(\lambda_i(\bm{p}))\right] < 0 \right\},
\]
with numerical boundary approximation
\[
\partial \bm{\Omega}:= \left\{ \bm{p}\in\mathcal{S} \mid -\varepsilon \le \max_i \left[\mathrm{Re}(\lambda_i(\bm{p}))\right] \le 0 \right\}.
\]
The cited paper develops full-order \(12\)th-order GFL and \(13\)th-order GFM subsystem models, fits subsystem SSSR boundaries by a hyperplane-approximation algorithm with \(\varepsilon=0.01\) and \(\varepsilon_r=0.001\), and states that the overall switched-system SSSR is the union of the constituent subsystem SSSRs [2603.19618].

That inverter work also introduces internal stability margin distributions (ISMDs), where the margin \(\mu\) is the orthogonal distance from the rightmost eigenvalue to the imaginary axis, and a comprehensive stability index
\[
J(\bm{X}) = \omega_m \cdot \bar{M}(\bm{X}) - \omega_s \cdot \bar{S}(\bm{X}) + \omega_d \cdot \bar{D}(\bm{X}),
\]
with \(\omega_m+\omega_s+\omega_d=1\). The margin term is derived from a GMM regression, the sensitivity term from the Euclidean norm of \(\nabla f(\bm X)\), and the boundary-distance term from the minimum Euclidean distance to the SSSR boundary. The reported parameter studies found that GFL is more stable under larger SCR, GFM is more secure under smaller SCR, GFL is more sensitive to \(X/R\), and GFM has comparable sensitivity to both \(SCR\) and \(X/R\). EMT simulations further showed that a CSI-based adaptive switching policy can outperform a conventional strategy that switches mainly on SCR, because the proposed policy avoids operation near fragile portions of the SSSR [2603.19618].

Across these developments, the SSSR remains the central abstraction for organizing small-signal security: as an exact eigenvalue-defined region in parameter or injection space, as a projected admissible set under renewable uncertainty, as a conservative DAE-based robust inner approximation in state-algebraic space, as a composite AC-feasibility-plus-margin boundary for dataset generation, as an implicitly learned secure-set indicator in real-time assessment, and as a switching-design object in inverter-dominated grids. The cited literature collectively suggests that modern use of SSSR increasingly combines exact spectral definitions with conservative certificates, projected or composite boundaries, and data-driven surrogates when direct region construction becomes difficult.

Source: https://www.emergentmind.com/topics/small-signal-security-region-sssr