Better Quality in Synthesis through Quantitative Objectives
From MaRDI portal
Publication:3636858
DOI10.1007/978-3-642-02658-4_14zbMath1242.68151arXiv0904.2638OpenAlexW1786377004MaRDI QIDQ3636858
Barbara Jobstmann, Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.2638
Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (55)
Hyperplane separation technique for multidimensional mean-payoff games ⋮ Equilibria for games with combined qualitative and quantitative objectives ⋮ Synthesizing Efficient Controllers ⋮ Synthesizing efficient systems in probabilistic environments ⋮ Graph Games and Reactive Synthesis ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ Multiplayer Cost Games with Simple Nash Equilibria ⋮ Synthesis with rational environments ⋮ Safraless LTL synthesis considering maximal realizability ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Average-energy games ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Temporal Specifications with Accumulative Values ⋮ Synthesis for Multi-weighted Games with Branching-Time Winning Conditions ⋮ Quantitative safety and liveness ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ Synthesizing Non-Vacuous Systems ⋮ Solving mean-payoff games via quasi dominions ⋮ Unnamed Item ⋮ Quantitative vs. weighted automata ⋮ Synthesis of Reactive(1) designs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note on the approximation of mean-payoff games ⋮ Bounding Average-Energy Games ⋮ Down the Borel hierarchy: solving Muller games via safety games ⋮ Equilibria in multi-player multi-outcome infinite sequential games ⋮ Polynomial-time algorithms for energy games with special weight structures ⋮ QUASY: Quantitative Synthesis Tool ⋮ Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Synthesizing robust systems ⋮ Solving Mean-Payoff Games via Quasi Dominions ⋮ Quantitative fair simulation games ⋮ Energy parity games ⋮ Symbolic approximate time-optimal control ⋮ On High-Quality Synthesis ⋮ Quantitative Simulation Games ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ A weakness measure for GR(1) formulae ⋮ A weakness measure for GR(1) formulae ⋮ On satisficing in quantitative games ⋮ Unnamed Item ⋮ On composition of bounded-recall plans ⋮ Synthesizing Optimally Resilient Controllers ⋮ Reactive synthesis with maximum realizability of linear temporal logic specifications ⋮ Synthesizing optimally resilient controllers ⋮ Vacuity in synthesis ⋮ Optimally Resilient Strategies in Pushdown Safety Games ⋮ Simulation distances ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Qualitative analysis of concurrent mean-payoff games
This page was built for publication: Better Quality in Synthesis through Quantitative Objectives