Population based methods for optimising infinite behaviours of timed automata

DOI10.4230/LIPICS.TIME.2018.22MaRDI QIDQ5079791zbMATH OpenFDO

Authors Lewis Tolonen, Tim French, Mark Alexander Reynolds

Publication date 28 May 2022

Full work available at URL https://doi.org/10.4230/LIPICS.TIME.2018.22

zbMATH Keywords

ant colony optimisationheuristic searchtimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimal infinite scheduling for multi-priced timed automata
• Hybrid Systems: Computation and Control
• Discount-optimal infinite runs in priced timed automata
• Formal Methods for Components and Objects
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(2)

• Optimal infinite scheduling for multi-priced timed automata
• Hybrid Systems: Computation and Control

This page was built for publication: Population based methods for optimising infinite behaviours of timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079791)