Scheduling a Steel Plant with Timed Automata

Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using UPPAAL, a model checker for networks of timed automata. We show how to translate schedulability to reachability, enabling us to use UPPAAL's model checking algorithms.

• Type: Conference
• Year: 1999
• Where: RTCSA
• Authors: Ansgar Fehnker
• Keywords: Embedded Systems, Hard Problem, Integrated Steel Plant, Model Checking Algorithms, RTCSA 1999