TY - JOUR
T1 - Learning a partially-known discrete event system
AU - Wendell Bates, Ira
AU - Karimoddini, Ali
AU - Karimadini, Mohammad
PY - 2020/1/1
Y1 - 2020/1/1
N2 - There are many cases in which our understanding of a system may be limited due to its complexity or lack of access into the entire system, leaving us with only partial system knowledge. This paper proposes a novel systematic active-learning method for realizing a partially-known Discrete Event System (DES). The proposed technique takes the available information about the system into account by tabularly capturing the known data from the system, and then, discovers the unknown part of the system via an active-learning procedure. For this purpose, a series of tables will be constructed to first infer the information about the system from the available data, and if unavailable, the developed algorithm collects the information through basic queries made to an oracle. It is proven that the developed technique returns a language-equivalent finite-state automaton model for the system under identification after a finite number of iterations. A real-world illustrative example is provided to explain the details of the proposed method.
AB - There are many cases in which our understanding of a system may be limited due to its complexity or lack of access into the entire system, leaving us with only partial system knowledge. This paper proposes a novel systematic active-learning method for realizing a partially-known Discrete Event System (DES). The proposed technique takes the available information about the system into account by tabularly capturing the known data from the system, and then, discovers the unknown part of the system via an active-learning procedure. For this purpose, a series of tables will be constructed to first infer the information about the system from the available data, and if unavailable, the developed algorithm collects the information through basic queries made to an oracle. It is proven that the developed technique returns a language-equivalent finite-state automaton model for the system under identification after a finite number of iterations. A real-world illustrative example is provided to explain the details of the proposed method.
KW - active-learning
KW - automata theory
KW - automotive industries
KW - complex systems
KW - Discrete event systems
KW - manufacturing systems
KW - partially-known systems
KW - systems identification
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85083460029&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85083460029&origin=inward
U2 - 10.1109/ACCESS.2020.2983074
DO - 10.1109/ACCESS.2020.2983074
M3 - Article
SN - 2169-3536
VL - 8
SP - 61806
EP - 61816
JO - IEEE Access
JF - IEEE Access
M1 - 9045950
ER -