WorksEngineering
Ranking the Parameters Shaping Grid Dynamics
Abstract
Generator and transmission line parameters do not shape the time-domain behavior of a power system equally; a parameter that dominates one dynamic property can be almost invisible to another. This paper studies how the physical parameters of a detailed and general nonlinear differential algebraic equation (DAE) grid model shape the properties that decide whether system states such as frequencies, voltages, and angles can be inferred, observed, controlled, and kept stable. The rankings are conditional as they depend on where grid sensors and actuators sit, on the operating region and the disturbance, on the network topology, and on other settings that the operator chooses. The framework combines DAE trajectory sensitivities, variational Gramians, and stability margin sensitivities to measure how much each parameter reshapes the network dynamics. On three benchmark systems, the rankings show where dynamic leverage concentrates and where the control-theoretic metrics disagree, and they point to how parameter studies can guide calibration, sensor and actuator placement, and security assessment. The proposed methods herein are also scalable and can be tested on grids with tens of thousands of buses.
Introduction and Paper Contributions
When a fault, a load swing, or a drop in renewable output disturbs a power system, the measured response reflects many physical quantities at once. Generator inertia and damping shape it, and so do machine reactances and time constants, controller settings, load behavior, and the network power flow parameters that enter through the admittance matrix. A few of these quantities dominate the visible response. Others have little effect, are hard to tell apart, respond weakly to the available actuators, or show up in only one mode or one contingency. Knowing which parameters carry the most weight, and for which purpose, helps focus model calibration and guide sensor and actuator placement, and it cuts the computational burden of dynamic security studies. We study this problem as an offline assessment of parameter importance. It belongs to planning, calibration, and model validation ahead of operation, so the design goal is thoroughness across many scenarios, and online speed is secondary.
The paper poses the question for a general nonlinear differential algebraic equation (DAE) power system model that couples generator dynamics of arbitrary order with the algebraic network and power balance equations [1]. It focuses on the global impact of parameters on four properties, namely identifiability, observability, stability, and controllability. Table 1 defines each one, and Figure 1 sketches the question behind each.
| Property | Central question | Principal dependencies |
| Identifiability | Can parameters be inferred from measured trajectories? | Excitation, sensors, noise, scaling, horizon, topology |
| Observability | Can internal states be reconstructed? | Sensors, trajectory, topology, measurement quality |
| Controllability | Can selected actuators influence relevant states? | Actuator locations, limits, horizon, trajectory, topology |
| Stability | Do feasible perturbations contract or grow? | Trajectory, disturbance, topology, protection, stability metric |
Table 1. Control-theoretic properties that this paper studies.

Figure 1. Conceptual view of the four properties in Tab. I.
Nonlinear DAE Theory. Nonlinear systems theory gives local tests for observability through Lie derivatives and related rank conditions
[2]. In a DAE the dynamic states evolve together with algebraic variables that must satisfy the network equations. [3] gives a local observability test for nonlinear DAEs, and [4] studies controllability and observability for nonlinear index-one DAEs. More recently, [5] propose a rank-based identifiability test that acts directly on nonlinear DAEs. These results lay the theoretical groundwork. Symbolic tests, however, become hard to carry out on large multimachine models, and they usually return a local yes-or-no answer instead of a practical ranking of physical parameters.
Observability of Power System Dynamics. The study [6] formulates nonlinear observability directly for a power system DAE with generator dynamics. The work [7] apply Lie derivative tests to a nonlinear fourth-order synchronous generator and find that observability depends strongly on the chosen measurements and on the operating trajectory. For larger systems, the authors in [8] place PMUs with empirical observability Gramians and our recent work [9] revisits this problem by generalizing it and considering DAE dynamics. An empirical Gramian perturbs the system, simulates it again, and records how strongly states, inputs, or parameters move the trajectories and outputs of the nonlinear system.
Controllability and Stability. Control analysis of power systems is mature for models linearized around an operating point. Selective modal analysis, residues, participation factors, and eigenvalue sensitivities are long-standing tools for finding the critical machines, feedback signals, actuator locations, and parameters behind poorly damped modes [10, 11]. Gramian methods and empirical controllability and observability covariances carry this input-output view over to large nonlinear power system models [12], and Gramian-based reduction applies directly to large sparse descriptor (DAE) power system models [13]. Other DAE studies examine how algebraic variables participate, both through modal participation factors and in singular systems more broadly [14, 15]. For large disturbances, critical clearing time sensitivity is a measure of how parameters affect transient stability under a specific contingency [16]. The literature thus offers several useful importance measures. They answer different questions, though, and they can rank the same parameters differently.
Parameter Identifiability. Trajectory sensitivities support inverse problems and parameter estimation in nonlinear power system models [17], and structured identification recovers reduced-order models directly in differential-algebraic form [18]. [19] study structural and practical identifiability for a nonlinear transient generator DAE, and [20] compare Fisher information with data-driven approaches on a single machine infinite bus model. [21] use a numerical Fisher information matrix to rank parameter estimators and informative disturbances for a small system. The closest precedent is our own recent study [22], which develops DAE-aware Bayesian inference to jointly estimate generator inertia and damping along with transmission line resistance and reactance. That study does not connect identifiability to controllability, state observability, or stability-based parameter rankings.
Research Gap. Observability, controllability, parameter estimation, and stability sensitivity each have a large literature of their own. What is missing is a framework that keeps the full nonlinear generator and network DAE, evaluates all the properties in Tab. I under many operating conditions, and turns the result into a ranking of parameter importance. No universal ranking should be expected, since every result depends on parameter scaling, sensors, actuators, excitation, time horizon, topology, operating point, and contingency. A useful outcome is instead a set of scenario-dependent rankings, together with an account of which parameters keep their rank across scenarios and of when the control-theoretic measures agree or conflict. § 5 reports both.
Paper Contributions. The paper makes four contributions. (i) It casts parameter importance for nonlinear power system DAEs as one problem with four commensurately normalized score vectors, one each for controllability, identifiability, observability, and stability (Problem 1). (ii) It builds DAE constraint-consistent variational Gramians, which extend the ODE variational Gramian of [23] to the DAE manifold, and it shows that a continuous-time manifold reduction and a direct differentiation of the implicit time step give the same first-order output variation. (iii) It maps these Gramians to dimensionless metrics and then to scenario-aggregated parameter scores, which make explicit how each result depends on sensors, actuators, excitation, topology, horizon, and disturbance. (iv) It gives a scalable algorithm and tests it on multimachine benchmarks with different generator setups and model orders.
Paper Organization. § 2 states the grid model and problem formulation. The variational dynamics follow in Section III. § 4 turns them into Gramians, property metrics, parameter scores, and the main algorithm, and § 5 tests the theory on three benchmark systems.
Nonlinear DAE System Model
Consider a transmission network with graph , where is the set of buses and is the set of transmission lines. A bus can host synchronous generators, inverter-based resources, dynamic or static loads, and other controllable devices. The set collects the electrical neighbors of bus . Each branch has a series conductance and susceptance, shunt elements, a transformer tap ratio, a phase shift, and a status. A topology is the active edge set , where collects the status variables of the candidate branches . A line outage or a switching action changes and, with it, the algebraic coupling. The complete nonlinear power system model then takes the DAE form
Table II lists the variables. The form (1) is general enough to hold generator models of any order, along with the dynamics of exciters, governors, power system stabilizers, inverter controls, loads, and protection logic. Let be the buses equipped with PMUs. A PMU at bus measures the complex bus voltage and the complex currents on selected incident branches, and the aggregate measurement model is
| Vector | Role | Representative entries |
| Differential states | Generator , plus controller, inverter, storage, and dynamic load states | |
| Algebraic states | Bus voltages, stator currents, generated and consumed powers, and branch flows | |
| Control inputs | Mechanical power, field voltage, controller references, and inverter commands | |
| Uncertain inputs | Loads, renewable injections, faults, and other exogenous disturbances | |
| Outputs | PMU voltage and current channels and optional device measurements | |
| Parameters | , controller gains and time constants, , shunts, taps, and load and resource parameters | |
| Topology | Statuses of the candidate branches | |
| Combined DAE vector | , where |
Table II. Base vectors, dimensions, and representative entries, following [1].
where collects the available PMU channels and is the measurement error. In rectangular coordinates a typical local output is . The nonlinear map encodes PMU placement, channel selection, coordinate transformations, branch currents computed from admittances, and any other measured device quantities. The parameter vector splits into blocks as
which hold the generator, controller, network and power flow, load, and other resource parameters in that order. The list is meant to be inclusive, so the parameters of any device that appears in , , or become entries of .
The study specification collects the admissible parameter ranges, consistent initial conditions, input and disturbance trajectories, PMU channels, actuators, time horizon, operating conditions, and topology scenarios. For every parameter we seek four normalized scores . The controllability score measures how strongly changes the ability of the selected inputs to move the relevant states or modes. The identifiability score measures how uniquely and reliably can be inferred from the prescribed input and measurement trajectories. Observability concerns the states, so measures how strongly changes the information available for reconstructing the dynamic and algebraic states. Finally, the stability score measures the influence of on the selected nonlinear stability margins. In every case zero means negligible relevance under , and one means the largest relevance after a stated normalization across the candidate parameters. This leads to the following problem.
Problem 1 (Grid DAE parameter importance). Given the nonlinear DAE model (1), measurement model (3), parameter vector , and study specification , compute the four score vectors .
The next section computes all four score vectors from variational Gramians, following the steps in Fig. 2 which outlines the paper’s methods and technical contributions.
Variational Gramians for DAEs
This section builds the variational sensitivities that feed the Gramians, the standard tools for assessing controllability and observability. Together they turn the nonlinear DAE trajectory into the four parameter scores of Fig. 2.
DAE Constraint-Consistent Variational Dynamics
The goal is to see how the measured response changes when the initial state, the inputs, or the parameters change slightly. Following [23], we differentiate the nonlinear flow and its output map along a nominal trajectory. That trajectory always comes from solving the full nonlinear DAE (1). The variational equations describe only the small deviations around it, which are linear in the perturbation and have coefficients that change with time. The DAE adds one requirement that the ODE construction of [23] lacks. The differential and algebraic variables must stay on the DAE constraint manifold
An algebraic perturbation that leaves this manifold violates the network equations and corresponds to no nearby power system trajectory. We therefore perturb the differential states freely and let the algebraic variables follow from the manifold.
All Jacobians below are evaluated along the nominal nonlinear trajectory, and the dependence on is dropped for compactness. The first variation is the directional derivative of (1) and (3), that is, the first-order change in the constrained trajectory and its output caused by an infinitesimal perturbation of the initial state, input, or parameter along a chosen direction. It leads
We call (5) the variational DAE (VAR-DAE). Each -quantity is the perturbation of the matching variable, and the subscripted matrices are the Jacobians of , , and with respect to the states, algebraic variables, inputs, and parameters. The VAR-DAE is a linearization taken along the full nonlinear trajectory, so its coefficients vary in time and are recomputed at every point of the nonlinear solution. A linearization about a single equilibrium has constant coefficients instead. Equation (5) is the standard trajectory sensitivity formulation and is not new to this paper. Throughout, the DAE is regular, smooth, and of index one. These assumptions almost always hold for power system dynamics, so we state them only briefly. The vector-valued nonlinearities , , and are continuously differentiable, the initial condition is consistent, and is nonsingular along the trajectory [1, 24]. Two methods then quantify how each parameter affects the system properties, given in the next section.
Constraint Manifold Reduction (Method 1)
Under the regularity conditions above, the implicit function theorem applied to the algebraic block (4b) of the variational DAE gives the constraint-consistent algebraic variation
Substituting it into (5) gives the reduced variational model
where
The reduced matrices have dimensions , , , , , and . In practice they come from sparse linear solves with , and its inverse is never formed. Let be the state transition matrix and the parameter sensitivity matrix. They satisfy
The initial value carries any dependence of the initial power flow and dynamic states on . The output Jacobians, which are the sensitivities of the measured output (3) to the initial state and to the parameters, are
with and . Method 1 thus eliminates the algebraic variables on the constraint manifold and integrates a reduced ordinary differential equation for the state-to-output and parameter-to-output sensitivities.
DAE Time-Step Differentiation (Method 2)
Method 2 computes the same first-order sensitivities as the variational DAE (5). It keeps and together and differentiates the discrete nonlinear equations that the time-domain integrator already solves at each step. Let . With the input held over the step and the exogenous and topology fixed at their nominal values, one integration step is the residual equation
where maps to and already embeds the algebraic constraints at the new step. The residual can represent the trapezoidal rule that many power system simulators use, a backward differentiation formula, or an implicit Runge–Kutta method. Differentiating (11) along the same perturbation directions gives
with , , and , where and belong to , , and . Consequently, , , and . Here too the inverses stand for linear solves. The Newton solution of the nominal DAE step usually leaves a factorization of behind, so the tangent update is cheap. General-purpose DAE solvers use the same idea when they integrate forward sensitivities alongside the original DAE.
At a perturbation of the differential states must be lifted onto the constraint manifold. The lift completes it with the matching algebraic perturbation so that the pair satisfies (4b), and it reads
Here maps an independent differential-state perturbation into the tangent space of the DAE manifold. The product then maps a feasible perturbation of to , and the output variation is
with , , and . Method 2 suits a power system simulation toolbox such as ANDES [25], because it reuses the simulator’s symbolic Jacobians, sparse Newton matrix, event handling, and numerical discretization. It also differentiates the numerical flow that the experiments actually use, whereas Method 1 differentiates the continuous DAE before discretization. Equations (12) through (14) form the discrete-time realization of the variational DAE (5). They act as a constraint-consistent propagator that carries an initial, input, or parameter perturbation through the simulated trajectory and out to the measurement. This propagator is the DAE counterpart of the variational dynamics that [23] develop for ODE systems, and it respects the algebraic network constraints.
The two methods are equivalent, as the next proposition states. That lets us use the cheaper one, Method 2 with the simulator’s own factorizations, without loss.
Proposition 1 (Equivalence of the two DAE variations). The reduced variation of Method 1, (7), and the discrete variation of Method 2, (12), map the same DAE constraint-consistent initial, input, and parameter perturbations to the same first-order output variation in the limit as the integration step approaches zero.
We omit the proof for brevity. Both constructions are the first derivative of the same constrained flow, and the case studies in Section V confirm the equivalence numerically. The two methods therefore differ only in discretization error, which motivates a comparison of their accuracy, run time, conditioning, and time-domain behavior.
Variational Metrics and Parameter Scores
This section turns the variational dynamics (5) of Section III into one Gramian per property, then into scalar metrics, and finally into normalized parameter scores.
DAE Variational Gramians
All four Gramians, for observability, identifiability, controllability, and stability, come from the same variational sensitivities on the DAE manifold.
Observability. Let be the sample times of the output (3). The quadrature weights , for example the trapezoidal weights , turn the sum below into a time integral over the horizon. The matrix , with , describes measurement noise or output scaling, is a nonsingular diagonal state-scaling matrix, and . Stacking the output-to-state sensitivity from (10) over all sample times gives the weighted sensitivity matrix , whose block rows are the per-sample sensitivities, and the observability Gramian ,
with and . Over the horizon, accumulates how strongly each feasible initial-state direction shows up in the measurements, so a direction the sensors barely see adds little to it. It is the constraint-consistent DAE counterpart of the variational observability Gramian that [23] build for ODE systems. The definition holds for every method of Section III, and in Method 2 the sensitivity is from (14). The next proposition records when certifies observability.
Proposition 2 (DAE variational observability Gramian). The Gramian in (15) is positive semidefinite, and positive definite if and only if the stacked output Jacobian has full column rank in the independent tangent directions. Moreover, it is the infinitesimal limit of an empirical observability Gramian formed by perturbing and recomputing a consistent for every perturbed simulation.
We omit the proof for brevity, and the case studies in § 5 verify the result numerically.
Identifiability. The same stacking with the output-to-parameter sensitivity from (10) in place of the output-to-state sensitivity gives the identifiability matrix and Gramian
where is a nonsingular diagonal parameter-scaling matrix, , and . For Gaussian measurement noise, is also the local Fisher information matrix. Its rank measures local parameter identifiability, and its conditioning reveals practical confounding between parameters. Uncertainty in the initial condition can enter as nuisance directions and be removed through a Schur complement.
Controllability. Let be the discrete impulse response of the variation, which maps a unit actuator perturbation applied at time to the resulting differential-state variation at . For the discrete model,
where extracts the differential states. The controllability Gramian accumulates these responses over all injection times, so it measures how strongly the chosen actuators can move each feasible state direction over the horizon. A finite-horizon variational controllability Gramian is
where is a nonsingular diagonal input-scaling matrix, each is a scalar weight, , and . This Gramian quantifies local reachability along the nonlinear constrained trajectory. Since and come from the step residual (11), which embeds , the algebraic power flow constraints hold at every step, and the only reachable directions are those consistent with the network equations. Global nonlinear controllability is a separate question that does not settle here, which could be an interesting (and frankly very challenging) question for future work.
Stability. Stability is harder to pin down than the other three properties because it spans both small and large disturbances. We therefore use two complementary measures and say plainly what each one does and does not certify. The first is a local divergence measure built from the scaled finite-time Cauchy-Green matrix
where and both belong to . The quantity is the maximal finite-time Lyapunov exponent along the DAE manifold, and it measures how fast neighboring constrained trajectories separate over the horizon. Because contains no measurement map, it is a deformation matrix and not a Gramian in the strict sense. [26] study Lyapunov exponents of nonlinear DAE power systems in depth and optimize metrics over the full Lyapunov spectrum for stability assessment and renewable placement.
Here a single finite-time exponent is one of two stability measures inside the parameter importance framework, and we refer the reader to that work for the full spectrum. The exponent is a local divergence rate. On its own it does not certify transient (large disturbance) stability, locate the stability boundary, or measure the margin of any particular contingency. A trajectory can have a modest finite-time exponent and still sit close to losing synchronism, and a large exponent does not always mean instability over the study horizon.
The second measure targets large disturbance margins directly. For a specified fault, the critical clearing time is the longest fault duration after which the post-fault DAE trajectory still returns to the acceptable operating region. Its parameter sensitivity
gives a contingency-specific stability importance that the finite-time exponent cannot provide. The critical clearing time sensitivity method for DAE models [16] computes it from trajectory sensitivities, with no linearization at an equilibrium. The first measure (18) thus captures local divergence along a generic trajectory, and the second (19) captures the margin of a named large disturbance.
Property Metrics and Parameter Scores
No single eigenvalue or trace captures every aspect of the four properties, so every reported ranking must state its metric. We use the regularized, dimensionless metrics
For , all of . and reward information or control authority in every direction. measures the worst case finite-time divergence and the large disturbance clearing margin, while is the conditional information for parameter after accounting for its correlation with the other parameters. The smallest eigenvalue, the trace, the condition number, and task-weighted variants are natural alternatives and robustness checks. A large trace, for instance, can hide a single nearly unobservable or uncontrollable direction.
Each is one study scenario, that is, one choice of operating point, disturbance, and topology from the specification of § 2. The operator aggregates over those scenarios by a weighted mean, a worst case, or an upper quantile. Identifiability already has parameter-indexed columns, so its raw importance is the scenario-aggregated conditional information
For observability, controllability, and stability, a parameter is important when a dimensionless change in it substantially changes the corresponding property. Their raw scores are the aggregated elasticities
The stability score uses the same construction summed over both stability metrics,
where the elasticity of is exactly the critical clearing time sensitivity of (19). The weights shift the emphasis between local divergence and the large disturbance margin, with for disturbances that have no fault to clear. For a parameter that can be zero or change sign, the derivative is taken with respect to its declared characteristic scale in place of . Because , , and already depend on first variations, their parameter derivatives are mixed sensitivities. Finite differences of the complete metric, second-order forward sensitivities, or an adjoint of the augmented nominal-plus-variational DAE can all compute them. The adjoint pays off when the number of scalar metrics is much smaller than [27].
The final scores of Problem 1 are
for . The normalization gives the largest raw score the value one and sets every score to zero in a zero-information case. Scores from different properties still live on different scales and are not numerically interchangeable. The sign of each elasticity in (24) is kept separately to tell beneficial parameter changes from adverse ones.
The scores also have a limited scope. The Gramians and scores are local to a nonlinear trajectory and not to an equilibrium, and aggregation over makes them aware of the operating region. Formal structural identifiability, global nonlinear controllability, and behavior near singular algebraic points need separate analysis, and a finite-horizon variational Gramian certifies none of them. With that in mind, seeing the methods are computationally cheap, they can arbitrarily be tested for thousands of scenarios. Algorithm 1 summarizes the complete workflow of the paper.
Algorithm 1. NDAE Parameter Importance Scores
Input DAE (1), PMU model (3), study specs
Output Core scores
Set ,
foreach in parallel do
Solve a consistent initial condition and the full nonlinear DAE (1), and split the trajectory at faults, switches, limits, and topology changes
foreach smooth segment do
Evaluate ((18))
Take from and obtain the O/S/C elasticities ((24)) by centered full-DAE differences
Accumulate
Normalize each by (26)
return
Case Studies
Simulation Setup and Research Questions
All studies run on an M5 Max MacBook Pro (2026) with 128 GB of RAM. We implement Algorithm 1 in ANDES, an open-source Python library for power system modeling and time-domain simulation [25].1 The test systems, in order of size, are the WSCC 9-bus system (case9), the IEEE 39-bus New England system (case39), and the WECC 179-bus system. ANDES supplies the nonlinear DAE (1), its trajectory, and the sparse DAE Jacobians that the variational methods use, and the machine, controller, and network data come from its distribution. The 9-bus model has three sixth-order machines and no controllers. The 39-bus and 179-bus models add turbine governors, exciters, and stabilizers, and Table IV lists the state and algebraic dimensions and of all three. In every system the measurements are generator rotor speeds and terminal voltage magnitudes. The candidate parameters include the machine quantities and also the network power flow parameters that enter the algebraic equations, which are the transmission line series resistance , series reactance , and line charging . Since the framework acts on the full DAE, it scores these algebraic (network) parameters on the same footing as the differential (machine) ones. Four research questions (RQs) guide the case studies.
| System | Time (s) | |||||
| WSCC 9 | 18 | 18 | 69 | 18 | 5 | 75.4 |
| IEEE 39 | 220 | 170 | 479 | 18 | 5 | 76.6 |
| WECC 179 | 708 | 573 | 1696 | 18 | 5 | 460.3 |
Table IV. Computational time of Algorithm 1 for all four score vectors (offline study, variational controllability). is the number of differential states with a nonzero time constant.
RQ1. Is the variational approach correct, i.e., do Methods 1 and 2 produce identical first-order sensitivities (Prop. 1), and does the variational observability Gramian match the empirical one (Prop. 2)?
RQ2. Do the four control-theoretic properties induce the same parameter ranking, or do they conflict?
RQ3. How do the rankings depend on the disturbance and operating point?
RQ4. What is the offline computational cost of a complete study, and how does it grow with system size?
Theory Validation (RQ1)
Figure 3 answers RQ1 with three tests. First, Method 1 (manifold reduction, (7)) and Method 2 (direct differentiation of the implicit step, (12)) give output sensitivities that agree to about over the whole horizon. Both discretize the same trajectory with the same integrator, so the equivalence of Proposition 1 holds to round-off and not only in the small-step limit. Second, the eigenvalues of the reduced state matrix coincide with those from the separate ANDES eigenvalue analysis. They reproduce the electromechanical modes from 0.2 to 2.3 Hz, which checks the constraint-consistent reduction against an external ground truth. The agreement holds on every test system, including the 708-state WECC model, so the reduction stays accurate at scale. Third, the variational observability Gramian agrees with the empirical Gramian assembled from constraint-consistent perturbations of the initial state and full nonlinear resimulations. Their 1.9% relative Frobenius difference comes from the finite-difference step, and this comparison is the direct check of Proposition 2. One numerical detail needs care. On the IEEE 39-bus system, 50 controller states of the exciters and stabilizers are written in algebraic form and make the bare algebraic block rank deficient. A small singular-perturbation mass keeps nonsingular and reproduces the ANDES modes to within 0.3%, and Method 2 stays well posed throughout.
Figure 3. Validation of the theory (RQ1). (a) On the IEEE 39-bus system, the output sensitivities from Method 1 and Method 2 are indistinguishable (), as Proposition 1 predicts. (b) The eigenvalues of the reduced state matrix coincide with those of the independent ANDES eigenvalue routine. (c) The variational observability Gramian matches the empirical Gramian built from full nonlinear resimulations (Proposition 2). Their relative Frobenius difference comes from the finite-difference step.
The variational construction is also much cheaper than the empirical (finite-difference) Gramian it matches. The empirical route needs a full nonlinear resimulation for every perturbed direction, while the variational route reuses one trajectory and its factorizations. Table III compares the time per Gramian of the two routes on the IEEE 39-bus system.
| Gramian | Empirical (s) | Variational (s) | Speedup |
| Observability | 81.8 | 0.24 | 345× |
| Controllability | 1.3 | 0.29 | 4× |
| Stability | 81.8 | 0.24 | 348× |
Table III. Time per Gramian (s) on the IEEE 39-bus system for the empirical route (finite-difference resimulation) and the variational route, both on the same single scenario and horizon.
Conflicting Rankings (RQ2)
Figure 4 shows the normalized scores (26) for the IEEE 39-bus system, with machine and network line parameters in the same candidate set. The properties do not agree on a leader. A machine transient reactance dominates identifiability, while a second transient reactance dominates both stability and controllability, for three distinct winners across four properties. The four control-theoretic measures thus disagree on which parameters carry the most weight, as the introduction anticipates. No universal ranking exists, and calibrating the most identifiable parameter does little for the parameters that govern dynamic security. Damping and stator resistance score near zero under every property, which fits the absence of a damping torque path and the negligible resistive losses in the chosen measurements. The disagreement persists on the 708-state WECC system (Figure 5). There a network parameter, a transmission line resistance, is the most identifiable, and a field time constant and two inertias lead observability, stability, and controllability. System size does not cause the conflict, and network power flow parameters can carry the most dynamic leverage.
Figure 4. Normalized parameter scores on the IEEE 39-bus system, with rows ordered by identifiability and a candidate set that mixes machine and network line parameters. Gold boxes mark the top parameter of each property. A transient reactance leads identifiability, an inertia leads observability, and a second transient reactance leads both stability and controllability. Damping and stator resistance are negligible throughout.
Figure 5. All four scores on the 708-state WECC 179-bus system for one representative contingency, with controllability from the variational Gramian. The conflict persists at scale. A transmission line resistance tops identifiability and a field time constant tops observability, while two different inertias, and , top stability and controllability. Because a network parameter leads one property, network power flow parameters belong in the candidate set.
Scenario Dependence (RQ3)
Figure 6 varies the disturbance on the 9-bus system, sweeping the fault duration in (a) and the faulted bus in (b). The ranking splits the candidate parameters into two groups. Two of them never move. The slack-machine transient reactance is the most identifiable parameter in every scenario of both sweeps, and the slack-machine inertia is the least identifiable in every scenario. The slack machine thus holds both extremes, because the measured speed and voltage response is most sensitive to how this machine couples to the network and least sensitive to how fast it accelerates. The other four parameters keep trading places, and they do so to a similar degree in both sweeps. The mean pairwise Kendall rank correlation across the five scenarios is 0.63 for the duration sweep and also 0.63 for the location sweep. Fault duration and fault location therefore reorder the middle of the ranking about equally, and neither one is the gentler perturbation. This is the scenario-dependent behavior that the introduction anticipates, with one refinement. Rank persistence belongs to particular parameters and not to particular kinds of disturbance. Some parameters stay informative in every experiment, and others are informative only under specific disturbances, which argues for designing identification experiments around the parameters of interest.
Figure 6. Scenario dependence of identifiability on the WSCC 9-bus system for the inertias (solid) and transient reactances (dashed) of the three machines, with color marking the machine. The sweeps run over fault duration (a) and fault location (b), and rank 1 is the most identifiable. Both extremes stay fixed in either sweep. The slack-machine transient reactance is always first and the slack-machine inertia is always last. The four parameters in between reorder by a similar amount in both panels (mean pairwise Kendall in each), so the ranking separates scenario-independent parameters from scenario-dependent ones, and fault duration and fault location reshuffle it about equally.
Computational Cost (RQ4)
The framework is an offline assessment that runs ahead of operation for planning, calibration, and model validation. The relevant cost is therefore the end-to-end time of a complete study, and online latency plays no role. Table IV reports that time for all four score vectors over scenarios. The variational controllability Gramian reuses the trajectory of the other scores, so no score needs an extra simulation. The 9-bus and 39-bus studies finish in about 75 s each, while the 708-state WECC study takes roughly eight minutes. The variational route is what keeps a study of this size tractable. By finite-difference resimulation a single observability Gramian takes more than a minute, while the variational route needs a fraction of a second (Table III).
Discussion and Broader Impact
The studies answer the four questions and support the central premise of the paper. The variational machinery passes every check in RQ1. The two methods agree to round-off, the variational and empirical observability Gramians match to about 1.9%, and the reduced state matrix reproduces an independent eigensolver on all systems up to 708 states. The four properties then rank parameters differently on both the IEEE 39-bus and WECC systems (RQ2). Parameter importance is thus defined only relative to a stated purpose, a sensor and actuator set, and a disturbance, and a calibration campaign tuned for one property may leave another poorly constrained. Under RQ3 the rankings reorder with both fault duration and fault location, yet a few parameters hold their position in every scenario. This separates parameters that are informative everywhere from those that are informative only under specific disturbances, which can guide experiment and measurement design. Finally, the algorithm delivers all four scores over five scenarios on a 708-state model in about eight minutes, orders of magnitude faster than the empirical route (RQ4).
The scores tell an operator which parameters to calibrate for a trustworthy model, where to place measurements, and which actuators to rely on for control and security, so calibration effort no longer has to treat all parameters as equally important. Future work will add structural identifiability certificates, analytic sensitivity propagation that avoids finite-difference parameter perturbations, inverter-based resource models, and larger systems.
Acknowledgments
The author acknowledges support from the National Science Foundation (NSF), United States, under grants 2152450 and 2550934. The author also acknowledges the use of Claude to help develop and refine the theoretical results (the proofs were omitted but confirm the theory is correct) and with the code generation and implementation. The case studies and all data are available to any interested reader.
References
References
- [1]P. W. Sauer, M. A. Pai, and J. H. Chow, *Power System Dynamics and Stability: With Synchrophasor Measurement and Power System Toolbox*, 2nd ed. Wiley-IEEE Press, 2017.
- [2]R. Hermann and A. J. Krener, “Nonlinear controllability and observability,” IEEE Transactions on Automatic Control, vol. 22, no. 5, pp. 728–740, 1977.DOI
- [3]W. J. Terrell, “Observability of nonlinear differential algebraic systems,” Circuits, Systems and Signal Processing, vol. 16, no. 2, pp. 271–285, 1997.DOI
- [4]K. Sato, “Algebraic controllability and observability of nonlinear differential algebraic systems with geometric index one,” SICE Journal of Control, Measurement, and System Integration, vol. 7, no. 5, pp. 283–290, 2014.DOI
- [5]A. N. Montanari, F. Lamoline, R. Bereza, and J. Gonçalves. (2024) Identifiability of differential-algebraic systems. [Online]. Available: https://arxiv.org/abs/2405.13818
- [6]C. J. Dafis and C. O. Nwankpa, “A nonlinear observability formulation for power systems incorporating generator dynamics,” in Proceedings of the IEEE International Symposium on Circuits and Systems, vol. 5, 2002, pp. V–277–V–280.
- [7]A. Rouhani and A. Abur, “Observability analysis for dynamic state estimation of synchronous machines,” IEEE Transactions on Power Systems, vol. 32, no. 4, pp. 3168–3175, 2017.DOI
- [8]J. Qi, K. Sun, and W. Kang, “Optimal PMU placement for power system dynamic state estimation by using empirical observability Gramian,” IEEE Transactions on Power Systems, vol. 30, no. 4, pp. 2041–2054, 2015.
- [9]M. H. Kazma and A. F. Taha, “Revisiting the optimal PMU placement problem in multimachine power networks,” IEEE Transactions on Control Systems Technology, vol. 33, no. 2, pp. 493–511, 2024.arxiv.org/abs/2306.13584
- [10]G. C. Verghese, I. J. Pérez-Arriaga, and F. C. Schweppe, “Selective modal analysis with applications to electric power systems, Part II: The dynamic stability problem,” IEEE Transactions on Power Apparatus and Systems, vol. PAS-101, no. 9, pp. 3126–3134, 1982.
- [11]K. W. Wang, C. Y. Chung, C. T. Tse, and K. M. Tsang, “Multimachine eigenvalue sensitivities of power system parameters,” IEEE Transactions on Power Systems, vol. 15, no. 2, pp. 741–747, 2000.DOI
- [12]J. Qi, J. Wang, H. Liu, and A. D. Dimitrovski, “Nonlinear model reduction in power systems by balancing of empirical controllability and observability covariances,” IEEE Transactions on Power Systems, vol. 32, no. 1, pp. 114–126, 2017.DOI
- [13]F. D. Freitas, J. Rommes, and N. Martins, “Gramian-based reduction method applied to large sparse power system descriptor models,” IEEE Transactions on Power Systems, vol. 23, no. 3, pp. 1258–1270, 2008.
- [14]G. Tzounas, I. Dassios, and F. Milano, “Modal participation factors of algebraic variables,” IEEE Transactions on Power Systems, vol. 35, no. 1, pp. 742–750, 2020.
- [15]I. Dassios, G. Tzounas, and F. Milano, “Participation factors for singular systems of differential equations,” Circuits, Systems, and Signal Processing, vol. 39, no. 1, pp. 83–110, 2020.DOI
- [16]C. Mishra, “Critical clearing time sensitivity for differential-algebraic power system model,” IEEE Transactions on Power Systems, vol. 36, no. 4, pp. 3153–3162, 2021.arxiv.org/abs/2007.10813
- [17]I. A. Hiskens, “Power system modeling for inverse problems,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 51, no. 3, pp. 539–551, 2004.DOI
- [18]S. Nabavi and A. Chakrabortty, “Structured identification of reduced-order models of power systems in a differential-algebraic form,” IEEE Transactions on Power Systems, vol. 32, no. 1, pp. 198–207, 2017.DOI
- [19]T. G. Landgraf, E. P. T. Cari, and L. F. C. Alberto, “An analysis of structural and practical identifiability applied to a transient generator model,” Electric Power Systems Research, vol. 206, p. 107817, 2022.DOI
- [20]N. Evangelou, A. M. Stankovic, I. G. Kevrekidis, and M. K. Transtrum. (2024) Comparing analytic and data-driven approaches to parameter identifiability: A power systems case study. [Online]. Available: https://arxiv.org/abs/2412.18663
- [21]D. Virginillo, A. Derviškadić, and M. Paolone, “Identification of power system dynamic model parameters using the Fisher information matrix,” IEEE Transactions on Power Systems, vol. 41, no. 2, pp. 1376–1388, 2026.
- [22]A. A. Albustami, A. F. Taha, and S. Mahadevan, “DAE-aware Bayesian inference for joint generator-network dynamic parameter estimation,” in Proceedings of the 24th Power Systems Computation Conference (PSCC), Cyprus, 2026. [Online]. Available: https://arxiv.org/abs/2604.15686
- [23]M. H. Kazma and A. F. Taha. (2025) Observability for nonlinear systems: Connecting variational dynamics, Lyapunov exponents, and empirical Gramians. [Online]. Available: https://arxiv.org/abs/2402.14711
- [24]T. Groß, S. Trenn, and A. Wirsen, “Solvability and stability of a power system DAE model,” Systems & Control Letters, vol. 97, pp. 12–17, 2016.
- [25]H. Cui, F. Li, and K. Tomsovic, “Hybrid symbolic-numeric framework for power system modeling and analysis,” IEEE Transactions on Power Systems, vol. 36, no. 2, pp. 1373–1384, 2021.
- [26]M. H. Kazma and A. F. Taha, “Stability and uncertainty propagation in power networks: A Lyapunov-based approach with applications to renewable resources allocation,” IEEE Transactions on Power Systems, In Press, 2025. [Online]. Available: https://arxiv.org/abs/2405.05028
- [27]Y. Cao, S. Li, L. Petzold, and R. Serban, “Adjoint sensitivity analysis for differential-algebraic equations: The adjoint DAE system and its numerical solution,” SIAM Journal on Scientific Computing, vol. 24, no. 3, pp. 1076–1089, 2003.DOI



