Aniello Murano

From MaRDI portal
Person:329412

Available identifiers

zbMath Open murano.anielloDBLP41/1330WikidataQ59096178 ScholiaQ59096178MaRDI QIDQ329412

List of research outcomes





PublicationDate of PublicationType
Robust alternating-time temporal logic2024-05-29Paper
On the complexity of model checking knowledge and time2024-04-26Paper
Reasoning about Quality and Fuzziness of Strategic Behaviors2023-07-18Paper
Evaluation of temporal datasets via interval temporal logic model checking2023-02-03Paper
Hierarchical cost-parity games2023-02-03Paper
Verification of agent navigation in partially-known environments2022-06-01Paper
Quantifying Bounds in Strategy Logic2022-05-28Paper
https://portal.mardi4nfdi.de/entity/Q50797702022-05-28Paper
Context-free timed formalisms: robust automata and linear temporal logics2022-03-14Paper
https://portal.mardi4nfdi.de/entity/Q50210062022-01-11Paper
Equilibria for games with combined qualitative and quantitative objectives2021-12-15Paper
https://portal.mardi4nfdi.de/entity/Q33841772021-12-14Paper
https://portal.mardi4nfdi.de/entity/Q50152762021-12-07Paper
Improving parity games in practice2021-08-02Paper
https://portal.mardi4nfdi.de/entity/Q49992232021-07-06Paper
https://portal.mardi4nfdi.de/entity/Q51510332021-02-16Paper
https://portal.mardi4nfdi.de/entity/Q51446832021-01-19Paper
Hierarchical cost-parity games2020-11-06Paper
Verification of multi-agent systems with public actions against strategy logic2020-08-06Paper
Alternating-time temporal logics with linear past2020-04-21Paper
Natural strategic ability2020-01-20Paper
Model-checking graded computation-tree logic with finite path semantics2020-01-16Paper
Solving parity games: explicit vs symbolic2018-11-07Paper
CTL\(^\ast\) with graded path modalities2018-09-27Paper
Cycle detection in computation tree logic2018-09-27Paper
Event-clock nested automata2018-06-26Paper
Practical verification of multi-agent systems against \textsc{Slk} specifications2018-06-14Paper
Graded modalities in strategy logic2018-06-14Paper
Additional Winning Strategies in Reachability Games*†2018-05-03Paper
Reasoning about graded strategy quantifiers2018-03-21Paper
On the Boundary of Behavioral Strategies2017-07-03Paper
Substructure Temporal Logic2017-07-03Paper
https://portal.mardi4nfdi.de/entity/Q29809732017-05-08Paper
Relentful strategic reasoning in alternating-time temporal logic2017-01-31Paper
Reasoning About Substructures and Games2017-01-30Paper
Prompt Interval Temporal Logic2016-11-30Paper
Ordered multi-stack visibly pushdown automata2016-11-24Paper
Solving Parity Games Using an Automata-Based Algorithm2016-11-09Paper
Checking interval properties of computations2016-10-21Paper
On promptness in parity games2016-05-11Paper
On CTL* with Graded Path Modalities2016-01-12Paper
https://portal.mardi4nfdi.de/entity/Q34560212015-12-11Paper
Reasoning About Strategies2015-09-17Paper
Graded computation tree logic2015-09-17Paper
A Behavioral Hierarchy of Strategy Logic2014-10-14Paper
On Promptness in Parity Games2014-01-17Paper
Automata-theoretic decision of timed games2013-12-10Paper
Pushdown module checking with imperfect information2013-06-06Paper
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic2012-09-25Paper
Reasoning about strategies2012-08-29Paper
Improved model checking of hierarchical systems2012-05-24Paper
Quantitatively fair scheduling2012-03-13Paper
Exploring the boundary of half-positionality2012-01-13Paper
Relentful Strategic Reasoning in Alternating-Time Temporal Logic2011-01-07Paper
Graded Computation Tree Logic with Binary Coding2010-09-03Paper
Exploring the Boundary of Half Positionality2010-08-24Paper
Pushdown module checking2010-05-05Paper
Improved Model Checking of Hierarchical Systems2010-01-14Paper
Balanced Paths in Colored Graphs2009-10-16Paper
Branching-Time Temporal Logics with Minimal Model Quantifiers2009-07-07Paper
Program Complexity in Hierarchical Module Checking2009-01-27Paper
Enriched MU-Calculi Module Checking2008-11-13Paper
The Complexity of Enriched Mu-Calculi2008-11-13Paper
Pushdown Module Checking with Imperfect Information2008-09-18Paper
Pushdown Module Checking2008-05-27Paper
Enriched μ–Calculus Pushdown Module Checking2008-05-15Paper
2-Visibly Pushdown Automata2007-11-28Paper
The Complexity of Enriched μ-Calculi2007-09-11Paper
Enriched μ-Calculi Module Checking2007-09-07Paper
Automated Technology for Verification and Analysis2006-10-25Paper
TYPENESS FOR ω-REGULAR AUTOMATA2006-08-21Paper
Theoretical Aspects of Computing - ICTAC 20042005-11-30Paper
Weak Muller acceptance conditions for tree automata2005-04-06Paper
https://portal.mardi4nfdi.de/entity/Q47369902004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47370002004-08-11Paper

Research outcomes over time

This page was built for person: Aniello Murano