Synthesis from LTL Specifications with Mean-Payoff Objectives
From MaRDI portal
Publication:5326323
DOI10.1007/978-3-642-36742-7_12zbMath1381.68149arXiv1210.3539OpenAlexW1782528461MaRDI QIDQ5326323
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Jean-François Raskin
Publication date: 5 August 2013
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.3539
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (13)
Hyperplane separation technique for multidimensional mean-payoff games ⋮ Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes ⋮ Safraless LTL synthesis considering maximal realizability ⋮ Average-energy games ⋮ Unnamed Item ⋮ Solving mean-payoff games via quasi dominions ⋮ Synthesis from component libraries with costs ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Solving Mean-Payoff Games via Quasi Dominions ⋮ Quantitative fair simulation games ⋮ Program repair without regret ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Looking at mean-payoff and total-payoff through windows
This page was built for publication: Synthesis from LTL Specifications with Mean-Payoff Objectives
