Intermittent Fault Diagnosis as Discrete Signal Estimation: Trackability analysis
06 Jan 2018-Vol. 4, pp 234-247
TL;DR: An estimation approach based on constrained optimization using conditional preference theories is proposed, and it is shown that in some cases, the estimator can fail to find an estimation for the system.
Abstract: We address the problem of intermittent fault diagnosis as an instance of discrete signal estimation, in the context of fault management in autonomous systems and autonomous vehicles. We propose an estimation approach based on constrained optimization using conditional preference theories. We show that in some cases, our estimator can fail to find an estimation for the system. We provide a way to detect and eliminate these cases at design time.
Citations
More filters
19 May 2018
TL;DR: This paper addresses the detection of intermittent and permanent faults in discrete event systems with the rich semantic model-checker ELECTRUM and presents a logic based modeling approach associated with conditional preferences to produce a single diagnosis at each time step.
Abstract: In this paper we consider the diagnosis of intermittent and permanent faults in discrete event systems. We present a logic based modeling approach associated with conditional preferences in order to produce a single diagnosis at each time step. Like all incomplete diagnosis approaches, ours is subject to deadlocks between the system and its diagnoser. In this paper, we address the detection of such deadlocks at design time with the rich semantic model-checker ELECTRUM.
7 citations
Cites background from "Intermittent Fault Diagnosis as Dis..."
...In [5], the same authors propose to detect deadlock scenarios between a system and its diagnoser by an iterative model-checking approach but this approach is difficult to implement and no associated experimentations are provided....
[...]
01 Nov 2018
TL;DR: This paper describes the Robot System Onboard Architecture (RSOA) software developed in the SWARMs project for the achievement of offshore maritime operations and implements high level capabilities in a semiautonomous or autonomous manner, and is deployed at a lower level on a heterogeneous swarm of vehicles.
Abstract: Autonomous systems face the challenge of managing disruptive events such as internal alterations, mission updates and environmental perturbations that always occur in an operational context. Autonomous vehicles must embed the capabilities to supervise their behaviour and to detect and react to such events. The complexity increases with the heterogeneity of vehicles in the team and the communication constraints. This paper describes the Robot System Onboard Architecture (RSOA) software developed in the SWARMs project for the achievement of offshore maritime operations. This generic and modular architecture implements high level capabilities in a semiautonomous or autonomous manner, and is deployed at a lower level on a heterogeneous swarm of vehicles. Target vehicles include autonomous and teleoperated underwater vehicles, and surface vehicles. Simulation and experimentations achieved on the Black Sea in Romania (July 2017) then in the Trondheim fjord in Norway (June 2018) highlighted the good performance of the RSOA.
5 citations
Proceedings Article•
08 May 2019TL;DR: This work proposes a method for detecting dead-end scenarios, introduces preference relaxation, and applies a consistency-based meta-diagnosis approach for identifying the sets of "faulty'' preferences for a given dead- end scenario.
Abstract: In autonomous systems, planning and decision making rely on the estimation of the system state across time. In this work, we use a preference model to implement a fault management strategy that selects a unique estimated state at each time point. If this strategy is not carefully designed, it can lead to incomplete estimators that meet a dead-end in some scenarios. Our goal is to detect such scenarios at design time and to be able to blame a subset of preferences causing them; those can be proposed to the designer for revision. To do so, we propose a method for detecting dead-end scenarios, introduce preference relaxation, and apply a consistency-based meta-diagnosis approach for identifying the sets of "faulty'' preferences for a given dead-end scenario. We build upon SAT solvers for checking estimator incompleteness, and for consistency checking during meta-diagnosis.
2 citations
Cites background or methods from "Intermittent Fault Diagnosis as Dis..."
...We use SAT model enumeration [10] to produce all the observation sequences consistent with the behavioural model of a fixed length k and we apply preferences with an existing estimator implementation based on MAX-SAT [13]....
[...]
...In [13] and [2], the authors define an estimation framework composed of two parts: (1) a behavorial model (represented by logical constraints) that constrains the possible explanations for a given observed scenario, and (2) a fault management strategy (represented by a conditional preference model) that specifies which estimation is to be preferred, and under which conditions....
[...]
01 Jan 2021
TL;DR: In this paper, a preference model is used to provide non-ambiguous estimates at each time point, and a consistency-based meta-diagnosis strategy based on preference relaxation is applied.
Abstract: In autonomous systems, planning and decision making rely on the estimation of the system state across time, i.e., state tracking. In this work, a preference model is used to provide non-ambiguous estimates at each time point. However, this strategy can lead to dead ends. Our goal is to anticipate dead ends at design time and to blame root cause preferences, so that these preferences can be revised. To do so, we present the preference-based state estimation approach and we apply a consistency-based meta-diagnosis strategy based on preference relaxation. We evaluate our approach on a robotic functional architecture benchmark.
TL;DR: In this article , Lin et al. proposed a fast intermittent fault probabilistic diagnosis algorithm FIFPDPMC to identify the nodes with intermittent fault in the 2D split-star network.
Abstract: With the rapid increase of the number of processors in multiprocessor systems and the fast expansion of interconnection networks, the reliability of interconnection network is facing severe challenges, where the fast recognition of fault processors is crucial. In practice, most of the processor failures are intermittent faults. In this article, we first determine the intermittent fault diagnosability $t_{I}^{PMC}(S_{n}^{2})$ t I P M C ( S n 2 ) $n$ n $S_{n}^{2}$ S n 2 $n$ n $S_{n}^{2}$ S n 2
References
More filters
02 Jan 1991
TL;DR: In this article, a multiaxis classification of temporal and modal logic is presented, and the formal syntax and semantics for two representative systems of propositional branching-time temporal logics are described.
Abstract: Publisher Summary This chapter discusses temporal and modal logic. The chapter describes a multiaxis classification of systems of temporal logic. The chapter describes the framework of linear temporal logic. In both its propositional and first-order forms, linear temporal logic has been widely employed in the specification and verification of programs. The chapter describes the competing framework of branching temporal logic, which has seen wide use. It also explains how temporal logic structures can be used to model concurrent programs using non-determinism and fairness. The chapter also discusses other modal and temporal logics in computer science. The chapter describes the formal syntax and semantics of Propositional Linear Temporal Logic (PLTL). The chapter also describes the formal syntax and semantics for two representative systems of propositional branching-time temporal logics.
2,871 citations
TL;DR: The approach to failure diagnosis presented in this paper is applicable to systems that fall naturally in the class of DES's; moreover, for the purpose of diagnosis, most continuous variable dynamic systems can be viewed as DES's at a higher level of abstraction.
Abstract: Fault detection and isolation is a crucial and challenging task in the automatic control of large complex systems We propose a discrete-event system (DES) approach to the problem of failure diagnosis We introduce two related notions of diagnosability of DES's in the framework of formal languages and compare diagnosability with the related notions of observability and invertibility We present a systematic procedure for detection and isolation of failure events using diagnosers and provide necessary and sufficient conditions for a language to be diagnosable The diagnoser performs diagnostics using online observations of the system behavior; it is also used to state and verify off-line the necessary and sufficient conditions for diagnosability These conditions are stated on the diagnoser or variations thereof The approach to failure diagnosis presented in this paper is applicable to systems that fall naturally in the class of DES's; moreover, for the purpose of diagnosis, most continuous variable dynamic systems can be viewed as DES's at a higher level of abstraction >
1,599 citations
"Intermittent Fault Diagnosis as Dis..." refers background in this paper
...This notion is similar in intent to the concept of diagnosability introduced in [13], where a permanent fault is diagnosable when an observer can deduce its occurrence after a bounded delay....
[...]
Journal Article•
TL;DR: The NuSMV tool as mentioned in this paper is a symbolic model checker developed at CMU and designed to be applicable in technology transfer projects, it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards.
Abstract: This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model checker originated from the reengineering, reimplementation and extension of SMV, the original BDD-based model checker developed at CMU [15]. The NuSMV project aims at the development of a state-of-the-art symbolic model checker, designed to be applicable in technology transfer projects: it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards [6].
1,377 citations
01 Jan 2009
TL;DR: This article surveys a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques, and is widely perceived as a complementary technique to BDD-based model checking.
Abstract: Besides Equivalence Checking [KK97, KPKG02] the most important industrial application of SAT is currently Bounded Model Checking (BMC) [BCCZ99]. Both techniques are used for formal hardware verification in the context of electronic design automation (EDA), but have successfully been applied to many other domains as well. In this chapter, we focus on BMC. In practice, BMC is mainly used for falsification resp. testing, which is concerned with violations of temporal properties. However, the original paper on BMC [BCCZ99] already discussed extensions that can prove properties. A considerable part of this chapter discusses these complete extensions, which are often called “unbounded” model checking techniques, even though they are build upon the same principles as plain BMC. Two further related applications, in which BMC becomes more and more important, are automatic test case generation for closing coverage holes, and disproving redundancy in designs. Most of the techniques discussed in this chapter transfer to this more general setting as well, even though our focus is on property verification resp. falsification. The basic idea of BMC is to represent a counterexample-trace of bounded length symbolically and check the resulting propositional formula with a SAT solver. If the formula is satisfiable and thus the path feasible, a satisfying assignment returned by the SAT solver can be translated into a concrete counterexample trace that shows that the property is violated. Otherwise, the bound is increased and the process repeated. Complete extensions to BMC allow to stop this process at one point, with the conclusion that the property cannot be violated, hopefully before the available resources are exhausted.
689 citations
"Intermittent Fault Diagnosis as Dis..." refers background in this paper
...While our approach will ultimately find deadlocks if they exist, proving an estimation model is deadlock free can only be done on finite horizons with bounded model-checking [15], unless the model-checker handles the estimator’s transition function, which is unlikely on realistic examples....
[...]
TL;DR: A perspective on knowledge compilation is proposed which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime.
Abstract: We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We then provide a knowledge compilation map, which analyzes a large number of existing target compilation languages according to their succinctness and their polytime transformations and queries. We argue that such analysis is necessary for placing new compilation approaches within the context of existing ones. We also go beyond classical, flat target compilation languages based on CNF and DNF, and consider a richer, nested class based on directed acyclic graphs (such as OBDDs), which we show to include a relatively large number of target compilation languages.
689 citations
Additional excerpts
...While the scalability problems of BDDs are well known, in the case of QBF, the difficulty resides mainly in normalizing of the formulas into QCNF....
[...]
...Experiments with BDDs [10], or QBF [11] failed to scale up to moderately complex examples....
[...]