Fixing Nondeterminism in Large Discrete-Event Knowledge

Discrete-event knowledge (DEK) consists in a variety of automaton-based data structures which are generated by knowledge-based and engineering systems, including intelligent diagnosis systems. Model-based methods for discrete-event systems (DESs) typically supported large automata that allow the efficient generation candidate diagnoses when DES is being operated. However, DEK may involve determinization step, where nondeterministic finite automaton (NFA) transformed into an equivalent deterministic (DFA) means classical Subset Construction algorithm. When this performed online NFA large, engine slow down to such extent entire task jeopardized. This why novel algorithm proposed, called Quick Construction, which, instead generating from scratch DFA, removes nondeterminism operating directly on NFA. way, larger smaller portion involved, faster will be over Construction. Massive experimentation has confirmed result empirically.