Learning a Partially-Known Discrete Event System
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 Syste...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9045950/ |
id |
doaj-c6ecbf4ec45d412daf26944eabb69457 |
---|---|
record_format |
Article |
spelling |
doaj-c6ecbf4ec45d412daf26944eabb694572021-03-30T03:07:30ZengIEEEIEEE Access2169-35362020-01-018618066181610.1109/ACCESS.2020.29830749045950Learning a Partially-Known Discrete Event SystemIra Wendell Bates0Ali Karimoddini1https://orcid.org/0000-0001-6084-6831Mohammad Karimadini2North Carolina A&T State University, Greensboro, NC, USANorth Carolina A&T State University, Greensboro, NC, USADepartment of Electrical Engineering, Arak University of Technology, Arak, IranThere 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.https://ieeexplore.ieee.org/document/9045950/Discrete event systemspartially-known systemsactive-learningcomplex systemssystems identificationautomata theory |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ira Wendell Bates Ali Karimoddini Mohammad Karimadini |
spellingShingle |
Ira Wendell Bates Ali Karimoddini Mohammad Karimadini Learning a Partially-Known Discrete Event System IEEE Access Discrete event systems partially-known systems active-learning complex systems systems identification automata theory |
author_facet |
Ira Wendell Bates Ali Karimoddini Mohammad Karimadini |
author_sort |
Ira Wendell Bates |
title |
Learning a Partially-Known Discrete Event System |
title_short |
Learning a Partially-Known Discrete Event System |
title_full |
Learning a Partially-Known Discrete Event System |
title_fullStr |
Learning a Partially-Known Discrete Event System |
title_full_unstemmed |
Learning a Partially-Known Discrete Event System |
title_sort |
learning a partially-known discrete event system |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
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. |
topic |
Discrete event systems partially-known systems active-learning complex systems systems identification automata theory |
url |
https://ieeexplore.ieee.org/document/9045950/ |
work_keys_str_mv |
AT irawendellbates learningapartiallyknowndiscreteeventsystem AT alikarimoddini learningapartiallyknowndiscreteeventsystem AT mohammadkarimadini learningapartiallyknowndiscreteeventsystem |
_version_ |
1724184021357821952 |