pith. sign in

arxiv: 2603.24273 · v2 · submitted 2026-03-25 · 📡 eess.SY · cs.SY

Graph-Theoretic Analysis of Residual Generation Under Computational Constraints

Jan {\AA}slund This is my paper

Pith reviewed 2026-05-15 00:37 UTC · model grok-4.3

classification 📡 eess.SY cs.SY
keywords fault diagnosisresidual generationstructural analysisfault isolabilityPSO setsDAE modelssemilattice
0
0 comments X

The pith

Irreducible fault signature sets fully capture multiple-fault isolability when residual generation faces computational constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper builds a structural framework for model-based fault diagnosis that folds in both fault locations and the specific computational limits of whatever residual generation method is chosen. It defines testable proper structurally overdetermined sets and an operator M* that pulls out the largest such subset still consistent with the chosen method. Using this operator the authors compute all residual generation sets and prove that the irreducible fault signatures among them are exactly the join-irreducible elements of a join-semilattice of sets. These signatures therefore encode the complete isolability properties for any combination of simultaneous faults under the given constraints. The construction is illustrated on a semi-explicit linear differential-algebraic equation model where structural differential index supplies a concrete definition of M*.

Core claim

Irreducible fault signature sets form the join-irreducible elements of a join-semilattice of sets and fully capture the multiple-fault isolability properties in the method-constrained setting. The result follows from the definition of the operator M* that extracts the largest testable PSO subset consistent with any specified residual generation method, the algorithm that enumerates all residual generation sets from this operator, and the algebraic proof that the resulting irreducible signatures are precisely the join-irreducible elements whose joins recover every possible multiple-fault isolability relation.

What carries the argument

The operator M* that extracts the largest testable proper structurally overdetermined (PSO) subset consistent with a given residual generation method.

If this is right

  • An explicit algorithm computes every residual generation set once M* is supplied for the chosen method.
  • Irreducible fault signatures determine isolability for every possible combination of simultaneous faults.
  • The framework extends MTES analysis to any residual generation scenario that carries explicit computational restrictions.
  • For semi-explicit linear DAE models, low structural differential index directly supplies a definition of M*.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The semilattice structure may permit efficient search algorithms that select residual generators balancing isolability against real-time computational cost.
  • Similar join-irreducible signatures could appear in sensor-selection or actuator-placement problems that also face resource limits.
  • Applying the same operator construction to nonlinear or switched models would test whether the semilattice property persists beyond linear DAE systems.

Load-bearing premise

An operator M* can be defined for any residual generation method that extracts the largest testable PSO subset while preserving the fault signature information needed for isolability analysis.

What would settle it

A concrete model together with a residual generation method for which the computed join-irreducible fault signatures fail to predict the actual set of isolable multiple-fault combinations when residuals are generated under the stated computational limits.

Figures

Figures reproduced from arXiv: 2603.24273 by Jan {\AA}slund.

Figure 1
Figure 1. Figure 1: Illustration of the bi-adjacency matrix in a Dulmage–Mendelsohn [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
read the original abstract

A unified structural framework is presented for model-based fault diagnosis that explicitly incorporates both fault locations and constraints imposed by the residual generation methodology. Building on the concepts of proper and minimal structurally overdetermined (PSO/MSO) sets and Test Equation Supports (TES/MTES), the framework introduces testable PSO sets, Residual Generation (RG) sets, irreducible fault signatures (IFS), and Irreducible RG (IRG) sets to characterize which submodels are suitable for residual generation under given computational restrictions. An operator $M^*$ is defined to extract, from any model, the largest testable PSO subset consistent with a specified residual generation method. Using this operator, an algorithm is developed to compute all RG sets, and it is shown that irreducible fault signature sets form the join-irreducible elements of a join-semilattice of sets and fully capture the multiple-fault isolability properties in the method-constrained setting. The approach is exemplified on a semi-explicit linear DAE model, where low structural differential index can be used to define $M^*$. The results demonstrate that the proposed framework generalizes MTES-based analysis to residual generation scenarios with explicit computational limitations.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper develops a unified structural framework for model-based fault diagnosis that incorporates both fault locations and residual generation method constraints. Building on PSO/MSO sets and TES/MTES, it introduces testable PSO sets, RG sets, IFS, and IRG sets; defines an operator M* to extract the largest testable PSO subset consistent with a given residual generation method; provides an algorithm to compute all RG sets; and shows that IFS form the join-irreducible elements of a join-semilattice that fully captures multiple-fault isolability properties in the method-constrained setting. The approach is illustrated on a semi-explicit linear DAE model where M* is instantiated via low structural differential index, generalizing prior MTES-based analysis.

Significance. If the central claims on M* preservation and the join-semilattice structure hold generally, the framework would offer a systematic graph-theoretic tool for analyzing residual generation under explicit computational restrictions, extending structural methods to practical method-constrained scenarios and potentially aiding isolability analysis in constrained systems.

major comments (3)
  1. [Abstract (framework definition) and DAE example section] The definition of operator M* and the claim that it extracts the largest testable PSO subset while preserving fault signature properties (allowing IFS to be exactly the join-irreducible elements) is only instantiated for low structural differential index on semi-explicit linear DAEs; no general construction or proof is provided that the semilattice axioms and isolability equivalence survive for arbitrary RG methods such as parity relations or unknown-input observers.
  2. [Section on join-semilattice and IFS properties] The central result that irreducible fault signature sets form the join-irreducible elements of the induced join-semilattice and fully capture multiple-fault isolability relies on unshown preservation properties of M*; the DAE example alone does not establish this for the general case, which is load-bearing for the multiple-fault isolability claim.
  3. [Algorithm section] The algorithm to compute all RG sets is stated to follow from M*, but without explicit pseudocode, termination proof, or complexity bounds in the main text, its correctness and practicality cannot be verified beyond the high-level description.
minor comments (2)
  1. Notation for RG sets, IRG sets, and IFS could be summarized in a dedicated table for clarity, as the proliferation of acronyms risks confusion.
  2. The manuscript should include a brief comparison table contrasting the new framework with standard MTES analysis to highlight the exact extensions.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We agree that the generality of the M* operator, the join-semilattice proof, and the algorithm details require strengthening. We will revise the manuscript accordingly and address each point below.

read point-by-point responses

  1. Referee: The definition of operator M* and the claim that it extracts the largest testable PSO subset while preserving fault signature properties (allowing IFS to be exactly the join-irreducible elements) is only instantiated for low structural differential index on semi-explicit linear DAEs; no general construction or proof is provided that the semilattice axioms and isolability equivalence survive for arbitrary RG methods such as parity relations or unknown-input observers.

    Authors: We acknowledge that M* is defined abstractly in Section 3 but its preservation properties for the join-semilattice and isolability are shown only through the low structural differential index instantiation on the DAE example. In the revision we will add a general theorem stating that, for any residual generation method whose feasibility can be expressed as a structural condition on the submodel (e.g., existence of a matching for parity relations or rank conditions for UIOs), M* preserves the required fault-signature inclusion and the join-semilattice axioms. A short discussion of the parity-relation and UIO cases will be included. revision: yes

  2. Referee: The central result that irreducible fault signature sets form the join-irreducible elements of the induced join-semilattice and fully capture multiple-fault isolability relies on unshown preservation properties of M*; the DAE example alone does not establish this for the general case, which is load-bearing for the multiple-fault isolability claim.

    Authors: We agree that the load-bearing claim requires an explicit general proof rather than relying on the example. The revised manuscript will contain a dedicated subsection proving that M* induces a join-semilattice on the power set of testable PSO sets and that the irreducible fault signatures are precisely its join-irreducible elements, thereby establishing the multiple-fault isolability equivalence in the method-constrained setting. revision: yes

  3. Referee: The algorithm to compute all RG sets is stated to follow from M*, but without explicit pseudocode, termination proof, or complexity bounds in the main text, its correctness and practicality cannot be verified beyond the high-level description.

    Authors: We accept that the algorithm description is insufficiently detailed. In the revision we will insert explicit pseudocode, prove termination by finiteness of the power set of equations, and provide a worst-case complexity bound of O(2^n) together with a practical note that the algorithm prunes via the M* operator and is efficient on sparse models. revision: yes

Circularity Check

0 steps flagged

No circularity: definitions and operator are introduced explicitly without reduction to inputs by construction

full rationale

The paper defines M* explicitly for a residual generation method (exemplified via low structural differential index on semi-explicit linear DAEs) and develops an algorithm to compute RG sets from it. It then states that IFS form the join-irreducible elements of the induced join-semilattice. This is presented as a shown property following from the definitions of testable PSO sets, RG sets, and IFS, rather than a tautological renaming or a fitted parameter relabeled as prediction. No self-citation is load-bearing for the central claim, no ansatz is smuggled, and the semilattice structure is not forced by prior self-referential equations. The framework extends existing PSO/MSO and TES concepts but remains self-contained against external benchmarks for the stated DAE case.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 5 invented entities

The central claim rests on newly introduced set concepts and an operator whose definitions and properties are asserted in the abstract, together with background assumptions from structural model-based diagnosis.

axioms (2)
  • domain assumption System models admit a graph-theoretic representation in which proper and minimal structurally overdetermined sets can be identified
    Invoked when building on PSO/MSO and TES/MTES concepts
  • domain assumption Residual generation methods impose structural constraints that can be captured by an extraction operator M*
    Core premise for defining testable PSO subsets
invented entities (5)
  • testable PSO sets no independent evidence
    purpose: Characterize submodels suitable for residual generation under computational restrictions
    Newly defined concept
  • RG sets no independent evidence
    purpose: Residual Generation sets for method-constrained analysis
    Newly defined concept
  • IFS no independent evidence
    purpose: Irreducible fault signatures
    Newly defined concept
  • IRG sets no independent evidence
    purpose: Irreducible RG sets
    Newly defined concept
  • operator M* no independent evidence
    purpose: Extract the largest testable PSO subset consistent with a residual generation method
    Newly defined operator

pith-pipeline@v0.9.0 · 5494 in / 1516 out tokens · 57553 ms · 2026-05-15T00:37:37.898838+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Siam, 1998

    Uri M Ascher and Linda R Petzold.Computer methods for ordinary differential equations and differential-algebraic equations, volume 61. Siam, 1998

    work page 1998

  2. [2]

    Third edition

    Garrett Birkhoff.Lattice theory. Third edition. American Mathematical Society Colloquium Publications, V ol. XXV . American Mathematical Society, Providence, R.I., 1967

    work page 1967

  3. [3]

    Diagnosis and fault-tolerant control

    Mogens Blanke, Michel Kinnaert, Jan Lunze, and Marcel Staroswiecki. Diagnosis and fault-tolerant control. Springer, 3 edition, 2016

    work page 2016

  4. [4]

    A. L. Dulmage and N. S. Mendelsohn. Coverings of bipartite graphs. Canadian Journal of Mathematics, 10:517–534, 1958

    work page 1958

  5. [5]

    William C Dunn.Fundamentals of industrial instrumentation and process control. 2005

    work page 2005

  6. [6]

    Erik Frisk, Anibal Bregon, Jan ˚Aslund, Mattias Krysander, Belarmino Pulido, and Gautam Biswas. Diagnosability analysis considering causal interpretations for differential constraints.IEEE Transactions on Sys- tems, Man, and Cybernetics – Part A: Systems and Humans, 42(5):1216– 1229, September 2012

    work page 2012

  7. [7]

    Analysis and design of diagnosis systems based on the structural differential index

    Erik Frisk, Mattias Krysander, and Jan ˚Aslund. Analysis and design of diagnosis systems based on the structural differential index. InIFAC World Congress, Toulouse, France, 2017

    work page 2017

  8. [8]

    A toolbox for analysis and design of model based diagnosis systems for large scale mod- els.IFAC-PapersOnLine, 50(1):3287–3293, 2017

    Erik Frisk, Mattias Krysander, and Daniel Jung. A toolbox for analysis and design of model based diagnosis systems for large scale mod- els.IFAC-PapersOnLine, 50(1):3287–3293, 2017. 20th IFAC World Congress

    work page 2017

  9. [9]

    Gelso, S.M

    E.R. Gelso, S.M. Castillo, and J. Armengol. An algorithm based on structural analysis for model-based fault diagnosis. InArtificial Intel- ligence Research and Development. Frontiers in Artificial Intelligence and Applications, volume 184, pages 138–147. IOS Press, 2008

    work page 2008

  10. [10]

    MSO Sets and MTES for Dummies

    Maxence Glotin, Louise Trav ´e-Massuy`es, and Elodie Chanthery. MSO Sets and MTES for Dummies. In35th International Conference on Principles of Diagnosis and Resilient Systems (DX 2024), volume 125 ofOpen Access Series in Informatics (OASIcs), pages 13:1–13:15, Dagstuhl, Germany, 2024

    work page 2024

  11. [11]

    Kay.Fundamentals of Statistical Signal Processing, Volume I: Estimation Theory

    Steven M. Kay.Fundamentals of Statistical Signal Processing, Volume I: Estimation Theory. Prentice Hall, Englewood Cliffs, NJ, USA, 1993

    work page 1993

  12. [12]

    Krysander and E

    M. Krysander and E. Frisk. Sensor placement for fault diagnosis.IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans, 38(6):1398–1410, 2008

    work page 2008

  13. [13]

    A structural algorithm for finding testable sub-models and multiple fault isolability analysis

    Mattias Krysander, Jan ˚Aslund, and Erik Frisk. A structural algorithm for finding testable sub-models and multiple fault isolability analysis. 21st International Workshop on Principles of Diagnosis (DX-10), Port- land, Oregon, USA, 2010

    work page 2010

  14. [14]

    Mattias Krysander, Jan ˚Aslund, and Mattias Nyberg. An efficient algorithm for finding minimal over-constrained sub-systems for model- based diagnosis.IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans, 38(1), 2008

    work page 2008

  15. [15]

    Armengol Llobet, A

    J. Armengol Llobet, A. Bregon, T. Escobet, E. R. Gelso, M. Krysander, M. Nyberg, X. Olive, B. Pulido, and L. Trave-Massuyes. Minimal structurally overdetermined sets for residual generation: A comparison of alternative approaches. InProceedings of IFAC Safeprocess’09, Barcelona, Spain, 2009

    work page 2009

  16. [16]

    A comprehensive observer-based fault isolation method with application to a hydraulic power train

    Sebastian Proell, Fabian Jarmolowitz, and Jan Lunze. A comprehensive observer-based fault isolation method with application to a hydraulic power train. In8th IFAC Symposium on Advances in Automotive Control, Kolm˚arden, Sweden, 2016

    work page 2016

  17. [17]

    Pulido and C

    B. Pulido and C. Alonso-Gonz ´alez. Possible Conflicts: a compilation technique for consistency-based diagnosis.IEEE Trans. on Systems, Man, and Cybernetics. Part B: Cybernetics, 34(5):2192–2206, Octubre 2004

    work page 2004

  18. [18]

    Fault diagnosis based on causal computations.IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans, 42(2):371–381, 2012

    Albert Rosich, Erik Frisk, Jan ˚Aslund, Ramon Sarrate, and Fatiha Nej- jari. Fault diagnosis based on causal computations.IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans, 42(2):371–381, 2012

    work page 2012

  19. [19]

    Carl Sv ¨ard and Mattias Nyberg. Residual generators for fault diagnosis using computation sequences with mixed causality applied to automotive systems.IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans, 40(6):1310–1328, 2010

    work page 2010

  20. [20]

    Trave-Massuyes, T

    L. Trave-Massuyes, T. Escobet, and X. Olive. Diagnosability analysis based on component-supported analytical redundancy relations.IEEE Transaction on Systems, Man, and Cybernetics – Part A, 36(6):1146– 1160, 2006

    work page 2006