loading...
Scheduling a Steel Plant with Timed Automata
Hong Kong, China December 13-December 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1999.811256Sixth International Conference on Rea ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ansgar Fehnker, Computing Science Institute Nijmegen
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.