A new lower bound for the period of communication sequences of NCS

Periodic communication sequences based method is an effective static scheduling policy of networked control systems (NCSs) with limited communication. The period of communication sequences plays a vital role in the design of controller and scheduling policy: a large period will significantly increase the computing complexity and reduce the feasibility of finding a suitable controller or an optimal communication sequence. In this paper, a lower bound of the period of communication sequences preserving reachability and observability is given, which is less conservative than the existent result and may save computing in getting the optimal sequence and controller.