Performance evaluation of schedulers in a probabilistic setting
From MaRDI portal
Publication:3172839
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 176728 (Why is no real title available?)
- scientific article; zbMATH DE number 1303059 (Why is no real title available?)
- scientific article; zbMATH DE number 1786474 (Why is no real title available?)
- scientific article; zbMATH DE number 1905116 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- A partial order semantics approach to the clock explosion problem of timed automata
- A theory of timed automata
- Calculating Probabilities of Real-Time Test Cases
- Hybrid Systems: Computation and Control
- Introduction to Discrete Event Systems
- On Interleaving in Timed Automata
- Partial order path technique for checking parallel timed automata
- Scheduling with timed automata
- Symbolic Analysis for GSMP Models with One Stateful Clock
- Symbolic model checking for real-time systems
- Timed regular expressions
- Unfoldings: A partial-order approach to model checking.
- Uppaal in a nutshell
Cited in
(7)- Space-efficient scheduling of stochastically generated tasks
- Decoupled fitness criteria for reactive systems
- Space-efficient scheduling of stochastically generated tasks
- A probabilistic analysis of multiprocessor list scheduling: the erlang case
- As soon as probable: optimal scheduling under stochastic uncertainty
- Measuring the performance of schedulability tests
- scientific article; zbMATH DE number 1956584 (Why is no real title available?)
This page was built for publication: Performance evaluation of schedulers in a probabilistic setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172839)