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.
Original language | English |
---|---|
Title of host publication | 6th International Conference on Real-Time Computing Systems and Applications 1999 |
Publisher | IEEE |
Pages | 280-286 |
Number of pages | 7 |
ISBN (Print) | 0-7695-0306-3 |
DOIs | |
Publication status | Published - 1999 |
Externally published | Yes |
Event | 6th International Conference on Real-Time Computing Systems and Applications 1999 - Hong Kong, China Duration: 13 Dec 1999 → 15 Dec 1999 Conference number: 6 |
Conference
Conference | 6th International Conference on Real-Time Computing Systems and Applications 1999 |
---|---|
Abbreviated title | RTCSA 1999 |
Country/Territory | China |
City | Hong Kong |
Period | 13/12/99 → 15/12/99 |