logo

SCIENCE CHINA Information Sciences, Volume 63 , Issue 11 : 219204(2020) https://doi.org/10.1007/s11432-018-9676-7

Matrix approach to verification and enforcement of nonblockingness for modular discrete-event systems

More info
  • ReceivedOct 9, 2018
  • AcceptedNov 21, 2018
  • PublishedApr 23, 2020

Abstract

There is no abstract available for this article.


Acknowledgment

This work was supported by National Natural Science Foundation of China (Grant No. 61573199) and Tianjin Natural Science Foundation (Grant No. 18JCQNJC74000).


References

[1] Cassandras C, Lafortune S. Introduction to Discrete Event Systems. 2nd ed. New York: Springer, 2008. Google Scholar

[2] Rohloff K, Lafortune S. PSPACE-completeness of Modular Supervisory Control Problems. Discrete Event Dyn Syst Theor Appl, 2005, 15: 145-167 CrossRef Google Scholar

[3] Masopust T. Complexity of Verifying Nonblockingness in Modular Supervisory Control. IEEE Trans Automat Contr, 2018, 63: 602-607 CrossRef Google Scholar

[4] Li H T, Zhao G D, Meng M. A survey on applications of semi-tensor product method in engineering. Sci China Inf Sci, 2018, 61: 010202 CrossRef Google Scholar

[5] Li Y L, Li H T, Sun W W. Event-triggered control for robust set stabilization of logical control networks. Automatica, 2018, 95: 556-560 CrossRef Google Scholar

[6] Xu X R, Hong Y G. Matrix expression and reachability analysis of finite automata. J Control Theor Appl, 2012, 10: 210-215 CrossRef Google Scholar