Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
type: Item
instance of: scholarly article
title: Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches
zbMATH Open document ID: 1478.93382
author: Abderraouf Boussif
author: Mohamed Ghazel
author: J. C. Basilio
published in: Discrete Event Dynamic Systems
publication date: 2021-12-09T00:00:00Z
Mathematics Subject Classification ID: 93C65
Mathematics Subject Classification ID: 93B07
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7441616
zbMATH Keywords: discrete event systems
zbMATH Keywords: automata
zbMATH Keywords: intermittent fault
zbMATH Keywords: diagnosability
describes a project that uses: UMDES
MaRDI profile type: Publication
full work available at URL: s10626-020-00324-y
OpenAlex ID: W3084305799
cites work: Computation of minimal event bases that ensure diagnosability
cites work: Robust diagnosis of discrete event systems against intermittent loss of observations
cites work: Diagnosability of intermittent sensor faults in discrete event systems
cites work: Introduction to Discrete Event Systems
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: Diagnosis of intermittent faults
cites work: Q4385542
cites work: Diagnosability of repairable faults
cites work: Model-based detection of routing events in discrete flow networks
cites work: State observer for DES under partial observation with time Petri nets
cites work: Scaling Algorithms for the Shortest Paths Problem
cites work: Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
cites work: Fault diagnosis in discrete-event systems: Framework and model reduction
cites work: Failure Diagnosis of Discrete-Event Systems With Linear-Time Temporal Logic Specifications
cites work: A polynomial algorithm for testing diagnosability of discrete-event systems
cites work: Finding All the Elementary Circuits of a Directed Graph
cites work: Comments on “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” versus “Decentralized Failure Diagnosis of Discrete Event Systems”: Complexity Clarification
cites work: Diagnosability of discrete event systems and its applications
cites work: On observability of discrete-event systems
cites work: Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
cites work: “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” Versus “Decentralized Failure Diagnosis of Discrete Event Systems”: A Critical Appraisal
cites work: Diagnosability of discrete-event systems
cites work: Q4763563
cites work: Computation of minimal diagnosis bases of discrete-event systems using verifiers
cites work: Control problems in a temporal logic framework
cites work: Diagnosability of stochastic discrete-event systems
cites work: Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
cites work: Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
cites work: Diagnosability Analysis of Discrete Event Systems with Autonomous Components
cites work: Event counting of partially-observed discrete-event systems with uniformly and nonuniformly bounded diagnosis delays
cites work: Polynomial-time verification of diagnosability of partially observed discrete-event systems
cites work: Computation of Diagnosable Fault-Occurrence Indices for Systems With Repeatable Faults
DOI: 10.1007/S10626-020-00324-Y
description: scientific article; zbMATH DE number 7441616