9 citations · 26 across the 9 of their papers we have counts for
10 papers
DFAMiner: Mining minimal separating DFAs from labelled samples
Daniele Dell'Erba, Yong Li, Sven Schewe
We propose DFAMiner, a passive learning tool for learning minimal separating deterministic finite automata (DFA) from a set of labelled samples. Separating automata are an interest…
An Objective Improvement Approach to Solving Discounted Payoff Games
Daniele Dell'Erba, Arthur Dumas, Sven Schewe
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the pr…
Errata to: "Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games"
Peter Austin, Daniele Dell'Erba
An improved exponential time algorithm for Energy Games and Mean Payoff Games has been recently proposed in ICALP 19. The new algorithm prevents some of the repetitive operations p…
An Objective Improvement Approach to Solving Discounted Payoff Games
Daniele Dell'Erba, Arthur Dumas, Sven Schewe
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the co…
Smaller Progress Measures and Separating Automata for Parity Games
Daniele Dell'Erba, Sven Schewe
Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to a number of approaches with quasi-polynomial complexit…
Priority Promotion with Parysian Flair
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero +2
We develop an algorithm that combines the advantages of priority promotion - one of the leading approaches to solving large parity games in practice - with the quasi-polynomial tim…
From Quasi-Dominions to Progress Measures
Massimo Benerecetti, Daniele Dell'Erba, Marco Faella +1
We revisit the approaches to the solution of parity games based on progress measures and show how the notion of quasi dominions can be integrated with those approaches. The idea is…
Solving Mean-Payoff Games via Quasi Dominions
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress m…
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its t…
A Delayed Promotion Policy for Parity Games
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
Parity games are two-player infinite-duration games on graphs that play a crucial role in various fields of theoretical computer science. Finding efficient algorithms to solve thes…