Scheduling a Steel Plant with Timed Automata

  • Authors:
  • Ansgar Fehnker

  • Affiliations:
  • -

  • Venue:
  • RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.