Fetching the paper…
Reading the bibliography…
Recently, Dallal, Neider, and Tabuada studied a generalization of the classical game-theoretic model used in program synthesis, which additionally accounts for unmodeled intermittent disturbances.
Borel determinacy
Donald A. Martin · 1975
Earlier work this paper cites.
Permissive strategies: from parity games to safety games
Julien Bernet, David Janin, and Igor Walukiewicz · 2002
Earlier work this paper cites.
Automata, Logics, and Infinite Games: A Guide to Current Research
Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors · 2002
Earlier work this paper cites.
Synthesis of fault-tolerant concurrent programs
Paul C. Attie, Anish Arora, and E. Allen Emerson · 2004
Earlier work this paper cites.
An essay on sabotage and obstruction
Johan van Benthem · 2005
Earlier work this paper cites.
Linear time algorithm for weak parity games
Krishnendu Chatterjee · 2008
Earlier work this paper cites.
FTSyn: a framework for automatic synthesis of fault-tolerance
Ali Ebnenasir, Sandeep S. Kulkarni, and Anish Arora · 2008
Earlier work this paper cites.
Better quality in synthesis through quantitative objectives
Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, and Barbara Jobstmann · 2009
Earlier work this paper cites.
Finitary winning in ω \omega -regular games
Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn · 2009
Earlier work this paper cites.
Automating the addition of fault tolerance with discrete controller synthesis
Alain Girault and Éric Rutten · 2009
Earlier work this paper cites.
Logic and Games on Automatic Structures - Playing with Quantifiers and Decompositions
Lukasz Kaiser · 2011
Cited alongside, same era.
Synthesis of Reactive(1) designs
Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, and Yaniv Sa’ar · 2012
Cited alongside, same era.
Energy parity games
Krishnendu Chatterjee and Laurent Doyen · 2012
Cited alongside, same era.
On synthesizing robust discrete controllers under modeling uncertainty
Ufuk Topcu, Necmiye Ozay, Jun Liu, and Richard M. Murray · 2012
Cited alongside, same era.
A theory of robust omega-regular software synthesis
Rupak Majumdar, Elaine Render, and Paulo Tabuada · 2013
Cited alongside, same era.
Synthesizing robust systems
Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer · 2014
Cited alongside, same era.
Quantitative games under failures
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, and Gabriel Renault · 2015
Later among the works it cites.
Synthesis of safety controllers robust to unmodeled intermittent disturbances
Eric Dallal, Daniel Neider, and Paulo Tabuada · 2016
Later among the works it cites.
A game-theoretic foundation for the maximum software resilience against dense errors
Chung-Hao Huang, Doron A. Peled, Sven Schewe, and Farn Wang · 2016
Later among the works it cites.
SCOTS: A tool for the synthesis of symbolic controllers
Matthias Rungger and Majid Zamani · 2016
Later among the works it cites.
Robust linear temporal logic
Paulo Tabuada and Daniel Neider · 2016
Later among the works it cites.
Deciding parity games in quasipolynomial time
Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
How to handle assumptions in synthesis
Roderick Bloem, Rüdiger Ehlers, Swen Jacobs, and Robert Könighofer · 2014
Cited alongside, same era.
Resilience to intermittent assumption violations in reactive synthesis
Rüdiger Ehlers and Ufuk Topcu · 2014
Cited alongside, same era.
Parity and streett games with costs
Nathanaël Fijalkow and Martin Zimmermann · 2014
Cited alongside, same era.
Towards robustness for cyber-physical systems
Paulo Tabuada, Sina Yamac Caliskan, Matthias Rungger, and Rupak Majumdar · 2014
Cited alongside, same era.
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, and Dominik Wojtczak · 2017
Closest in time.
Succinct progress measures for solving parity games
Marcin Jurdzinski and Ranko Lazic · 2017
Closest in time.
A modal μ \mu perspective on solving parity games in quasi-polynomial time
Karoliina Lehtinen · 2018
Closest in time.
Oink: An implementation and evaluation of modern parity game solvers
Tom van Dijk · 2018
Closest in time.