Similarity-Based Supervisory Control of Discrete Event Systems
| dc.creator | Cao, Yongzhi | |
| dc.creator | Ying, Mingsheng | |
| dc.date | 2004-10-14 | |
| dc.date | 2005-03-31 | |
| dc.date.accessioned | 2026-07-07T06:34:10Z | |
| dc.date.available | 2026-07-07T06:34:10Z | |
| dc.description | Due to the appearance of uncontrollable events in discrete event systems, one may wish to replace the behavior leading to the uncontrollability of pre-specified language by some quite similar one. To capture this similarity, we introduce metric to traditional supervisory control theory and generalize the concept of original controllability to $\ld$-controllability, where $\ld$ indicates the similarity degree of two languages. A necessary and sufficient condition for a language to be $\ld$-controllable is provided. We then examine some properties of $\ld$-controllable languages and present an approach to optimizing a realization. | |
| dc.description | 22 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0410031 | |
| dc.identifier | http://arxiv.org/abs/cs/0410031 | |
| dc.identifier | A short version has been published in the IEEE Transactions on Automatic Control, 51(2), pp. 325-330, February 2006. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/99439 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | B.1; I.6.8 | |
| dc.title | Similarity-Based Supervisory Control of Discrete Event Systems | |
| dc.type | text |