Scheduling a Steel Plant with Timed Automata

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

68 Citations (Scopus)

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 languageEnglish
Title of host publication6th International Conference on Real-Time Computing Systems and Applications 1999
PublisherIEEE Computer Society
Pages280-286
Number of pages7
ISBN (Print)0-7695-0306-3
DOIs
Publication statusPublished - 1999
Externally publishedYes
Event6th International Conference on Real-Time Computing Systems and Applications 1999 - Hong Kong, China
Duration: 13 Dec 199915 Dec 1999
Conference number: 6

Conference

Conference6th International Conference on Real-Time Computing Systems and Applications 1999
Abbreviated titleRTCSA 1999
CountryChina
CityHong Kong
Period13/12/9915/12/99

Fingerprint Dive into the research topics of 'Scheduling a Steel Plant with Timed Automata'. Together they form a unique fingerprint.

Cite this