Automated analysis of real-time scheduling using graph games
From MaRDI portal
Publication:2986919
DOI10.1145/2461328.2461356zbMath1361.90021OpenAlexW2085894197MaRDI QIDQ2986919
Krishnendu Chatterjee, Ulrich Schmid, Alexander Kößler
Publication date: 16 May 2017
Published in: Proceedings of the 16th international conference on Hybrid systems: computation and control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2461328.2461356
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
Automated competitive analysis of real-time scheduling with graph games ⋮ A note on the approximation of mean-payoff games ⋮ POMDPs under probabilistic semantics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Enhancing model checking in verification by AI techniques
- Receding horizon control for temporal logic specifications
- Model Repair for Probabilistic Systems
- Markov decision processes and regular events
- A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
- Controlling a Class of Nonlinear Systems on Rectangles
- Diagnostic Information for Realizability
This page was built for publication: Automated analysis of real-time scheduling using graph games