Performance Evaluation of Schedulers in a Probabilistic Setting

DOI10.1007/978-3-642-24310-3_1zbMath1348.68023OpenAlexW197144273MaRDI QIDQ3172839

Marius Bozga, Oded Maler, Jean-Francois Kempf

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

Mathematics Subject Classification ID

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

Uses Software

• Kronos
• IF-2.0
• Uppaal
• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Symbolic model checking for real-time systems
• Uppaal in a nutshell
• Scheduling with timed automata
• Unfoldings: A partial-order approach to model checking.
• A partial order semantics approach to the clock explosion problem of timed automata
• Timed regular expressions
• Introduction to Discrete Event Systems
• Calculating Probabilities of Real-Time Test Cases
• Symbolic Analysis for GSMP Models with One Stateful Clock
• Partial Order Path Technique for Checking Parallel Timed Automata
• On Interleaving in Timed Automata
• Hybrid Systems: Computation and Control

This page was built for publication: Performance Evaluation of Schedulers in a Probabilistic Setting