Name
Abstract | ||
|---|---|---|
This article investigates observability of Boolean control networks (BCNs) and probabilistic Boolean networks (PBNs). First, weak observability of BCNs is discussed via the nonaugmented approach. The obtained result is then applied to determine (asymptotic) observability of PBNs. Finally, complexity of algorithms based on new criteria is analyzed. Compared with existing ones, time and space complexity do not get worse, even are improved under some mild conditions. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TAC.2021.3131436 | IEEE Transactions on Automatic Control |
Keywords | DocType | Volume |
Boolean control network (BCN),nonaugmented method,observability,probabilistic Boolean network (PBN) | Journal | 67 |
Issue | ISSN | Citations |
11 | 0018-9286 | 0 |
PageRank | References | Authors |
0.34 | 27 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongyuan Yu | 1 | 0 | 0.34 |
| Min Meng | 2 | 72 | 8.30 |
| Jun-e Feng | 3 | 8 | 5.84 |
| Ge Chen | 4 | 22 | 7.36 |