7 citations · 31 across the 11 of their papers we have counts for
7 papers · 1 filter
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…
Defeasible Inclusions in Low-Complexity DLs
Piero A. Bonatti, Marco Faella, Luigi Sauro
Some of the applications of OWL and RDF (e.g. biomedical knowledge representation and semantic policy formulation) call for extensions of these languages with nonmonotonic construc…
Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification
Marco Faella, Aniello Murano
This volume contains the proceedings of the Third International Symposium on Games, Automata, Logic and Formal Verification (GandALF), held in Naples (Italy) from September 6th to…
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…
Automatic Synthesis of Switching Controllers for Linear Hybrid Automata
Massimo Benerecetti, Marco Faella, Stefano Minopoli
In this paper we study the problem of automatically generating switching controllers for the class of Linear Hybrid Automata, with respect to safety objectives. We identify and sol…
Some Models and Tools for Open Systems
Axel Legay, Marco Faella
In computer science, there is a distinction between closed systems, whose behavior is totally determined in advance, and open systems, that are systems maintaining a constant inter…