Symbolic abstractions for the scheduling of event-triggered control systems

In this paper, the problem of scheduling event-triggered networked control systems sharing a communication channel is addressed. Event-triggered control strategies effectively reduce the usage of resources in the implementation of control loops, in particular communication bandwidth. However, there is a lack of a well-established framework to analyze their corresponding communication load and synthesize schedulers. We focus on the case of linear-time-invariant plants and propose a procedure to build a timed automaton that captures the sampling behavior of each event-triggered controller. We show that these timed automata approximately simulate the controllers´ sampling behavior. Finally, a conflict-free scheduling policy is synthesized using timed game automata to guarantee reliable communication in the network.