On using priced timed automata to achieve optimal scheduling

DOI10.1007/s10703-006-0014-1zbMath1105.68011OpenAlexW2162327103MaRDI QIDQ853729

Kim Guldstrand Larsen, Jacob Illum Rasmussen, K. Subramani and Vahan Mkrtchyan

Publication date: 17 November 2006

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-006-0014-1

zbMATH Keywords

Linear programmingReal-time schedulingCost optimalityPriced-timed automataZone-based

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

General quantitative specification theories with modal transition systems ⋮ Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems ⋮ Backward symbolic optimal reachability in weighted timed automata

Uses Software

• Kronos
• Uppaal
• UPPAAL CORA

Cites Work

• Uppaal in a nutshell
• Benchmarking and comparison of the task graph scheduling algorithms
• Scheduling Aircraft Landings—The Static Case
• A network simplex method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On using priced timed automata to achieve optimal scheduling