Three methodologies were examined to determine complexity of the Model-based Off-Nominal State Identification and Detection (MONSID) software including straightforward loop counting, comparisons to graph theory, and empirical validation. As predicted by straightforward counting, MONSID fits within O(n4), for nominal data, where n is a representation of some combination of Components, Nodes, and Connections. To support the analysis, different model topologies were defined to reduce coupling among the objects such that their influence could be parameterized. Five different model families were utilized to validate the analysis. Empirical testing has shown that the largest influencers to processing time are Components and the number of Connections. This corresponds with the analysis that compared MONSID Models with traditional graphs where the order is O(Components + Connections).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Complexity Analysis for Model-Based Fault Diagnosis Systems


    Contributors:


    Publication date :

    2019-07-01


    Size :

    507534 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Model-Based Fault Diagnosis of Discrete Event Systems

    Ushio, T. | British Library Online Contents | 1998


    Model-Based Fault Diagnosis Algorithms for Robotic Systems

    Hasan, Agus / Tahavori, Maryamsadat / Midtiby, Henrik Skov | BASE | 2023

    Free access


    Model-based fault diagnosis for aerospace systems: a survey

    Marzat, J / Piet-Lahanier, H / Damongeot, F et al. | SAGE Publications | 2012


    Model-based fault diagnosis for aerospace systems: A survey

    Marzat, J. / Piet-Lahanier, H. / Damongeot, F. et al. | Tema Archive | 2012