STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS

This paper introduces semi-tensor product of matrices STP, a new matrix analysis tool, into the field of discrete event dynamic system DEDS. Using STP, the dynamics of controlled automaton are modelled as an algebraic expression of the states, events and control specification. Based on this algebraic description, a sufficient and necessary condition is proposed to check whether any two states of a DEDS are reachable or not. The condition suggests an algorithm which can discover all the event strings by which a controlled automaton can move to one state from another one if they are reachable. All the results can be used to analyze corresponding problems of finite automata after simple modification. Finally, illustrative examples examine the correctness of the presented results/algorithm and demonstrate the modification after which the results are suitable for finite automata. The approach of this paper provides a new angle and means to understand and analyze the dynamics of DEDS.

[1]  Daizhan Cheng,et al.  On finite potential games , 2014, Autom..

[2]  Daizhan Cheng,et al.  STABILITY OF SWITCHED POLYNOMIAL SYSTEMS , 2008, J. Syst. Sci. Complex..

[3]  Zengqiang Chen,et al.  Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition , 2014, Frontiers of Computer Science.

[4]  Yuzhen Wang,et al.  A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems , 2012, Autom..

[5]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[6]  Jean-Louis Boimond,et al.  New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems , 2015, Discret. Event Dyn. Syst..

[7]  Yiguang Hong,et al.  Matrix expression and reachability analysis of finite automata , 2012 .

[8]  Stéphane Lafortune,et al.  Robust diagnosis of discrete-event systems against permanent loss of observations , 2013, Autom..

[9]  G. Metze,et al.  Transition Matrices of Sequential Machines , 1959 .

[10]  Zhongxin Liu,et al.  Semi-tensor product approach to controllability and stabilizability of finite automata , 2015 .

[11]  Zengqiang Chen,et al.  Verification analysis of self-verifying automata via semi-tensor product of matrices , 2014 .

[12]  H. Goto,et al.  A lightweight model predictive controller for repetitive discrete event systems , 2011, SICE Annual Conference 2011.

[13]  Daizhan Cheng,et al.  Disturbance Decoupling of Boolean Control Networks , 2011, IEEE Transactions on Automatic Control.

[14]  D. Cheng,et al.  Matrix Expression of Logic and Fuzzy Control , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[15]  Guo-Qiang Zhang,et al.  Automata, Boolean Matrices, and Ultimate Periodicity , 1999, Inf. Comput..

[16]  Alessandro Giua,et al.  Decentralized Diagnosis of Discrete-Event Systems Using Labeled Petri Nets , 2013, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[17]  Umit Ozguner,et al.  Controllability, reachability, stabilizability and state reduction in automata , 1992, Proceedings of the 1992 IEEE International Symposium on Intelligent Control.

[18]  Hong Yiguang,et al.  Observability analysis and observer design for finite automata via matrix approach , 2013 .

[19]  Fangfei Li,et al.  Complete synchronization of temporal Boolean networks , 2013, Neural Networks.

[20]  Zhiwu Li,et al.  Confusion Diagnosis and Control of Discrete Event Systems Using Synchronized Petri Nets , 2013 .

[21]  H. Dhouibi,et al.  Modelling approach for Discrete Event Systems through Petri Nets and Timed Automata , 2013, 2013 International Conference on Control, Decision and Information Technologies (CoDIT).