Deciding parity games in quasipolynomial time
It is shown that the parity game can be solved in quasipolynomial time. The parameterised
parity game-with n nodes and m distinct values (aka colours or priorities)-is proven to be in …
parity game-with n nodes and m distinct values (aka colours or priorities)-is proven to be in …
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 …
2021). We briefly describe the evaluation scheme and the experimental setup of …
An ordered approach to solving parity games in quasi polynomial time and quasi linear space
Parity games play an important role in model checking and synthesis. In their paper, Calude
et al. have recently shown that these games can be solved in quasi-polynomial time. We …
et al. have recently shown that these games can be solved in quasi-polynomial time. We …
Oink: An implementation and evaluation of modern parity game solvers
T van Dijk - International Conference on Tools and Algorithms for …, 2018 - Springer
Parity games have important practical applications in formal verification and synthesis,
especially to solve the model-checking problem of the modal mu-calculus. They are also …
especially to solve the model-checking problem of the modal mu-calculus. They are also …
Guessing winning policies in LTL synthesis by semantic learning
We provide a learning-based technique for guessing a winning strategy in a parity game
originating from an LTL synthesis problem. A cheaply obtained guess can be useful in …
originating from an LTL synthesis problem. A cheaply obtained guess can be useful in …
Rabinizer 4: From LTL to your favourite deterministic automaton
We present Rabinizer 4, a tool set for translating formulae of linear temporal logic to different
types of deterministic ω-automata. The tool set implements and optimizes several recent …
types of deterministic ω-automata. The tool set implements and optimizes several recent …
[HTML][HTML] Automated temporal equilibrium analysis: Verification and synthesis of multi-player games
In the context of multi-agent systems, the rational verification problem is concerned with
checking which temporal logic properties will hold in a system when its constituent agents …
checking which temporal logic properties will hold in a system when its constituent agents …
A temporal logic for strategic hyperproperties
R Beutner, B Finkbeiner - arXiv preprint arXiv:2107.02509, 2021 - arxiv.org
Hyperproperties are commonly used in computer security to define information-flow policies
and other requirements that reason about the relationship between multiple computations. In …
and other requirements that reason about the relationship between multiple computations. In …
HyperATL*: A logic for hyperproperties in multi-agent systems
R Beutner, B Finkbeiner - Logical Methods in Computer …, 2023 - lmcs.episciences.org
Hyperproperties are system properties that relate multiple computation paths in a system
and are commonly used to, eg, define information-flow policies. In this paper, we study a …
and are commonly used to, eg, define information-flow policies. In this paper, we study a …
GOAL for games, omega-automata, and logics
This paper introduces the second generation of GOAL, which is a graphical interactive tool
for games, ω-automata, and logics. It is a complete redesign with an extensible architecture …
for games, ω-automata, and logics. It is a complete redesign with an extensible architecture …