Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study

DOI10.1109/TAC.2013.2275892MaRDI QIDQ5353429zbMATH OpenOpenAlexFDO

Authors Alban Grastien, Anbu Anbulagan

Publication date 8 September 2017

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

Full work available at URL https://doi.org/10.1109/tac.2013.2275892

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65)

Cited in

(9)

• EDEN: An intelligent software environment for diagnosis of discrete-event systems
• Diagnosability verification using LTL model checking
• Computation of minimal diagnosis bases of discrete-event systems using verifiers
• Cardinality networks: a theoretical and empirical study
• AI*IA 2005: Advances in Artificial Intelligence
• Diagnosing discrete-event systems: Extending the ``diagnoser approach to deal with telecommunication networks
• Critical observations in model-based diagnosis
• Diagnosis and supervision: model-based approaches
• Answer set planning: a survey

This page was built for publication: Diagnosis of Discrete Event Systems Using Satisfiability Algorithms: A Theoretical and Empirical Study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353429)