Synthesising succinct strategies in safety games with an application to real-time scheduling

DOI10.1016/j.tcs.2017.06.004zbMath1393.68038OpenAlexW2252994708MaRDI QIDQ2636511

Thi-Van-Anh Nguyen, Joël Goossens, Amélie Stainer, Gilles Geeraerts

Publication date: 5 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.06.004

zbMATH Keywords

antichainsreal-time schedulingsporadic taskssafety gamessuccinct strategies

Mathematics Subject Classification ID

Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Antichains and compositional algorithms for LTL synthesis
• Feasibility analysis of sporadic real-time multiprocessor task systems
• Measuring the performance of schedulability tests
• A theory of timed automata
• Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
• A survey of hard real-time scheduling for multiprocessor systems
• A Game Approach to Determinize Timed Automata
• Small Strategies for Safety Games
• On Conformance Testing for Timed Systems
• Antichain Algorithms for Finite Automata
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
• Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Synthesising succinct strategies in safety games with an application to real-time scheduling