Name
Title | ||
|---|---|---|
New algorithms for verification of relative observability and computation of supremal relatively observable sublanguage. |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TAC.2016.2644640 | IEEE Trans. Automat. Contr. |
Keywords | DocType | Volume |
Observability,Automata,Partitioning algorithms,Computational complexity,Indexes,Supervisory control | Journal | 62 |
Issue | ISSN | Citations |
11 | 0018-9286 | 1 |
PageRank | References | Authors |
0.38 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcos Vinícius Silva Alves | 1 | 8 | 2.86 |
| Lilian K. Carvalho | 2 | 57 | 6.84 |
| JoãO C. Basilio | 3 | 151 | 15.63 |
| Joao C. Basilio | 4 | 1 | 0.38 |