Abstract Model-based diagnosis has always been conceived as set-oriented, meaning that a
candidate is a set of faults, or faulty components, that explains a collection of observations …

Abstract Model-based diagnosis of discrete event systems (DESs) is more and more active
in artificial intelligence. However, there has been always a very restrictive assumption in the …

Cyber-physical systems such as autonomous spacecraft, power plants and automotive
systems become more vulnerable to unanticipated failures as their complexity increases …

A finite automaton can be either deterministic (DFA) or nondeterministic (NFA). An
automaton‐based task is in general more efficient when performed with a DFA rather than …

Diagnosis of discrete‐event systems (DESs) is computationally complex. This is why a
variety of knowledge compilation techniques have been proposed, the most notable of them …

Online diagnosis has been considered as an important measure for improving operational
safety in many batch chemical plants. Specifically, the state transition behaviors of all …

The determinization of a nondeterministic finite automaton (FA) is the process of generating
a deterministic FA (DFA) equivalent to (sharing the same regular language of). The …

Generating a deterministic finite automaton (DFA) equivalent to a nondeterministic one
(NFA) is traditionally accomplished by subset-construction (SC). This is the right choice in …

The determinization of a nondeterministic finite automaton (NFA) N is the process of
generating a deterministic finite automaton (DFA) D equivalent to (sharing the same regular …

A mutating finite automaton (MFA) is a nondeterministic finite automaton (NFA) that changes
its morphology over discrete time by a sequence of mutations. This results in a sequence of …