Online modeling refinement for discrete event systems

Chung, Sheng‐Luen; Wu, Jun‐Chin; Li, Chung‐Lun; Chen, Wenyuan

doi:10.1080/02533839.2005.9670985

Cited by 4 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To further minimize this four-state machine, we are to find the associated maximal compatible sets from Table 6. [4,6] CD = [4,6]; [3,8] Step 12. Two minimal realization solutions corresponding to the two closed coverings are found, as shown in Fig.…”

Section: Solutionmentioning

confidence: 99%

“…Compare each NB k with all B k , and classify it according to the condition (a, b or c) it meets. Renumber the resultant blocks of and B −l : [2,6,7]; [3,8] →B…”

Section: Solutionmentioning

confidence: 99%

“…MVA is important not only to the solution of system identification problem, it is also important to the characterization of the complexity of information embedded in a sample path, as well as to the online modeling refinement problem and [3]. In this regard, this paper serves as a tutorial on the solution of Minimal Valid Automata by a detailed algorithm and a comprehensive coverage of an example.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Minimal Valid Automata of Sample Sequences for Discrete Event Systems

Chung

2004

Asian Journal of Control

View full text Add to dashboard Cite

Minimal valid automata (MVA) refer to valid automata models that fit a given input-output sequence sample from a Mealy machine model. They are minimal in the sense that the number of states in these automata is minimal. Critical to system identification problems of discrete event systems, MVA can be considered as a special case of the minimization problem for incompletely specified sequential machine (ISSM). While the minimization of ISSM in general is an NP-complete problem, various approaches have been proposed to alleviate computational requirement by taking special structural properties of the ISSM at hand. In essence, MVA is to find the minimal realization of an ISSM where each state only has one subsequent state transition defined. This paper presents an algorithm that divides the minimization process into two phases: first to give a reduced machine for the equivalent sequential machine, and then to minimize the reduced machine into minimal realization solutions. An example with comprehensive coverage on how the associated minimal valid automata are derived is also included.

show abstract

Section: Solutionmentioning

confidence: 99%

“…Compare each NB k with all B k , and classify it according to the condition (a, b or c) it meets. Renumber the resultant blocks of and B −l : [2,6,7]; [3,8] →B…”

Section: Solutionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation