• Publications
  • Influence
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking
TLDR
This paper proposes an efficient automata-based approach to linear time logic (LTL) model checking of variability-intensive systems, and provides an in-depth treatment of the FTS model checking algorithm.
Model checking lots of systems: efficient verification of temporal properties in software product lines
TLDR
This paper first extends transition systems with features in order to describe the combined behaviour of an entire system family, and defines and implements a model checking technique that allows to verify such transition systems against temporal properties.
Faster algorithms for mean-payoff games
TLDR
A new pseudopolynomial algorithm is presented for solving two-player games played on a weighted graph with mean-payoff objective and with energy constraints, improving the best known worst-case complexity for pseudopoly Nominal mean- payoff algorithms.
Tools and Algorithms for the Construction and Analysis of Systems
TLDR
This paper presents a meta-analyses of parallel SAT simplification on GPU architectures and its applications in reinforcement learning, artificial intelligence, and bioinformatics.
Algorithms for Omega-Regular Games with Imperfect Information
TLDR
An algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective is given and it is shown that these algorithms are optimal by proving matching lower bounds.
Acacia+, a Tool for LTL Synthesis
We present Acacia+, a tool for solving the LTL realizability and synthesis problems. We use recent approaches that reduce these problems to safety games, and can be solved efficiently by symbolic
Antichains: A New Algorithm for Checking Universality of Finite Automata
TLDR
A new algorithm for checking the universality of nondeterministic finite automata, which computes the least fixed point of a monotone function on the lattice of antichains of state sets and evaluates the performance of this algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi.
The Regular Real-Time Languages
TLDR
A specification formalism for reactive systems defines a class of Ω-languages that are definable by fully decidable formalisms and has a decidable satisfiability (nonemptiness) problem.
Antichains and compositional algorithms for LTL synthesis
TLDR
This paper presents new monolithic and compositional algorithms based on a reduction of the LTL realizability problem to a game whose winning condition is defined by a universal automaton on infinite words with a k-co-Büchi acceptance condition.
On the optimal reachability problem of weighted timed automata
TLDR
The cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations is studied, and an extension of the region graph, the weighted discrete graph, is proposed, whose structure gives light on the way to solve the  cost-optimality problem.
...
...