As the use of Networked Control Systems increases, the need for control methods with more efficient network usage also grows. These methods require a more sophisticated way of pre- dicting their traffic, and an approach for this is using a formal modelling approach using Timed Au
...
As the use of Networked Control Systems increases, the need for control methods with more efficient network usage also grows. These methods require a more sophisticated way of pre- dicting their traffic, and an approach for this is using a formal modelling approach using Timed Automata. Timed Automata have been used for over 25 years for several scheduling problems, but have not been adopted by the control systems community for scheduling event- triggered systems. This is a recent development for which no easy to use software tools have been developed, and performance in real-world applications is yet untested.
In this master thesis, an existing approach for scheduling event-triggered controllers is implemented in a set of tools. This approach creates abstractions of communication traffic, models them as timed automata and finds a scheduler avoiding communication conflicts. This set of tools is used to test the scalability with respect to abstraction accuracy and number of systems that can be connected. The set of tools can be used in the future to further improve on the techniques used.
