A
Aniello Murano
Researcher at University of Naples Federico II
Publications - 209
Citations - 3093
Aniello Murano is an academic researcher from University of Naples Federico II. The author has contributed to research in topics: Decidability & Model checking. The author has an hindex of 29, co-authored 197 publications receiving 2763 citations. Previous affiliations of Aniello Murano include Hebrew University of Jerusalem & University of Salerno.
Papers
More filters
Posted Content
Reasoning About Strategies: On the Model-Checking Problem
TL;DR: A more general strategy logic, denoted Sl , for reasoning about strategies in multiagent concurrent games, where strategies in S are not intrinsically glued to a specific agent, but an explicit binding operator allows an agent to bind to a strategy variable.
Journal ArticleDOI
Reasoning About Strategies: On the Model-Checking Problem
TL;DR: In this article, a more general strategy logic, denoted Sl, is introduced for reasoning about strategies in multiagent concurrent games, where strategies in Sl are not intrinsically glued to a specific agent, but an explicit binding operator allows an agent to bind to a strategy variable.
Book ChapterDOI
What makes ATL* decidable? a decidable fragment of strategy logic
TL;DR: This work introduces and studies the syntactic fragment One-Goal Strategy Logic, which consists of formulas in prenex normal form having a single temporal goal at a time for every strategy quantification of agents, and shows that Sl[1g] is strictly more expressive than Atl*.
Posted Content
MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
TL;DR: Much of current work involves refining and improving existing techniques such as predicate abstraction, which are increasingly used in industrial setting to verify hardware and software systems, both against models and concrete implementations.
Journal ArticleDOI
The Complexity of Enriched Mu-Calculi
TL;DR: This paper identifies a family of decidable logics that are maximal (and incomparable) in expressive power in the fully enriched μ-calculus by introducing two new automata models, showing that their emptiness problems are ExpTime-complete, and reducing satisfiability in the relevant logics to these problems.