Parityizing Rabin and Streett
U Boker, O Kupferman, A Steinitz - IARCS Annual Conference on …, 2010 - drops.dagstuhl.de
The parity acceptance condition for $ omega $-regular languages is a special case of the
Rabin and Streett acceptance conditions. While the parity acceptance condition is as …
Rabin and Streett acceptance conditions. While the parity acceptance condition is as …
LIPIcs, Volume 8, FSTTCS'10, Complete Volume
K Lodaya, M Mahajan - IARCS Annual Conference on …, 2013 - drops.dagstuhl.de
This proceedings volume has the papers presented at the 30th annual conference on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), held at …
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), held at …
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index
K Lodaya, M Mahajan - IARCS Annual Conference on …, 2010 - drops.dagstuhl.de
This proceedings volume has the papers presented at the 30th annual conference on
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), held at …
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), held at …
[PDF][PDF] Almost-Symbolic Synthesis via∆ 2-Normalisation for Linear Temporal Logic
R Abraham, T van Dijk, S Sickert - tvandijk.nl
… the upper bound is established by constructing a deterministic Rabin automaton (DRW). Due
to the … (2) Let R and S be a DRW and deterministic Streett automaton (DSW) for the same …
to the … (2) Let R and S be a DRW and deterministic Streett automaton (DSW) for the same …
[BOOK][B] IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
… Finally, we use the construction of the parity condition in the deterministic case in order to
solve the problem of deciding whether a given Rabin or Streett automaton has an equivalent …
solve the problem of deciding whether a given Rabin or Streett automaton has an equivalent …
[HTML][HTML] Quantitative verification and strategy synthesis for stochastic games
M Svoreňová, M Kwiatkowska - European Journal of Control, 2016 - Elsevier
… for Rabin non-stochastic games as presented in [27]. Alternatively, the deterministic Rabin
… the corresponding almost-sure Rabin stochastic game to an equivalent Rabin 2-player, non-…
… the corresponding almost-sure Rabin stochastic game to an equivalent Rabin 2-player, non-…
Quantitative verification and strategy synthesis for stochastic games
M Kwiatkowska - European Journal of Control, 2016 - search.proquest.com
… for Rabin nonstochastic games as presented in [27]. Alternatively, the deterministic Rabin …
the corresponding almost-sure Rabin stochastic game to an equivalent Rabin 2-player, non-…
the corresponding almost-sure Rabin stochastic game to an equivalent Rabin 2-player, non-…
Safraless LTL synthesis considering maximal realizability
T Tomita, A Ueno, M Shimakawa, S Hagihara… - Acta Informatica, 2017 - Springer
Linear temporal logic (LTL) synthesis is a formal method for automatically composing a reactive
system that realizes a given behavioral specification described in LTL if the specification …
system that realizes a given behavioral specification described in LTL if the specification …
The reactive synthesis competition (syntcomp): 2018–2021
We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018–2021).
We briefly describe the evaluation scheme and the experimental setup of SYNTCOMP…
We briefly describe the evaluation scheme and the experimental setup of SYNTCOMP…
[CITATION][C] 30th International Conference on Foundations of Software Technology and Theoretical Computer Science
K Lodaya, M Mahajan - 2010