Similarity-Based Supervisory Control of Discrete-Event Systems
Y. Cao, и M. Ying. Automatic Control, IEEE Transactions on, 51 (2):
325--330(2006)
Аннотация
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<tex>\$ lambda \$</tex>-controllability, where<tex>\$ lambda \$</tex>indicates the similarity degree of two languages. A necessary and sufficient condition for a language to be<tex>\$ lambda \$</tex>-controllable is provided. We then examine some properties of<tex>\$ lambda \$</tex>-controllable languages and present an approach to optimizing a realization.
%0 Journal Article
%1 citeulike:543593
%A Cao, Y.
%A Ying, M.
%D 2006
%J Automatic Control, IEEE Transactions on
%K citeulike deadlock, nets, petri, petri-nets, petrinets, supervisory
%N 2
%P 325--330
%T Similarity-Based Supervisory Control of Discrete-Event Systems
%U http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1593909
%V 51
%X 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<tex>\$ lambda \$</tex>-controllability, where<tex>\$ lambda \$</tex>indicates the similarity degree of two languages. A necessary and sufficient condition for a language to be<tex>\$ lambda \$</tex>-controllable is provided. We then examine some properties of<tex>\$ lambda \$</tex>-controllable languages and present an approach to optimizing a realization.
@article{citeulike:543593,
abstract = {{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<tex>\$ lambda \$</tex>-controllability, where<tex>\$ lambda \$</tex>indicates the similarity degree of two languages. A necessary and sufficient condition for a language to be<tex>\$ lambda \$</tex>-controllable is provided. We then examine some properties of<tex>\$ lambda \$</tex>-controllable languages and present an approach to optimizing a realization.}},
added-at = {2017-09-08T10:52:59.000+0200},
author = {Cao, Y. and Ying, M.},
biburl = {https://www.bibsonomy.org/bibtex/206d749c7ac6a8ffc83f0878ac32df762/fernand0},
citeulike-article-id = {543593},
citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1593909},
interhash = {6ad0b774de0c1ce39c2719c28c80acc7},
intrahash = {06d749c7ac6a8ffc83f0878ac32df762},
journal = {Automatic Control, IEEE Transactions on},
keywords = {citeulike deadlock, nets, petri, petri-nets, petrinets, supervisory},
number = 2,
pages = {325--330},
posted-at = {2006-03-10 09:56:38},
priority = {2},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{Similarity-Based Supervisory Control of Discrete-Event Systems}},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1593909},
volume = 51,
year = 2006
}