Adaptive Scheduling of Data Paths using Uppaal Tiga

Abstract

We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a printer. As far as we know, this is the first application of timed automata technology to an industrial scheduling problem with uncertainty in job arrivals

Expected Reachability-Time Games

“…Although the computational complexity of solving games on timed automata is high, UPPAAL Tiga [6] is able to solve practical reachability and safety properties for timed games by using efficient symbolic zone-based algorithms [7,11]. A natural future direction is to investigate the possibility of devising similar algorithms for probabilistic timed games.…”

“…For real-life examples relevant to our setting, see e.g. [11,7]. The reachability-time objectives are a special case of weight or price objectives in which different numbers are assigned to locations, and the value of the objective function depends on the respective numbers and the time spent in the locations; in our setting, the numbers are fixed to be 1 and the objective function simply sums the times spent in for each location.…”

Developing UPPAAL over 15 years

“…Its performance originally comes from zones 3 as a representation for states and the efficient implementation of operators on its canonical data‐structure known as difference‐bound matrix (DBM) 4. Since then the development has been fueled by scientific results on algorithms or new data structures 5–10, academic case‐studies 11–15, industrial case‐studies 16–20, and also teaching 21.…”

Controllers with Minimal Observation Power (Application to Timed Systems)

“…For timed systems, the controller synthesis problem has been first solved in [19] and progress on the algorithm obtained in [9] has made possible the application on examples of a practical interest. This algorithm has been implemented in the Uppaal-Tiga tool [3], and applied to several case studies [1,11,12,21].…”