Abstract
Timed automata are powerful models for the analysis of real time systems. The optimal infinite scheduling problem for double-priced timed automata is concerned with finding infinite runs of a system whose long term cost to reward ratio is minimal. Due to the state-space explosion occurring when discretising a timed automaton, exact computation of the optimal infinite ratio is infeasible. This paper describes the implementation and evaluation of ant colony optimisation for approximating the optimal schedule for a given double-priced timed automaton. The application of ant colony optimisation to the corner-point abstraction of the automaton proved generally less e ective than a random method. The best found optimisation method was obtained by formulating the choice of time delays in a cycle of the automaton as a linear program and utilizing ant colony optimisation in order to determine a sequence of profitable discrete transitions comprising an infinite behaviour.
Original language | English |
---|---|
Title of host publication | 25th International Symposium on Temporal Representation and Reasoning, TIME 2018 |
Editors | Wojciech Penczek, Kjetil Norvag, Natasha Alechina |
Place of Publication | Netherlands |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Chapter | 22 |
Pages | 1-22 |
Volume | 120 |
ISBN (Electronic) | 9783959770897 |
DOIs | |
Publication status | Published - 1 Oct 2018 |
Event | 25th International Symposium on Temporal Representation and Reasoning, TIME 2018 - Warsaw, Poland Duration: 15 Oct 2018 → 17 Oct 2018 |
Conference
Conference | 25th International Symposium on Temporal Representation and Reasoning, TIME 2018 |
---|---|
Country/Territory | Poland |
City | Warsaw |
Period | 15/10/18 → 17/10/18 |