Laura Bozzelli

ACM Trans. Comput. Log., January, 2024

The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2024

Full Characterisation of Extended CTL.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Temporal Representation and Reasoning, 2024

Automata-Theoretic Characterisations of Branching-Time Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Unifying Asynchronous Logics for Hyperproperties.

[BibT_eX]

[DOI]

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

Pspace-completeness of the temporal logic of sub-intervals and suffixes.

[BibT_eX]

[DOI]

Inf. Comput., October, 2023

Interval Temporal Logic for Visibly Pushdown Systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2023

Quantifying Over Trees in Monadic Second-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Complexity issues for timeline-based planning over dense time under future and minimal semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Context-free timed formalisms: Robust automata and linear temporal logics.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Parametric Interval Temporal Logic over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Games, 2022

A Quantitative Extension of Interval Temporal Logic over Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Temporal Representation and Reasoning, 2022

Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Complexity analysis of a unifying algorithm for model checking interval temporal logic.

[BibT_eX]

[DOI]

Inf. Comput., 2021

Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Asynchronous Extensions of HyperLTL.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Alternating-time temporal logics with linear past.

[BibT_eX]

[DOI]

Loredana Sorrentino

Theor. Comput. Sci., 2020

Hierarchical cost-parity games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Timeline-based planning over dense temporal domains.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Model checking interval temporal logics with regular expressions.

[BibT_eX]

[DOI]

Inf. Comput., 2020

On a Temporal Logic of Prefixes and Infixes.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Module Checking of Pushdown Multi-agent Systems.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Undecidability of Future Timeline-based Planning over Dense Temporal Domains?

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

2019

Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2019

Which fragments of the interval temporal logic HS are tractable in model checking?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Model Checking Timeline-Based Systems over Dense Temporal Domains.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Visibly Linear Temporal Logic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2018

Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Timed context-free temporal logics (extended version).

[BibT_eX]

[DOI]

CoRR, 2018

Results on Alternating-Time Temporal Logics with Linear Past.

[BibT_eX]

[DOI]

Loredana Sorrentino

Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

Event-Clock Nested Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2018

Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Timed Context-Free Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

2017

On the Complexity of ATL and ATL* Module Checking.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering and Formal Methods - 15th International Conference, 2017

2016

Foundations of Boolean stream runtime verification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Model Checking the Logic of Allen's Relations Meets and Started-by is P<sup>NP</sup>-Complete.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Games, 2016

On the Expressiveness of Temporal Equilibrium Logic.

[BibT_eX]

[DOI]

David Pearce

Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

The complexity of one-agent refinement modal logic.

[BibT_eX]

[DOI]

Hans van Ditmarsch

Theor. Comput. Sci., 2015

Uniform strategies, rational relations and jumping automata.

[BibT_eX]

[DOI]

Inf. Comput., 2015

On the Complexity of Temporal Equilibrium Logic.

[BibT_eX]

[DOI]

David Pearce

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Unifying Hyper and Epistemic Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

Verification of gap-order constraint abstractions of counter systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Refinement modal logic.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Unifying Hyper and Epistemic Temporal Logic.

[BibT_eX]

[DOI]

CoRR, 2014

Visibly rational expressions.

[BibT_eX]

[DOI]

Acta Informatica, 2014

2013

The Complexity of Synthesizing Uniform Strategies

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1st International Workshop on Strategic Reasoning, 2013

2012

On timed alternating simulation for concurrent timed games.

[BibT_eX]

[DOI]

Axel Legay

Acta Informatica, 2012

Strong Termination for Gap-Order Constraint Abstractions of Counter Systems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

2011

Hardness of preorder checking for basic formalisms.

[BibT_eX]

[DOI]

Axel Legay

Theor. Comput. Sci., 2011

New results on pushdown module checking with imperfect information

[BibT_eX]

[DOI]

Proceedings of Second International Symposium on Games, 2011

Opacity Issues in Games with Imperfect Information

[BibT_eX]

[DOI]

Proceedings of Second International Symposium on Games, 2011

Hybrid and First-Order Complete Extensions of CaRet.

[BibT_eX]

[DOI]

Ruggero Lanotte

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Complexity Analysis of the Backward Coverability Algorithm for VASS.

[BibT_eX]

[DOI]

Pierre Ganty

Proceedings of the Reachability Problems - 5th International Workshop, 2011

2010

Complexity and succinctness issues for linear-time hybrid logics.

[BibT_eX]

[DOI]

Ruggero Lanotte

Theor. Comput. Sci., 2010

Pushdown module checking.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2010

2009

Decision problems for lower/upper bound parametric timed automata.

[BibT_eX]

[DOI]

Salvatore La Torre

Formal Methods Syst. Des., 2009

On decidability of LTL model checking for process rewrite systems.

[BibT_eX]

[DOI]

Acta Informatica, 2009

2008

Verification of well-formed communicating recursive state machines.

[BibT_eX]

[DOI]

Salvatore La Torre

Theor. Comput. Sci., 2008

The Complexity of CaRet + Chop.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

The Complexity of CTL* + Linear Past.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Complexity results on branching-time pushdown model checking.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

CaRet With Forgettable Past.

[BibT_eX]

[DOI]

Proceedings of the 5th Workshop on Methods for Modalities, 2007

Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006

Model checking for process rewrite systems and a class of action-based regular properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints.

[BibT_eX]

[DOI]

Régis Gascon

Proceedings of the Logic for Programming, 2006

Controller Synthesis for MTL Specifications.

[BibT_eX]

[DOI]

Patricia Bouyer

Fabrice Chevalier

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2004

Verification of Process Rewrite Systems in normal form

[BibT_eX]

[DOI]

CoRR, 2004

2003

Verification of recursive parallel systems

[BibT_eX]

[DOI]

Massimo Benerecetti