On using priced timed automata to achieve optimal scheduling
From MaRDI portal
(Redirected from Publication:853729)
Recommendations
Cites work
- scientific article; zbMATH DE number 1701758 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- scientific article; zbMATH DE number 1796156 (Why is no real title available?)
- scientific article; zbMATH DE number 1794360 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- A network simplex method
- Benchmarking and comparison of the task graph scheduling algorithms
- Scheduling aircraft landings -- the static case
- Uppaal in a nutshell
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
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)