期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 62, 期 11, 页码 5902-5908出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2016.2644640
关键词
Automaton; discrete event systems; observability; supervisory control; supremal sublanguage
资金
- Brazilian Research Council (CNPq) [310980/2013-5]
In this technical note, we present a new property of relative observability, and based on this property, we propose two algorithms: the first one, that has polynomial complexity, verifies if a regular language is relatively observable; the second algorithm computes the supremal relatively observable sublanguage of a given regular language. Although the latter has exponential complexity, it is more efficient than a recently proposed algorithm, which has double exponential complexity. Moreover, the algorithm proposed here has polynomial complexity when the automaton that marks the specification language is state partition.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据