Performance evaluation of schedulers in a probabilistic setting
From MaRDI portal
Publication:3172839
DOI10.1007/978-3-642-24310-3_1zbMATH Open1348.68023OpenAlexW197144273MaRDI QIDQ3172839FDOQ3172839
Authors: Jean-Francois Kempf, Marius Bozga, Oded Maler 
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24310-3_1
Recommendations
Cites Work
- Uppaal in a nutshell
- Title not available (Why is that?)
- A theory of timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to Discrete Event Systems
- Symbolic model checking for real-time systems
- Title not available (Why is that?)
- Unfoldings: A partial-order approach to model checking.
- Title not available (Why is that?)
- Timed regular expressions
- A partial order semantics approach to the clock explosion problem of timed automata
- Scheduling with timed automata
- On Interleaving in Timed Automata
- Symbolic Analysis for GSMP Models with One Stateful Clock
- Hybrid Systems: Computation and Control
- Calculating Probabilities of Real-Time Test Cases
- Title not available (Why is that?)
- Partial order path technique for checking parallel timed automata
Cited In (7)
- Space-efficient scheduling of stochastically generated tasks
- Space-efficient scheduling of stochastically generated tasks
- Measuring the performance of schedulability tests
- As soon as probable: optimal scheduling under stochastic uncertainty
- Title not available (Why is that?)
- Decoupled fitness criteria for reactive systems
- A probabilistic analysis of multiprocessor list scheduling: the erlang case
Uses Software
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)
