Reactive Synthesis Without Regret

DOI10.4230/LIPICS.CONCUR.2015.114MaRDI QIDQ5357698zbMATH OpenOpenAlexFDO

Authors Paul Hunter, G. A. Pérez, Jean-François Raskin

Publication date 12 September 2017

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.CONCUR.2015.114

zbMATH Keywords

game theoryquantitative gamesregretsynthesisverification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) 2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Reactive synthesis without regret
• Correction to: ``Reactive synthesis without regret
• Cooperative reactive synthesis
• Explainable Reactive Synthesis
• Specifiable robustness in reactive synthesis
• Incorporating monitors in reactive synthesis without paying the price
• Verification, Model Checking, and Abstract Interpretation
• Synthesis of Reactive(1) designs
• Reaction Systems and Enabling Equivalence

Cited in

(7)

• The impatient may use limited optimism to minimize regret
• Iterated regret minimization in game graphs
• scientific article; zbMATH DE number 1776352 (Why is no real title available?)
• Reactive synthesis without regret
• Minimizing regret in discounted-sum games
• Explainable Reactive Synthesis
• Positional-player games

This page was built for publication: Reactive Synthesis Without Regret

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