Reasoning about strategies: On the model-checking problem

F Mogavero, A Murano, G Perelli… - ACM Transactions on …, 2014 - dl.acm.org
In open systems verification, to formally check for reliability, one needs an appropriate
formalism to model the interaction between agents and express the correctness of the …

Smaller progress measures and separating automata for parity games

D Dell'Erba, S Schewe - Frontiers in Computer Science, 2022 - frontiersin.org
Calude et al. have recently shown that parity games can be solved in quasi-polynomial time,
a landmark result that has led to several approaches with quasi-polynomial complexity …

Solving parity games via priority promotion

M Benerecetti, D Dell'Erba, F Mogavero - … Toronto, ON, Canada, July 17-23 …, 2016 - Springer
We consider parity games, a special form of two-player infinite-duration games on
numerically labelled graphs, whose winning condition requires that the maximal value of a …

Solving parity games via priority promotion

M Benerecetti, D Dell'Erba, F Mogavero - Formal Methods in System …, 2018 - Springer
We consider parity games, a special form of two-player infinite-duration games on
numerically labeled graphs, whose winning condition requires that the maximal value of a …

[HTML][HTML] Priority promotion with Parysian flair

M Benerecetti, D Dell'Erba, F Mogavero… - Journal of Computer and …, 2025 - Elsevier
We develop an algorithm that combines the advantages of Priority Promotion, that is one of
the leading approaches to solving large parity games in practice, with the quasi-polynomial …

Quantifying over Trees in Monadic Second-Order Logic

M Benerecetti, L Bozzelli, F Mogavero… - 2023 38th Annual …, 2023 - ieeexplore.ieee.org
Monadic Second-Order Logic (MSO) extends First-Order Logic (FO) with variables ranging
over sets and quantifications over those variables. We introduce and study Monadic Tree …

Satisfiability in strategy logic can be easier than model checking

E Acar, M Benerecetti, F Mogavero - … of the AAAI Conference on Artificial …, 2019 - aaai.org
In the design of complex systems, model-checking and satisfiability arise as two prominent
decision problems. While model-checking requires the designed system to be provided in …

Reasoning about substructures and games

M Benerecetti, F Mogavero, A Murano - ACM Transactions on …, 2015 - dl.acm.org
Many decision problems in formal verification and design can be suitably formulated in
game-theoretic terms. This is the case for the model checking of open and closed systems …

A delayed promotion policy for parity games

M Benerecetti, D Dell'Erba, F Mogavero - arXiv preprint arXiv:1609.04087, 2016 - arxiv.org
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 these …

[HTML][HTML] A delayed promotion policy for parity games

M Benerecetti, D Dell'Erba, F Mogavero - Information and Computation, 2018 - Elsevier
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 these …