On High-Quality Synthesis

DOI10.1007/978-3-319-34171-2_1zbMath1476.68150OpenAlexW2480934395MaRDI QIDQ5740173

Orna Kupferman

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_1

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Extending finite-memory determinacy to multi-player games, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted automata and weighted logics with discounting
• Safety, liveness and fairness in temporal logic
• Synthesizing robust systems
• Model checking discounted temporal properties
• Synthesis from Component Libraries with Costs
• Bounded Synthesis
• Environment Assumptions for Synthesis
• Rational Synthesis
• Better Quality in Synthesis through Quantitative Objectives
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• Formalizing and Reasoning about Quality
• Model Checking Quantitative Linear Time Logic
• Discounting in LTL
• Model checking of safety properties