On using priced timed automata to achieve optimal scheduling

DOI10.1007/S10703-006-0014-1zbMATH Open1105.68011OpenAlexW2162327103MaRDI QIDQ853729FDOQ853729

Authors: Kim G. Larsen, Jacob Illum Rasmussen, K. Subramani 

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Formal Methods for Components and Objects
• Optimal infinite scheduling for multi-priced timed automata
• Scheduling with timed automata
• scientific article; zbMATH DE number 1796156

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)

Cites Work

• Uppaal in a nutshell
• Title not available (Why is that?)
• Scheduling aircraft landings -- the static case
• Title not available (Why is that?)
• Benchmarking and comparison of the task graph scheduling algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A network simplex method

Cited In (5)

• General quantitative specification theories with modal transition systems
• Backward symbolic optimal reachability in weighted timed automata
• Tools and Algorithms for the Construction and Analysis of Systems
• Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems
• Formal Methods for Components and Objects

Uses Software

• Kronos
• Uppaal
• UPPAAL CORA

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

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