Reactive synthesis without regret
type: Item
instance of: scholarly article
title: Reactive synthesis without regret
zbMATH Open document ID: 1364.68263
author: Paul Hunter
author: G. A. Pérez
author: Jean-François Raskin
published in: Acta Informatica
publication date: 2017-04-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1504.01708
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6699603
MaRDI profile type: Publication
OpenAlex ID: W2964263597
arXiv ID: 1504.01708
cites work: Reasoning about online algorithms with weighted automata
cites work: First-cycle games
cites work: Regret in Decision Making under Uncertainty
cites work: Synthesizing robust systems
cites work: Exact and Approximate Determinization of Discounted-Sum Automata
cites work: Faster algorithms for mean-payoff games
cites work: Doomsday equilibria for omega-regular games
cites work: Quantitative languages
cites work: Generalized mean-payoff and energy games
cites work: Iterated regret minimization: a new solution concept
cites work: Energy and Mean-Payoff Games with Imperfect Information
cites work: The complexity of mean payoff games on graphs
cites work: Positional strategies for mean payoff games
cites work: The disjoint shortest paths problem
cites work: Iterated Regret Minimization in Game Graphs
cites work: Q4198056
cites work: Solving Games Without Determinization
cites work: Mean-Payoff Games with Partial-Observation
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Model Checking Probabilistic Timed Automata with One or Two Clocks
cites work: Shortest paths without a map
cites work: From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
cites work: Q4205072
DOI: 10.1007/S00236-016-0268-Z
description: scientific article