scientific article; zbMATH DE number 7561341

DOI10.4230/LIPICS.FSTTCS.2018.36MaRDI QIDQ5090977FDOQ5090977

Authors: G. Geeraerts, Shibashis Guha, Jean-Franǫis Raskin 

Publication date: 21 July 2022

Title of this publication is not available (Why is that?)

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)

Cites Work

• The Complexity of Markov Decision Processes
• Title not available (Why is that?)
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• A note on preemptive scheduling of periodic, real-time tasks
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• Computational Complexity of Probabilistic Turing Machines
• Title not available (Why is that?)
• Hard real-time computing systems. Predictable scheduling algorithms and applications.
• On the synthesis of strategies in infinite games
• On a Real-Time Scheduling Problem
• Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
• Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
• The complexity of the \(K\)th largest subset problem and related problems
• Antichains for the Automata-Based Approach to Model-Checking
• Synthesising succinct strategies in safety games with an application to real-time scheduling
• Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis

Cited In (2)

• Safe learning for near-optimal scheduling
• Optimal scheduling of contract algorithms with soft deadlines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090977)