16 citations · 50 across the 11 of their papers we have counts for
4 papers · 1 filter
Search-Space Pruning with Int-Splits for Faster QBF Solving
Maximilian Heisinger, Irfansha Shaik, Martina Seidl +1
In many QBF encodings, sequences of Boolean variables stand for binary representations of integer variables. Examples are state labels in bounded model checking or actions in plann…
A Benchmarks Library for Extended Parametric Timed Automata
Étienne André, Dylan Marinho, Jaco van de Pol
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. In order to test the efficiency of new…
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Gijs Kant, Jaco van de Pol
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for pr…
Confluence Reduction for Probabilistic Systems (extended version)
Mark Timmer, Mariëlle Stoelinga, Jaco van de Pol
This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prov…