검색결과 : 67건
| No. | Article |
|---|---|
| 1 |
Reduced-Order Observer Design for Boolean Control Networks Zhang ZH, Leifeld T, Zhang P IEEE Transactions on Automatic Control, 65(1), 434, 2020 |
| 2 |
Compositional and Abstraction-Based Approach for Synthesis of Edit Functions for Opacity Enforcement Mohajerani S, Ji YD, Lafortune S IEEE Transactions on Automatic Control, 65(8), 3349, 2020 |
| 3 |
Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems Reveliotis S, Masopust T IEEE Transactions on Automatic Control, 65(7), 2883, 2020 |
| 4 |
Efficient Verification of Observability and Reconstructibility for Large Boolean Control Networks With Special Structures Zhang KZ, Johansson KH IEEE Transactions on Automatic Control, 65(12), 5144, 2020 |
| 5 |
Deep Teams: Decentralized Decision Making With Finite and Infinite Number of Agents Arabneydi J, Aghdam AG IEEE Transactions on Automatic Control, 65(10), 4230, 2020 |
| 6 |
Quantum gate identification: Error analysis, numerical results and optical experiment Wang YL, Yin Q, Dong DY, Qi B, Petersen IR, Hou ZB, Yonezawa H, Xiang GY Automatica, 101, 269, 2019 |
| 7 |
Robust region elimination for piecewise affine control laws Maddalena ET, Galvao RKH, Afonso RJM Automatica, 99, 333, 2019 |
| 8 |
The synthesis problem of decentralized energy systems is strongly NP-hard Goderbauer S, Comis M, Willamowski FJL Computers & Chemical Engineering, 124, 343, 2019 |
| 9 |
The design and scheduling of chemical batch processes: Computational complexity studies de Miranda JL Computers & Chemical Engineering, 121, 367, 2019 |
| 10 |
Minimal Reachability is Hard To Approximate Jadbabaie A, Olshevsky A, Pappas GJ, Tzoumas V IEEE Transactions on Automatic Control, 64(2), 783, 2019 |