Preprint
Article

This version is not peer-reviewed.

On Structural Identifiability of Decentralised Systems

Submitted:

17 February 2025

Posted:

18 February 2025

You are already at the latest version

Abstract
The identifiability problem nonlinear decentralised systems (NDS) were not considered. Synthesis of mathematical models for NDS having a complex structure is an urgent problem. The presence of internal relationships and nonlinearities in NDS complicates the identifiability estimation. Therefore, models with uncertainty are used to design control systems for NDS. To describe the processes in NDS, it is necessary to apply adequate models based on verifying their identifiability. We propose an approach for assessing the local structural identifiability of nonlinear decentralised systems. Conditions of local parametric identifiability are obtained as functional constraints for parameters and nonlinearity.The effect of the constant excitation of experimental data on the S-synchronizability of DS is shown. The S-synchronizability condition fulfilment guarantees the structural identifiability estimate of DS with nonlinearity belonging to a certain sector. We introduce the S-congruence concept and propose a method for estimating the S-synchronizability of an input. Geometric structures and criteria are used to assess NDS identifiability. The simulation results are presented.
Keywords: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

Increasing the requirements for the DS mathematical description requires solving the structural identifiability (SI) problem. A lot of attention is paid to SI issues. This is relevant for biological systems that are described by models with many parameters [1,2]. Various problems of SI are discussed in [3,4,5,6,7,8,9]. The identifiability problem is parametric, and its solution is based on ensuring the completeness (rank) of the information matrix. Its solution is based on Taylor series expansion [10], series generation method, similarity transformation [11] and differential algebra. In identification theory, this requirement is equivalent to the condition of constant excitation [5].
The parametric paradigm [11] as the main research in the identification is being transformed into nonlinear systems. The issues of parametric identifiability (PI) of nonlinear systems are considered in many works (see, for example, [12-15 et al.]). Sensitivity methods are used [12], conditions for local parametric identifiability are got based on experimental data [13] analysis. A study of approaches used to assess the identifiability of biological models is given in [14]. A critical analysis of the data requirements used in parametric identifiability problems is considered in [15]. The study of global, local, structural and practical identifiability is considered in [1, 5, etc.].
There are several interpretations of the structural identifiability concept. Various authors understand the SI as the possibility of an unambiguous estimation of system parameters. SI [16,17,18] is interpreted as the possibility of an unambiguous theoretical assessment of model parameters based on given data. In [19], SI is understood as the a priori identifiability (AI) of a model with the set structure, since identifiability properties are based on the transformation of the model equation (such transformations are aimed at the possibility of estimating model parameters, rather than choosing the model structure). Most of SI approaches are a priori method. The analysis of existing approaches to AI is given in [19,20]. In this paper, SI is understood as an opportunity to evaluate the DS structure.
The identifiability of decentralised systems (DS) has not been studied. In principle, DS is a multivariable system (MS), whose SI has been studied by various authors. The main difference between DS and MS is internal connections, which complicates the study of SI.
In this paper, we consider the SI problem of nonlinear decentralised systems. The concepts and definitions of parametric identifiability (PI) are given. We consider conditions of constant excitation and S-synchronizability, which guarantee the SI of the NDS. We study the PI of decentralised systems with nonlinearities satisfying the sector condition and obtain functional conditions that ensure local PI. Conditions for the relationship between subsystems that guarantee the identifiability of the nonlinear part of the DS are considered. Geometric structures that are the basis for SI analysis are presented. In the final part of the paper, we describe the approach used to estimate the structural identifiability of NDS. In the final part of the article, we consider the approach used to evaluate the NDS structural identifiability and present simulation results.

2. Problem Statement

Consider a system comprising m interconnected subsystems
S i : X ˙ i = A i X i + B i u i + j = 1 , j i m A ¯ i j X j + F i X i , Y i = С i X i ,
where X i n i , Y i q i are vectors of the state and output of S i -subsystem, u i is control, i = 1 , m ¯ , i = 1 m n i = n . Coefficients of the matrices A i n i × n i , B i n i , A ¯ i j n i × n j are unknown, C i q i × n i . The matrix A ¯ i j reflects the mutual influence of the S j subsystem. F i X i n i consider the nonlinear state of the S i -subsystem, and A i is Hurwitz matrix (stable).
Assumption 1.  F i X i  belongs to the class
N F π 1 , π 2 = F ( X ) n : π 1 X F ( X ) π 2 X , F ( 0 ) = 0
and satisfies the quadratic condition
π 2 X F X T F X π 1 X 0 ,
Information set for subsystems Si
II o , i = X i ( t ) , u i ( t ) , X j ( t ) , t = t 0 , t k .
Mathematical model for
X ^ ˙ i = K i X ^ i X i + A ^ i X i + B ^ i u i + j = 1 , j i m A ¯ ^ i j X j + F ^ i X i ,
where K i H is Hurwitz matrix with known parameters (reference model); A ^ i ,   B ^ i , A ¯ ^ i j are tuning matrices of corresponding dimensions, F ^ i is a priori given nonlinear vector function.
Problem: based on the analysis II o , i , determine the SI conditions for the S i -subsystem.

3. Some Concepts and Definitions

Consider a dynamic system
Σ ( P ) : X ˙ ( t ) = F X ( t ) , P + G X ( t ) , P U ( t ) , Y t , P = H X ( t ) , P ,
where X n is state vector, U m is input vector (control), Y h is output, X ( t 0 ) = X 0 ( P ) ,   X 0 ( P ) is the initial condition, P q is vector of unknown parameters.
Definition 1 [21]. The parameter P q is structurally globally identifiable if for almost any P * q
Σ ( P ) = Σ ( P * ) P = P * .
Definition 2 [21]. Let there be a neighbourhood V ( P ) such that
P * V ( P ) & Σ ( P ) = Σ ( P * ) P = P * .
Then P is structurally locally identifiable for any P * q .
If the neighbourhood of V ( P ) does not exist, then the parameter P is called structurally locally unidentifiable.
Definition 3 [21]. The model M structure is globally identifiable at point K * if
M K = M K * , K D M K = K * ,
where D M r is a connected open subset of parameters.
Fulfilment of definition 3 conditions guarantees the identifiability of the model M at the point.

4. Condition of Constant Excitation and S-Synchronizability

A priori identifiability is based on the analysis of rank conditions for the information matrix. In adaptive systems, conditions based on the constant excitation (CE) of set II o , i elements are used to analyse properties of the identification system.
Definition 4. The vector X i ( t ) n i is continuously excited if
E C α ¯ X i , α ¯ X i : α ¯ X i I n i X i X i T ( t ) α ¯ X i I n i t t 0 , t 0 + T ,
where I n i n i × n i is the identity ma, α ¯ X i , α ¯ X i are positive numbers, T > 0 .
We will write about the CE condition as X i ( t ) E C α ¯ X i , α ¯ X i . If condition (5) for X i ( t ) is not satisfied, then we will write X i ( t ) E C α ¯ X i , α ¯ X i or X i ( t ) E C
Since DS (1) is nonlinear, then we represent condition (5) as
E C α ¯ X i , α ¯ X i S : α ¯ X i I X i X i T ( t ) α ¯ X i I & Ω X i ( ω ) Ω X i S ( ω ) ,
where Ω X i ( ω ) is the set of frequencies for X i ; Ω X i S ( ω ) is the set of acceptable frequencies for X i , guaranteeing S-synchronizability. Next, we will denote the CE property as E C α ¯ X i , α ¯ X i , assuming that it guarantees E C α ¯ X i , α ¯ X i S . .
The equation for the S i -subsystem identification error E i = X ^ i X i
E ˙ i = K i E i + Δ A i X i + Δ B i u i + j = 1 , j i M Δ A ¯ i j X j + Δ F i X i ,
where Δ A i = A ^ i A i , Δ B i = B ^ i B i , Δ A ¯ i j = A ¯ ^ i j A ¯ i j , Δ F i = F ^ i F i are parametric residuals.
Definition 5. The input u i ( t ) will be called S-synchronising and written u i S if it reflects all the nonlinear properties of the S i -subsystem.

5. PI Conditions

We consider the DS identifiability based on analysis II o , i .. This is practical identifiability.
Assumption 2. Let 1) A i H ; 2) rank С i С i A i С i A i 2 С i A i n i 1 T = n i .
Definition 6 [22]. Let assumption 2 hold. Then the pair A , C is called fully recoverable, and the S i -subsystem is fully recoverable.
Definition 7 [22]. Let the pair A , C be fully recoverable. Then subsystem S i will be locally parametrically identifiable on the set II o , i , if estimates of the model (4) parameters belong to some limited region G A q of the parametric space P S i .
We will consider the results [23], which will be used.
Lemma 1. If the nonlinearity F ( X ) n belongs to the class F ( X ) N F π 1 , π 2 , then
F X 2 η α ¯ X ,
where  X n , η = η π 1 , π 2 > 0 , α ¯ X = α ¯ X X > 0 .
Lemma 2. If the conditions of Lemma 1 are satisfied, then
Δ F T Δ F 2 η α ¯ X + δ F ,
where  η = 2 π ¯ + π 2 , π ¯ = π 1 π 2 , π = π 1 + π 2 , δ F > 0 .
Consider the system (6) and the Lyapunov function (LF) V i E i = 0.5 E i T R i E i , where R i = R i T > 0 is the positive symmetric matrix. Let Δ A i = tr ( Δ A i T Δ A i ) , where is the matrix norm, tr is the trace of the matrix.
The following conditions for the local identifiability of subsystem S i are valid in the parametric space. They are a modification of Theorem 1 [23].
Theorem 1. Let 1)  A i H  ; 2)  X i ( t ) E C α ¯ X i , α ¯ X i  ,  X j ( t ) E C α ¯ X j , α ¯ X j   u i ( t ) E C α ¯ u i , α ¯ u i  ; 3) Lemma 1, 2 conditions of are fulfilled for  F i X i  ; 4) assumption 2 holds. Then the system (1) is locally parametrically identifiable on the set  II o , i if
2 α ¯ X i Δ A i 2 + α ¯ u i Δ B i 2 + j = 1 , j i m α ¯ X j Δ A ¯ i j 2 + 2 η α ¯ X i + δ F i λ ¯ i V i ,
where  λ ¯ i = λ i k i  ,  λ i > 0  is the minimum eigenvalue of the matrix  Q i  ,  k i > 0 , K i R i + K i T R i = Q i  ,  Q i  is the positive symmetric matrix,  η = 2 π ¯ + π 2  ,  π = π 1 + π 2  ,  π ¯ = π 1 π 2  ,  δ F i 0 .
Corollary of Theorem 1. Let the conditions of Theorem 1 be fulfilled. Then the nonlinearity F i is locally structurally identifiable in the sector
S X i π 1 , π 2 = X i n i : π 1 X i F i ( X i ) π 2 X i ,
If
Δ F i 2 0.25 λ ¯ i V i + z i ,
where  z i 0 .
The proof of the corollary from Theorem 1 is given in Appendix A.
We see that the S i -subsystem will be parametrically identifiable if the nonlinearity dominates on the effects of the S j subsystem.
The corollary from Theorem 1 gives the conditions under which the local structural identifiability is possible for the nonlinear part of subsystem S i in sector S X i π 1 , π 2 .
Definition 8. If conditions (8), (9) are fulfilled, then subsystem S i is locally structurally identifiable at the parametric level.
Remark 1. Theorem 1 provides conditions for the local SI of the system R1 in the form of estimates for the model (2) parameters belonging to the limited region of parametric space.
Consider the input-output information set
II o , Y i = Y i ( t ) , u i ( t ) , Y j ( t ) , t J = t 0 , t k .
For subsystem S i , we get the representation [23]
Y ˙ i = A # , i Y i + B # , i u i + j = 1 , j i m A ¯ # , i j Y j + C ˜ i # F i C ˜ i Y i ,
where C ˜ i = C i T C i # C i T , A # , i = C ˜ i # A i C ˜ i , B # , i = C ˜ i # B i , A ¯ # , i j = C ˜ i # A ¯ i j C ˜ j , # is the sign of the pseudo-conversion of the matrix.
Model for the system (10)
Y ^ ˙ i = K # , i Y ^ i Y i + A ^ # , i Y i + B ^ # , i u i + j = 1 , j i m A ¯ ^ # , i j Y j + F ^ # , i C ˜ i Y i
and the equation for the error
E ˙ # , i = K # , i E # , i + Δ A # , i Y i + Δ B ^ # , i u i + j = 1 , j i m Δ A ¯ ^ # , i j Y j + Δ F # , i C ˜ i Y i ,
where F ^ # , i = C ˜ i # F ^ i , Δ A # , i = A ^ # , i A # , i , Δ B # , i = B ^ # , i B # , i , Δ A ¯ # , i j = A ¯ ^ # , i j A ¯ # , i j , Δ F # , i = F ^ # , i F # , i , λ ¯ # , i > 0 . The K # , i H matrix is selected to ensure the stability of the identification process.
Definition 9. If the conditions of assumption 2 are fulfilled and the pair A # , i , C ˜ i is fully recoverable and the pair A # , i , A ¯ # , i j is stabilised, then subsystem (10) is called fully recoverable.
Definition 10. Let assumption 2 hold. Then 1) the system (10) is detectable if the subspace of non-recoverable states is contained in the subspace of stable states; 2) the pair A i , C i is detectable.
Introduce the error E # , i = Y ^ i Y i and ФЛ V # , i E # , i = 0.5 E # , i T R i E # , i .
Theorem 2. Le: 1)  A # , i H  ; 2)  Y i ( t ) E C α ¯ Y i , α ¯ Y i  ,  Y j ( t ) E C α ¯ Y j , α ¯ Y j   u i ( t ) E C α ¯ u i , α ¯ u i  ; 3) Lemma 1, 2 conditions of are fulfilled for  F i X i  ; 4) the system (10) is observable, recoverable, and stabilised. Then the system (10) is locally structurally parametrically identifiable on the set G2 if
2 α ¯ Y i Δ A # , i 2 + α ¯ u i Δ B # . i 2 + j = 1 , j i m α ¯ Y j Δ A ¯ # , i j 2 + 2 η α ¯ Y i + δ F # , i λ ¯ # , i V # , i ,
Δ F # , i 2 0.25 λ ¯ # , i V # , i + z # , i ,
where  λ ¯ # , i > 0 , z # , i > 0.
Theorem 2 is proved similarly to Theorem 1.
So, conditions (12), (13) guarantee the local parametric identifiability of the system (1) in the output space.
Remark 2. In Theorems 1 and 2, the concept of the "structurally identifiable system" is understood in a parametric sense. This follows from estimates for nonlinearity obtained in Lemmas 1 and 2. The concept of structural refers to non-linearity, which must belong to class N F and satisfy the functional constraint (13).
Consider the SI problem. Apply the approach based on the special class analysis of geometric frameworks [24].

6. Geometric Frameworks

Consider the system S i . Let u i E C α ¯ i , α ¯ i and y i , k Y i is k th element of the output vector. Calculate the derivative y i , k and denote it as y ˙ i , k . Construct a phase portrait S i , k for the S i -system in the space y i , k , y ˙ i , k . Consider structures S u i , y i , k k = 1 , q i described by the functions γ i , k : u i y i , k . Introduce the model for y ˙ i , k :
y ^ ˙ i , k = a i , k , 0 + a i , k , 1 u i + a i , k , 2 y i , j   j 1
on the set II o , y i , k = y i , k ( t ) , u i ( t ) , y j , l ( t ) , t J = t 0 , t k and calculate the error e i , k = y ^ ˙ i , k y ˙ i , k , where a i , k , 0 , a i , k , 1 , a i , k , 2 are numbers determined using the least squares method.
Define the structures S u i , k y i , k and S u i , k y ˙ i , k described by the mappings γ y i , k : u i y i , k and γ y ˙ i , k : u i y ˙ i , k .
Remark 3. The model (14) structure can change. The number of independent variables on the right-hand side (14) depends on the properties of the subsystem S i . The choice of the model (14) structure is based on the iterative immersion method [24].
For the system S i , we construct the geometric framework (GF) S e i y i described by the function γ e , y i , k : y i , k e i , k . Then, the subsystem S i can be represented as:
C i : S y , i : X ˜ ˙ i = A i X ˜ i + j = 1 , j i m A ¯ i j X ˜ j + G i , Y ˜ i = С i X ˜ i , S φ , i , k : e i , k = f y i , k , y j ,   k , j 1 ,
where X ˜ i n i is a variable describing the general solution of the system (1); G i n i is a limited disturbance that appears as a result of the allocation of the variable e i , k 2.

7. SI of Subsystem S i

Let u i E C and A i H .
Definition 10 [24]. The input u i ( t ) U S , i U i is an S-synchronising for system (1) if the domain D y of the structure S e i y i has a maximum diameter D y i on the set y i , k ( t ) , t J , where U S , i is multiple synchronization inputs having the CE property U i ; is the set of acceptable inputs for the S i -subsystem.
If the input is S-synchronizing, then we will write u i S . We understand the diameter D y i as the maximum distance between two points S e i y i .
Consider a system S φ , i , k and frameworks S e i y i , S u i , k y i , k and S u i , k y ˙ i , k .
Definition 11. Frameworks S e i y i and S u i , k y ˙ i , k are S-congruent if their structural features are similar.
Definition 12. If S e y , and S u i , k y ˙ i , k are S-congruent, then the input u i ( t ) is S-synchronising and guarantees the S-synchronizability of the system S φ , i , k .
Definition 12 provides a criterion for selecting the required input having the specified properties and the property E C α ¯ u i , α ¯ u i is valid for it.
As shown in [25], u i S ( u i u h , i ) guarantees the SI of NDS, where the index h is a sign of identifiability.
There may be some subset u h , k ( t ) U S , k U k ( k 1 ) whose elements have the property of S-synchronizability. The structure S e y , k u h , k with a diameter D y , k corresponds to each u h , k ( t ) . Since u h , k ( t ) S , the diameters D y , k will have the d h , Σ -optimality property [25].
Let the hypothetical framework S e y (structure S e y r e f ) of the system S φ , i , k have diameter d h , Σ . The reference framework S e y r e f is the structure S e y , reflecting all the properties of the function f ( ) .
Designate the diameter D y S e y r e f as D y r e f . D y r e f exists for the S φ , i , k -system having the S-synchronising input.
If S e y S e y r e f , then D y D y r e f ε y , where ε y 0 , is a proximity sign. The elements of the subset U S have the property
D y S e y u ( t ) u U S D y r e f ε y .
Definition 13 [25]. The framework S e y , i has the d h , Σ -optimality property on the set U h if there exists ε Σ i > 0 such that d h , Σ D y , i ε Σ i , i = 1 , # U h ¯ , where # U h is cardinality of set U h .
Definition 14 [25]. If the subset of inputs u h , k ( t ) = U h U ( k 1 ) the elements of which are u h , k ( t ) S and their corresponding frameworks S e y , k u h , k have the of d h , Σ -optimality property, then frameworks S e y , k u h , k are structurally indistinguishable on sets U h and J u u ( t ) = u h , k ( t ) .
It follows from definitions 13 and 14 that if there is the set U h , then the h δ h -identifiability (SI) estimate is obtained for any input u ( t ) U h .
Definition 15 [25]. Frameworks S e y , i u i U S that do not have the d h , Σ -optimality property are locally structurally unidentifiable (SNI) on the set U h .
Remark 4. The framework S e y , i u i U S , which is SNI on the set U h , defines the class N φ N N F π 1 , π 2 . Here S e y , i u i U S , belongs to the insignificant structures N S e y for which the d h , Σ -optimality condition is not fulfilled.
Definition 16. Frameworks  S e y , k u h , k defining the class F f for the function f ( ) and having the d h , Σ -optimality property are locally structurally identifiable on the set U h .
Notation:
(a)
S e y , i Σ is the framework S e y , i u h , i , which has the d h , Σ -optimality property;
(b)
S e y , i L S I is a locally structurally identifiable framework S e y , i u h , i .
Let S e y i = F S e y i l F S e y i r , where F S e y i l , F S e y i r are the left and right fragments S e y . The fragments are determined on areas D y l , D y r with diameters D y i l , D y i r . Then the system S φ , i , k is locally structurally identifiable or h δ h -identifiable and S e y , i u h , i S e y , i L S I if
D y i l D y i r ε y i , ( l , r ) ,
where ε y i , ( l , r ) 0 .
Remark 4. We have considered the case of non-linearities belonging to the class N F π 1 , π 2 . N F π 1 , π 2 has a set of non-linearities, which are both symmetric and non-symmetric. If f i , k F i X i is non-symmetric and f i , k π 1 X i , π 2 X i , then we use the approach [26] to estimate SI. Here, the SI assessment is reduced to ensuring ε a -identifiability.
Remark 5. Structural identification depends on the connections between subsystems. These connections must be stable and satisfy the corollary of Theorem 1. This condition guarantees the identifiability of the nonlinear part of the S i -subsystem at the parametric level. This approach allows you to localise the nonlinearity to evaluate the SI.
Definition 16. NDS is locally structurally identifiable if conditions of Theorems 1, 2 are fulfilled, and the nonlinear part is SI.

8. Simulation Results

1. Consider the system
S 1 : x ˙ 11 x ˙ 12 = 0 1 a 21 a 22 x 11 x 12 + 0 a ¯ 1 x 2 + 0 b 1 u 1 + 0 c 1 f 1 x 11 , y 1 = x 11 , S 2 : x ˙ 2 = a 2 x 2 + a ¯ 2 x 11 + b 2 u 2 + c 2 f 2 x 2 , y 2 = x 2 ,
where X 1 = x 11 x 12 T and y 1 are the state vector and output of the subsystem S 1 ; u 1 , u 2 are input (control)); f 1 x 11 = sat x 11 is saturation function; f 2 x 2 = sign x 2 is sign function; y 2 is subsystem S 2 output. System parameters (18): a 21 = 2 , a 22 = 3 , a ¯ 1 = 1.5 , b 1 = 1 , c 1 = 1 , a 2 = 1.25 ,   a ¯ 2 = 0.2 , b 2 = 1 , c 2 = 0.25 . Inputs u i ( t ) are sinusoidal.
For the S 1 -subsystem, the phase portrait is shown in Figure 1. The processes are nonlinear. There is a relationship y 2 = y 2 y 1 between y 1 and y 2 (the determination coefficient is 75%), which affects the properties of the subsystem S 1 (see Figure 1).
The results of the evaluation of the S-congruence for subsystems are presented in Figure 2 and Figure 3, which show phase portraits and frameworks.
We see the frameworks are S-congruent, and the inputs (controls) u i are S-synchronising.
Remark 5. In the space u 1 , y 1 , the subsystem S 1 has the representation
y ˙ 1 = α 1 y 1 + α 2 p y 1 + β 12 p x 2 + b 1 p u 1 + c 1 p f 1 ,
where α 1 , α 2 , β 12 , b 1 , c 1 are coefficients; μ > 0 ,
p ˙ y 1 = μ p y 1 + y 1 , p ˙ x 2 = μ p x 2 + x 2 , p ˙ u 1 = μ p u 1 + u 1 , p ˙ f 1 = μ p f 1 + f 1 .
The application of filters (20) changes the original frequency spectrum of the system (18). Here, the S-congruence estimation procedure also works, but the set Ω u i ( ω ) of u i inputs must change. This is confirmed by the simulation results.
The structure S e i y 1 is shown in Figure 4. It is obtained as follows. Since there is the relationship y 2 = y 2 y 1 , the iterative immersion method is used to obtain S e i y 1 .
To exclude the effect of y 2 on y 1 , we synthesized a model
y ^ 2 = 0 . 5626 + 0 . 4419   y 1 .
The variable y ^ 2 is used to construct the model (14), which has the form for the system (18)
y ^ ˙ 1 = 0.07209 + 0 , 3602 u 1 + 0.1506 y 1 + 0.002 y ^ 2 .
Apply (22) and get the structure S e 1 y 1 described by the function γ e 1 , y i : y i , k e 1 , where e 1 = y ˙ 1 y ^ ˙ 1
The average diameters of fragments are equal D ¯ y 1 l = 1.59 , D ¯ y 1 r = 1.146 . If we put ε y 1 , ( l , r ) = 0.2 in (17), then we get that the system is h δ h -identifiable. It follows from Figure 4 that the nonlinearity of f 1 y 1 is a function of saturation.
So, the subsystem of the S 1 -subsystem (18) is locally structurally identifiable.
Consider the subsystem S 2 . Data analysis has shown that there is an impact of y ˙ 1 on y ˙ 2 . Therefore, we apply the iterative immersion method and use
y ^ ˙ 2 = 0 . 0044 + 0 . 446 y ˙ 1
as the model (14), and calculate the error e 2 = y ˙ 2 y ^ ˙ 2 . Next, the geometric framework S e 2 y 2 (Figure 5) described by the function γ e 2 , y 2 : y 2 e 2 is definable. The results are shown in Figure 5. We see (a) subsystem S 2 is SI and contains non-linearity belonging to the class of sign functions; (b) structures S e 2 y 2 and S y ˙ 1 y 1 are S-congruent.
Remark 6. If the S-synchronizability conditions are not fulfilment, then DS may be unidentifiable.
2. Consider the system
S ¯ 1 : x ˙ 11 x ˙ 12 = 0 1 a 21 a 22 x 11 x 12 + 0 a ¯ 1 x 2 + 0 b 1 u 1 + 0 c 1 f 1 x 11 , y 1 = x 11 , S ¯ 2 : x ˙ 21 x ˙ 22 = 0 1 a ˜ 21 a ˜ 22 x 21 x 22 + 0 a ˜ 1 x 2 + 0 b ˜ 1 u 2 + 0 c ˜ 1 f 2 x 21 , y 2 = x 21 ,
where X 1 = x 11 x 12 T , X 2 = x 21 x 22 T are state vectors of the subsystem S ¯ 1 , S ¯ 2 ; is y 1 , y 2 are; u 1 , u 2 are inputs (control); f 1 x 11 = sat x 11 ; f 2 x 2 = x 2 . System parameters (23): a 21 = 2 , a 22 = 3 , a ¯ 1 = 0.5 , b 1 = 2.9 , c 1 = 2 , a ˜ 21 = 2.5 , a ˜ 22 = .5 , a ˜ 1 = 3.5 , b ˜ 2 = 1 , c ˜ 2 = 0.5 . Inputs u i ( t ) are sinusoidal.
The simulation results confirm the S-synchronizability of the inputs. We apply the D2 model
y ˜ ˙ 1 = 1.12 + 1 , 03 u 1 0.7 y 1 + 0.17 y 2
to construct the structure S ˜ e ˜ 1 y 1 and calculate the residual e ˜ 1 = y ˙ 1 y ˜ ˙ 1 . The structure S ˜ e ˜ i y 1 , described by the function γ e ˜ 1 , y 1 : y 1 e ˜ 1 , and the phase portrait S ˜ y i y 1 are shown in Figure 6. We see frameworks S ˜ e ˜ i y 1 and S ˜ y i y 1 are S-congruent, and subsystem S ¯ 1 is structurally identifiable. The framework S ˜ e ˜ i y 1 represents the nonlinearity f 1 y 1 .
Consider the subsystem S ¯ 2 . The phase portrait S ˜ y 2 y 2 and the structure S ˜ e ˜ 2 y 2 are shown in Figure 7. We see that subsystem S ¯ 2 is structurally identifiable, and the framework S ˜ e ˜ 2 y 2 coincides with the function f 2 y 2 . The analysis showed that y ˙ 2 is influenced by the variable y ˙ 1 . Therefore, apply the model:
y ˜ ˙ 2 = 0.0144 + 1.7343 y ˙ 1 ,
which is the basis for calculating the residual e ˜ 2 and constructing the S ˜ e ˜ 2 y 2 -structure. The oval (Figure 7) allocates the area that contains the S ˜ e ˜ 2 y 2 -fragment corresponding to f 2 y 2 .
So, simulation results confirm the effectiveness of the proposed approach to SI. The of the model structure (14) choice is the main problem of this method. The model identification depends on the DS type, experimental data properties, and the intuition of the researcher. Using the iterative immersion method solves this problem. The effectiveness of this method is showed by examples. The examples show it is difficult to propose a general approach to SI estimate. This is because of the peculiarities of the nonlinear system. Therefore, the DS detailed analysis and the results of data processing are the basis for deciding about SI.

9. Conclusions

An approach is proposed for assessing the local structural identifiability of a nonlinear decentralised system. The relationship is shown between the excitation constancy of the experimental data and the S-synchronizability, which guarantees the possibility of SI estimating for the NDS. We have obtained the local SI condition at the parametric level for subsystems, satisfying the quadratic condition for nonlinearity. The S-congruence concept is introduced, and the method is proposed, ensuring S-synchronizability of the input. Geometric structures and criteria are considered for estimating the structural identifiability of NDS.

Appendix

Corollary proof from Theorem 1. According to Theorem 1, NDS is locally parametrically identifiable if
2 α ¯ X i Δ A i 2 + α ¯ u i Δ B i 2 + j = 1 , j i m α ¯ X j Δ A ¯ i j 2 + 2 η α ¯ X i + δ F i λ ¯ i V i ,
where V i E i = 0.5 E i T R i E i . From Lemmas 1 and 2, we get:
2 η α ¯ X i + δ F i = 2 η α ¯ X i + δ F i δ F i = 2 Δ F i 2 δ F i ,
Therefore
Δ F i 2 0.25 λ ¯ i V i + 0.5 δ F i χ i θ i ζ α , j ζ j ,
where
θ i = min i Δ A i 2 + Δ B i 2 , ζ j = min j j = 1 , j i m Δ A ¯ i j 2 , ζ α , j = min j j = 1 , j i m α ¯ X j .
From the stability condition, we obtain ζ α , j ζ j δ F i χ i θ i , therefore Δ F i 2 0.25 λ ¯ i V i + z i . ■

References

  1. Saccomani M. P. Structural vs practical identifiability in system biology. IWBBIO 2013. Proceedings. Granada, 18-20 March, 2013;305-313.
  2. Villaverde A., Barreiro A., Papachristodoulou A. Structural identifiability of dynamic systems biology models. PLOS Computational Biology. 2016;12(10); 1–22. [CrossRef]
  3. Vanelli M., Hendrickx J. M. Local identifiability of networks with nonlinear node dynamics. arXiv:2412.08472v2 [math.OC] 31 Dec 2024.
  4. Zhong Y. D., Leonard N. E. A continuous threshold model of cascade dynamics. In 2019 IEEE 58th Conference on Decision and Control (CDC), IEEE, 2019, pp. 1704–1709.
  5. Vizuete R., Hendrickx J. M. Nonlinear network identifiability with full excitations, arXiv preprint arXiv:2405.07636, 2024.
  6. Legat A., Hendrickx J. M. Path-based conditions for local network identifiability. In 2021 60th IEEE Conference on Decision and Control (CDC), IEEE, 2021;3024–3029.
  7. Zhong Y. D., Leonard N. E.A continuous threshold model of cascade dynamics. In 2019 IEEE 58th Conference on Decision and Control (CDC), 2019;1704–1709.
  8. Lekamalage A. S. Identifiability of linear threshold decision making dynamics, 2024.
  9. Raue A., Becker V., Klingmüller U., Timmer J. Identifiability and observability analysis for experimental design in nonlinear dynamical models. Chaos, 2010;20(4); 045105. [CrossRef]
  10. Chis O.-T., Banga J. R., Balsa-Canto E. Structural identifiability of systems biology models: a critical comparison of methods. PLoS ONE, 2011;6(4);1-16. [CrossRef]
  11. Vajda S, Godfrey K, Rabitz H. Similarity transformation approach to identifiability analysis of nonlinear compartmental models. Mathematical Biosciences, 1989;93;217–248. [CrossRef]
  12. Stigter J. D., Peeters R. L. M. On a geometric approach to the structural identifiability problem and its application in a water quality case study. Proceedings of the european control conference 2007 Kos, Greece, July 2-5, 2007, 2007; 3450-3456.
  13. Handbook on the theory of automatic control / Edited by A. A. Krasovsky. Moscow: Nauka, 1987.
  14. Chis O.-T., Banga J. R., Balsa-Canto E. Structural identifiability of systems biology models: a critical comparison of methods. PLoS ONE, 2011;6(4);1-16. [CrossRef]
  15. Guillaumea H. A., Jakeman J. D., Marsili-Libellid S. et al. Introductory overview of identifiability analysis: A guide to evaluating whether you have the right type of data for your modeling purpose. Environmental Modeling and Software, 2019;119; 418–432.
  16. Conrad J. R., Eisenberg M. C. Examining the impact of forcing function inputs on structural identifiability. arXiv:2407.02771v1 [q-bio.QM] 3 Jul 2024.
  17. Weerts H.H.M., Dankers A. G., Van den Hof P. M. J. Identifiability in dynamic network identification. Preprints of the 17th IFAC Symposium on System Identification Beijing International Convention Center October. Beijing, China, 2015;19-21,.
  18. Verdière N. Identifiability in networks of nonlinear dynamical systems with linear and/or nonlinear couplings. Franklin Open, 2024, 9, 100195. [CrossRef]
  19. Anstett-Collin F., Denis-Vidal L., Millérioux G. A priori identifiability: An overview of definitions and approaches. Annual Reviews in Control, 2020;50;139-149. [CrossRef]
  20. Karabutov N. N. Introduction to the structural identifiability of nonlinear systems. Moscow: URSS/Lenand, 2021.
  21. Ljung L. System Identification: Theory for the User. Prentice Hall, 1999.
  22. Kwakernaak, H., Sivan R. Linear optimal control systems. New York, Wiley Interscience, 1975. [CrossRef]
  23. Karabutov N. Identification of decentralised control systems. Preprints-143582. https://www.preprints.org/manuscript/202412.1808/v1. [CrossRef]
  24. Karabutov N. N. S-synchronization Structural Identifiability and Identification of Nonlinear Dynamic Systems. Mekhatronika, Avtomatizatsiya, Upravlenie, 2020;21(6); 323-336.
  25. Karabutov N. Structural identifiability of systems with multiple nonlinearities. Contemporary Mathematics, 2021;2(2);103-172. [CrossRef]
  26. Karabutov N.N. Structural Identifiability Evaluation of System with Nonsymmetric Nonlinearities. Mekhatronika, Avtomatizatsiya, Upravlenie,2024;25(2);55-64. [CrossRef]
Figure 1. Phase portrait of the subsystem S 1 .
Figure 1. Phase portrait of the subsystem S 1 .
Preprints 149677 g001
Figure 2. S-congruence estimation for the subsystem S 1 .
Figure 2. S-congruence estimation for the subsystem S 1 .
Preprints 149677 g002
Figure 3. S-congruence estimation for the subsystem S 2 .
Figure 3. S-congruence estimation for the subsystem S 2 .
Preprints 149677 g003
Figure 4. Structure S e 1 y 1 for the subsystem S 1 .
Figure 4. Structure S e 1 y 1 for the subsystem S 1 .
Preprints 149677 g004
Figure 5. Structural identifiability evaluation of subsystem S 2 .
Figure 5. Structural identifiability evaluation of subsystem S 2 .
Preprints 149677 g005
Figure 6. SI evaluation of subsystem S ¯ 1 .
Figure 6. SI evaluation of subsystem S ¯ 1 .
Preprints 149677 g006
Figure 7. SI evaluation of subsystem S ¯ 2 .
Figure 7. SI evaluation of subsystem S ¯ 2 .
Preprints 149677 g007
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated