Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA'99) Scheduling a Steel Plant with Timed Automata Hong Kong, China December 13-December 15 ISBN: 0-7695-0306-3
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.
Citation:
Ansgar Fehnker, "Scheduling a Steel Plant with Timed Automata," rtcsa, pp.280, Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA'99), 1999 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||