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 effective 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.
@InProceedings{tolonen_et_al:LIPIcs.TIME.2018.22, author = {Tolonen, Lewis and French, Tim and Reynolds, Mark}, title = {{Population Based Methods for Optimising Infinite Behaviours of Timed Automata}}, booktitle = {25th International Symposium on Temporal Representation and Reasoning (TIME 2018)}, pages = {22:1--22:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-089-7}, ISSN = {1868-8969}, year = {2018}, volume = {120}, editor = {Alechina, Natasha and N{\o}rv\r{a}g, Kjetil and Penczek, Wojciech}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2018.22}, URN = {urn:nbn:de:0030-drops-97875}, doi = {10.4230/LIPIcs.TIME.2018.22}, annote = {Keywords: Timed Automata, Heuristic Search, Ant Colony Optimisation} }
Feedback for Dagstuhl Publishing