DocumentCode
3395133
Title
Scheduling a steel plant with timed automata
Author
Fehnker, Ansgar
Author_Institution
Comput.. Sci. Inst. Nijmegen, Netherlands
fYear
1999
fDate
1999
Firstpage
280
Lastpage
286
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
Keywords
finite automata; formal verification; production control; reachability analysis; real-time systems; scheduling; steel industry; UPPAAL; model checker; reachability; schedulability; scheduling; steel plant; timed automata; Aerospace electronics; Automata; Electrical equipment industry; Information technology; Iron; Job shop scheduling; Process control; Processor scheduling; Real time systems; Steel;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Computing Systems and Applications, 1999. RTCSA '99. Sixth International Conference on
Conference_Location
Hong Kong
Print_ISBN
0-7695-0306-3
Type
conf
DOI
10.1109/RTCSA.1999.811256
Filename
811256
Link To Document