The Complexity of Codiagnosability for Discrete Event and Timed Systems

DOI10.1109/TAC.2012.2183169zbMath1369.93374MaRDI QIDQ5352876

Franck Cassez

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

System identification (93B30) Discrete event control/observation systems (93C65)

Related Items (10)

Verification complexity of a class of observational properties for modular discrete events systems ⋮ Decentralized diagnosis of discrete event systems subject to permanent sensor failures ⋮ Codiagnosability and coobservability under dynamic observations: transformation and verification ⋮ Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ Computation of the delay bounds and synthesis of diagnosers for decentralized diagnosis with conditional decisions ⋮ Implementation of inference-based diagnosis: computing delay bound and ambiguity levels ⋮ Decentralized fault diagnosis approach without a global model for fault diagnosis of discrete event systems ⋮ Diagnosability verification using LTL model checking ⋮ Detectability of labeled weighted automata over monoids

This page was built for publication: The Complexity of Codiagnosability for Discrete Event and Timed Systems