Efficiently detecting lack of robustness in finite alphabet logistic networks

This paper is concerned with the problem of verifying robust control invariance and global attractivity in finite alphabet logistic networks. We propose a systematic, computationally efficient scheme to identify instances where robustly control invariant sets and robustly globally attractive sets fail to exist. We provide an illustrative numerical example, demonstrating our approach and the corresponding improvement in computation time.