Please use this identifier to cite or link to this item:
|Title:||Computation for supremal simulation-based controllable subautomata||Authors:||Sun, Y.
|Issue Date:||2010||Citation:||Sun, Y.,Lin, H.,Liu, F.,Chen, B.M. (2010). Computation for supremal simulation-based controllable subautomata. 2010 8th IEEE International Conference on Control and Automation, ICCA 2010 : 1450-1455. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCA.2010.5524261||Abstract:||Bisimulation relation as a well known equivalence relation has been successfully applied to computer science and control theory. In our previous work, we proposed the existence of bisimilarity supervisor by introducing simulation-based controllability. As a continuation, this paper deals with the computation for the supremal simulation-based controllable subautomata with respect to given specifications by lattice theory. In order to achieve the supremal solution, two monotone operators, namely simulation operator and controllable operator, are built upon the established complete lattice, and then we set up the inequalities, whose solutions are simulation-based controllable state pairs. In particular, a sufficient condition is provided to guarantee the existence of supremal simulation-based controllable subautomata. Furthermore, an algorithm is presented for the computation of such subautomata. © 2010 IEEE.||Source Title:||2010 8th IEEE International Conference on Control and Automation, ICCA 2010||URI:||http://scholarbank.nus.edu.sg/handle/10635/69679||ISBN:||9781424451951||DOI:||10.1109/ICCA.2010.5524261|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 19, 2019
checked on Aug 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.