133 citations · 155 across the 27 of their papers we have counts for
Showing 2018 · cs.LOShow all
2 papers · 2 filters
cs.LO2018
Coverability: Realizability Lower Bounds
Krishnendu Chatterjee, Nir Piterman
We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically…
cs.LO2018
Combinations of Qualitative Winning for Stochastic Parity Games
Krishnendu Chatterjee, Nir Piterman
We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all pa…