Global and local consistencies in distributed fault diagnosis for discrete-event systems

Su, Rong; Wonham, W. M.

doi:10.1109/tac.2005.860291

Cited by 134 publications

(47 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The connection with related ideas in the literature, e.g., constraint satisfaction problems (Collin et al, 1991;Zhang and Mackworth, 1991;Yokoo et al, 1998;Beeri et al, 1983;Fagin, 1983), was discussed in Su and Wonham (2005). The present paper focuses on global consistency, as captured by the equilibrium concept of supremal global support (Su and Wonham, 2005). To achieve this equilibrium, an algorithm called Computational Procedure for Global Consistency (GPGC) was proposed (Su and Wonham, 2005).…”

Section: )mentioning

confidence: 96%

“…Two types of consistency were introduced in Su and Wonham (2005): local consistency and global consistency. The connection with related ideas in the literature, e.g., constraint satisfaction problems (Collin et al, 1991;Zhang and Mackworth, 1991;Yokoo et al, 1998;Beeri et al, 1983;Fagin, 1983), was discussed in Su and Wonham (2005). The present paper focuses on global consistency, as captured by the equilibrium concept of supremal global support (Su and Wonham, 2005).…”

Section: )mentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Fault Diagnosis for Discrete-Event Systems under Global Consistency

Wonham

2006

Discrete Event Dyn Syst

Self Cite

View full text Add to dashboard Cite

In previous work the authors proposed a distributed diagnosis approach consisting of two phases-preliminary diagnosis in each local diagnoser and interdiagnoser communication. The objective of communication is to achieve either global or local consistency among local diagnoses, where global consistency is captured by the equilibrium concept of supremal global support. To achieve this equilibrium, an algorithm called Computational Procedure for Global Consistency (CPGC) was proposed. But it turns out that CPGC has high time complexity and weak scalability. To rectify these shortcomings, we propose a hierarchical computational procedure. A further advantage of this procedure is demonstrated, based on multiresolutional diagnosis. With the latter, fault detection is conducted at each hierarchical level, so that computation can be confined to those modules likely to possess faults, while fault-free modules are safely disregarded. A simplified industrial example is provided in illustration.

show abstract

Section: )mentioning

confidence: 96%

Section: )mentioning

confidence: 99%

Hierarchical Fault Diagnosis for Discrete-Event Systems under Global Consistency

Wonham

2006

Discrete Event Dyn Syst

Self Cite

View full text Add to dashboard Cite

show abstract

“…The graph of constraints between the fault hypotheses and the observations is partitioned to minimize communication between local diagnosers. A similar approach is presented in [14], where the partitioning is based on physical connections.…”

Section: Related Workmentioning

confidence: 99%

Designing Distributed Diagnosers for Complex Continuous Systems

Roychoudhury

Biswas

Koutsoukos

2009

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Abstract-Wear and tear from sustained operations cause systems to degrade and develop faults. Online fault diagnosis schemes are necessary to ensure safe operation and avoid catastrophic situations, but centralized diagnosis approaches have large memory and communication requirements, scale poorly, and create single points of failure. To overcome these problems, we propose an online, distributed, model-based diagnosis scheme for isolating abrupt faults in large continuous systems. This paper presents two algorithms for designing the local diagnosers and analyzes their time and space complexity. The first algorithm assumes the subsystem structure is known and constructs a local diagnoser for each subsystem. The second algorithm creates a partition structure and local diagnosers simultaneously. We demonstrate the effectiveness of our approach by applying it to the Advanced Water Recovery System developed at the NASA Johnson Space Center.Note to Practitioners-Fault detection, isolation, and recovery approaches are important for maintaining performance and safety in large safety-critical systems, such as the Advanced Life Support (ALS) System for future long-duration NASA manned missions that we present in this paper. These systems consist of a number of complex, interacting, spatially-distributed subsystems. Centralized model-based diagnosis approaches are expensive in memory and communication requirements, and they create single points of failure. Previous distributed diagnosis approaches apply to discrete event system models, but these approaches become computationally intractable when applied to complex continuous systems. This paper develops a systematic modelbased approach to distributing the diagnosis task by designing multiple diagnosers that operate independently and generate globally correct diagnoses. We present a complete approach that includes a topological modeling scheme for constructing the dynamic system models, algorithms for constructing the distributed diagnosers, and a systematic methodology for deriving efficient subsystem diagnosis using these diagnosers. We then demonstrate the applicability of this approach to the ALS system.

show abstract

“…Although the idea of aggregation has been used in, e.g. [25] [21] [15] [20], their abstraction techniques are different from ours. This paper is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

Aggregative Synthesis of Distributed Supervisors Based on Automaton Abstraction

Schuppen

Rooda

2010

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

Achieving nonblockingness in supervisory control imposes a major challenge when the number of states of a target system is large, often owing to synchronous product of many relatively small local components. To overcome this difficulty, in this paper we first present a distributed supervisory control problem, then provide an aggregative synthesis approach that computes nonblocking distributed supervisors. The key to the success of this approach is a newly developed automaton abstraction technique, that removes irrelevant internal transitions at each synthesis stage so that nonblocking supervisor synthesis can be carried out on relatively small abstracted models.

show abstract

Global and local consistencies in distributed fault diagnosis for discrete-event systems

Cited by 134 publications

References 23 publications

Hierarchical Fault Diagnosis for Discrete-Event Systems under Global Consistency

Hierarchical Fault Diagnosis for Discrete-Event Systems under Global Consistency

Designing Distributed Diagnosers for Complex Continuous Systems

Aggregative Synthesis of Distributed Supervisors Based on Automaton Abstraction

Contact Info

Product

Resources

About