9 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.LO2017★ 9 cited
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…
cs.LO2011★ 7 cited
Towards Efficient Exact Synthesis for Linear Hybrid Systems
Massimo Benerecetti, Marco Faella, Stefano Minopoli
We study the problem of automatically computing the controllable region of a Linear Hybrid Automaton, with respect to a safety objective. We describe the techniques that are needed…