LTSmin: high-performance language-independent model checking
In recent years, the LTSmin model checker has been extended with support for several new
modelling languages, including probabilistic (Mapa) and timed systems (Uppaal). Also …
modelling languages, including probabilistic (Mapa) and timed systems (Uppaal). Also …
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 …
A case in point: verification and testing of a EULYNX interface
We present a case study on the application of formal methods in the railway domain. The
case study is part of the FormaSig project, which aims to support the development of …
case study is part of the FormaSig project, which aims to support the development of …
On-the-fly solving for symbolic parity games
Parity games can be used to represent many different kinds of decision problems. In
practice, tools that use parity games often rely on a specification in a higher-order logic from …
practice, tools that use parity games often rely on a specification in a higher-order logic from …
Solving parity games: Explicit vs symbolic
In this paper we provide a broad investigation of the symbolic approach for solving Parity
Games. Specifically, we implement in a fresh tool, called, four symbolic algorithms to solve …
Games. Specifically, we implement in a fresh tool, called, four symbolic algorithms to solve …
Symbolic parity game solvers that yield winning strategies
O Lijzenga, T van Dijk - arXiv preprint arXiv:2009.10876, 2020 - arxiv.org
Parity games play an important role for LTL synthesis as evidenced by recent breakthroughs
on LTL synthesis, which rely in part on parity game solving. Yet state space explosion …
on LTL synthesis, which rely in part on parity game solving. Yet state space explosion …
Quasipolynomial set-based symbolic algorithms for parity games
Solving parity games, which are equivalent to modal $\mu $-calculus model checking, is a
central algorithmic problem in formal methods. Besides the standard computation model …
central algorithmic problem in formal methods. Besides the standard computation model …
A comparison of BDD-based parity game solvers
L Sanchez, W Wesselink, TAC Willemse - arXiv preprint arXiv:1809.03097, 2018 - arxiv.org
Parity games are two player games with omega-winning conditions, played on finite graphs.
Such games play an important role in verification, satisfiability and synthesis. It is therefore …
Such games play an important role in verification, satisfiability and synthesis. It is therefore …
Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification
A Svozil - arXiv preprint arXiv:2202.02660, 2022 - arxiv.org
The goal of the thesis is to leverage fast graph algorithms and modern algorithmic
techniques for problems in model checking and synthesis on graphs, MDPs, and game …
techniques for problems in model checking and synthesis on graphs, MDPs, and game …
Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games
In this work, we perform the feasibility analysis of a multi‐grained parallel version of the
Zielonka Recursive (ZR) algorithm exploiting the coarse‐and fine‐grained concurrency …
Zielonka Recursive (ZR) algorithm exploiting the coarse‐and fine‐grained concurrency …