Finite abstractions of networked control systems

In networked control systems (NCS), the communication between sensors, controllers, and actuators is supported by a shared communication channel that is subject to variable communication delays, limited bandwidth, packet losses, quantization errors, and other practical non-idealities. This work investigates the problem of constructively deriving symbolic models of NCS by simultaneously considering the mentioned network non-idealities. By employing the obtained symbolic models, one can completely automate the design of controllers enforcing rich logical specifications, e.g. formulae in linear temporal logic, over NCS.