scientific article; zbMATH DE number 7561341

DOI10.4230/LIPIcs.FSTTCS.2018.36MaRDI QIDQ5090977

Gilles Geeraerts, Jean-Franǫis Raskin, Shibashis Guha

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov decision processesautomatic synthesisnon-clairvoyant schedulinghard and soft tasks

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Related Items (1)

Safe learning for near-optimal scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of the \(K\)th largest subset problem and related problems
• A note on preemptive scheduling of periodic, real-time tasks
• Synthesising succinct strategies in safety games with an application to real-time scheduling
• Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
• Hard Real-Time Computing Systems
• Antichains for the Automata-Based Approach to Model-Checking
• The Complexity of Markov Decision Processes
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Computational Complexity of Probabilistic Turing Machines
• On a Real-Time Scheduling Problem
• On the synthesis of strategies in infinite games
• Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: