Laura Bozzelli

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 64

Top Venues

Publications

Laura Bozzelli, Bastien Maubert, Aniello Murano
On the Complexity of Model Checking Knowledge and Time. ACM Trans. Comput. Log. 25 (1) (2024)
Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron
Quantifying over Trees in Monadic Second-Order Logic. CoRR (2023)
Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron
Quantifying Over Trees in Monadic Second-Order Logic. LICS (2023)
Laura Bozzelli, Angelo Montanari, Adriano Peron
Interval Temporal Logic for Visibly Pushdown Systems. ACM Trans. Comput. Log. 24 (3) (2023)
Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala
Pspace-completeness of the temporal logic of sub-intervals and suffixes. Inf. Comput. 294 (2023)
Laura Bozzelli, Adriano Peron
A quantitative extension of Interval Temporal Logic over infinite words. CoRR (2022)
Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete. CoRR (2022)
Laura Bozzelli, Adriano Peron
Parametric Interval Temporal Logic over Infinite Words. GandALF (2022)
Laura Bozzelli, Adriano Peron
A Quantitative Extension of Interval Temporal Logic over Infinite Words. TIME (2022)
Laura Bozzelli, Aniello Murano, Adriano Peron
Context-free timed formalisms: Robust automata and linear temporal logics. Inf. Comput. 283 (2022)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. Log. Methods Comput. Sci. 18 (1) (2022)
Laura Bozzelli, Angelo Montanari, Adriano Peron
Complexity issues for timeline-based planning over dense time under future and minimal semantics. Theor. Comput. Sci. 901 (2022)
Laura Bozzelli, Adriano Peron, César Sánchez
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. CoRR (2022)
Laura Bozzelli, Adriano Peron, César Sánchez
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. CONCUR (2022)
Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala
Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete. GandALF (2021)
Laura Bozzelli, Angelo Montanari, Adriano Peron
Complexity analysis of a unifying algorithm for model checking interval temporal logic. Inf. Comput. 280 (2021)
Laura Bozzelli, Adriano Peron, César Sánchez
Asynchronous Extensions of HyperLTL. LICS (2021)
Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala
Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. TIME (2021)
Laura Bozzelli, Adriano Peron, César Sánchez
Asynchronous Extensions of HyperLTL. CoRR (2021)
Laura Bozzelli, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino
Hierarchical cost-parity games. Theor. Comput. Sci. 847 (2020)
Laura Bozzelli, Aniello Murano, Adriano Peron
Module Checking of Pushdown Multi-agent Systems. KR (2020)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Model checking interval temporal logics with regular expressions. Inf. Comput. 272 (2020)
Laura Bozzelli, Aniello Murano, Loredana Sorrentino
Alternating-time temporal logics with linear past. Theor. Comput. Sci. 813 (2020)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Undecidability of Future Timeline-based Planning over Dense Temporal Domains? ICTCS (2020)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger
Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813 (2020)
Laura Bozzelli, Aniello Murano, Adriano Peron
Module checking of pushdown multi-agent systems. CoRR (2020)
Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala
On a Temporal Logic of Prefixes and Infixes. MFCS (2020)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. CoRR (2020)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Which fragments of the interval temporal logic HS are tractable in model checking? Theor. Comput. Sci. 764 (2019)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Model Checking Timeline-Based Systems over Dense Temporal Domains. ICTCS (2019)
Laura Bozzelli, Angelo Montanari, Adriano Peron
Interval Temporal Logic for Visibly Pushdown Systems. FSTTCS (2019)
Laura Bozzelli, Aniello Murano, Adriano Peron
Timed Context-Free Temporal Logics. CoRR (2019)
Laura Bozzelli, Angelo Montanari, Adriano Peron
Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic. TIME (2019)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison. ACM Trans. Comput. Log. 20 (1) (2019)
Laura Bozzelli, Angelo Montanari, Adriano Peron
Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains. FSTTCS (2019)
Laura Bozzelli, Bastien Maubert, Aniello Murano
The Complexity of Model Checking Knowledge and Time. IJCAI (2019)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Undecidability of future timeline-based planning over dense temporal domains. CoRR (2019)
Laura Bozzelli, Aniello Murano, Loredana Sorrentino
Results on Alternating-Time Temporal Logics with Linear Past. TIME (2018)
Laura Bozzelli, César Sánchez
Visibly Linear Temporal Logic. J. Autom. Reason. 60 (2) (2018)
Laura Bozzelli, Aniello Murano, Adriano Peron
Timed Context-Free Temporal Logics. GandALF (2018)
Laura Bozzelli, Aniello Murano, Adriano Peron
Timed context-free temporal logics (extended version). CoRR (2018)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete. ICTCS (2018)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground. GandALF (2018)
Laura Bozzelli, Aniello Murano, Adriano Peron
Event-Clock Nested Automata. LATA (2018)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy. Inf. Comput. 262 (2018)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains. KR (2018)
Laura Bozzelli, Aniello Murano, Adriano Peron
Event-Clock Nested Automata. CoRR (2017)
Laura Bozzelli, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino
Hierarchical Cost-Parity Games. TIME (2017)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. CoRR (2017)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions. SEFM (2017)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron
On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions. GandALF (2017)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. ICALP (2017)
Laura Bozzelli, Aniello Murano
On the Complexity of ATL and ATL* Module Checking. GandALF (2017)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments. IJCAR (2016)
Laura Bozzelli, César Sánchez
Foundations of Boolean stream runtime verification. Theor. Comput. Sci. 631 (2016)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling. ICTCS (2016)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. FSTTCS (2016)
Laura Bozzelli, David Pearce
On the Expressiveness of Temporal Equilibrium Logic. JELIA (2016)
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala
-Complete. GandALF (2016)
Laura Bozzelli, David Pearce
On the Complexity of Temporal Equilibrium Logic. LICS (2015)
Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
Unifying Hyper and Epistemic Temporal Logics. FoSSaCS (2015)
Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
The complexity of one-agent refinement modal logic. Theor. Comput. Sci. 603 (2015)
Laura Bozzelli, David Pearce
On the complexity of Temporal Equilibrium Logic. CoRR (2015)
Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
Uniform strategies, rational relations and jumping automata. Inf. Comput. 242 (2015)
Laura Bozzelli, Bastien Maubert, Sophie Pinchinat
Unifying Hyper and Epistemic Temporal Logic. CoRR (2014)
Laura Bozzelli, César Sánchez
Visibly Linear Temporal Logic. IJCAR (2014)
Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
Refinement modal logic. Inf. Comput. 239 (2014)
Laura Bozzelli, César Sánchez
Visibly rational expressions. Acta Informatica 51 (1) (2014)
Laura Bozzelli, César Sánchez
Foundations of Boolean Stream Runtime Verification. RV (2014)
Laura Bozzelli, Sophie Pinchinat
Verification of gap-order constraint abstractions of counter systems. Theor. Comput. Sci. 523 (2014)
Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
The Complexity of One-Agent Refinement Modal Logic. IJCAI (2013)
Bastien Maubert, Sophie Pinchinat, Laura Bozzelli
The Complexity of Synthesizing Uniform Strategies SR (2013)
Laura Bozzelli, César Sánchez
Visibly Rational Expressions. FSTTCS (2012)
Laura Bozzelli
Strong Termination for Gap-Order Constraint Abstractions of Counter Systems. LATA (2012)
Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat
The Complexity of One-Agent Refinement Modal Logic. JELIA (2012)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
On timed alternating simulation for concurrent timed games. Acta Informatica 49 (4) (2012)
Laura Bozzelli, Sophie Pinchinat
Verification of Gap-Order Constraint Abstractions of Counter Systems. VMCAI (2012)
Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat
Refinement Modal Logic CoRR (2012)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
Hardness of preorder checking for basic formalisms. Theor. Comput. Sci. 412 (49) (2011)
Laura Bozzelli, Pierre Ganty
Complexity Analysis of the Backward Coverability Algorithm for VASS. RP (2011)
Laura Bozzelli, Ruggero Lanotte
Hybrid and First-Order Complete Extensions of CaRet. TABLEAUX (2011)
Bastien Maubert, Sophie Pinchinat, Laura Bozzelli
Opacity Issues in Games with Imperfect Information GandALF (2011)
Laura Bozzelli
New results on pushdown module checking with imperfect information GandALF (2011)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
Hardness of Preorder Checking for Basic Formalisms. LPAR (Dakar) (2010)
Laura Bozzelli, Ruggero Lanotte
Complexity and succinctness issues for linear-time hybrid logics. Theor. Comput. Sci. 411 (2) (2010)
Laura Bozzelli, Aniello Murano, Adriano Peron
Pushdown module checking. Formal Methods Syst. Des. 36 (1) (2010)
Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
On decidability of LTL model checking for process rewrite systems. Acta Informatica 46 (1) (2009)
Laura Bozzelli, Axel Legay, Sophie Pinchinat
On Timed Alternating Simulation for Concurrent Timed Games. FSTTCS (2009)
Laura Bozzelli, Salvatore La Torre
Decision problems for lower/upper bound parametric timed automata. Formal Methods Syst. Des. 35 (2) (2009)
Laura Bozzelli
CaRet With Forgettable Past. Electron. Notes Theor. Comput. Sci. 231 (2009)
Laura Bozzelli
The Complexity of CaRet + Chop. TIME (2008)
Laura Bozzelli
The Complexity of CTL* + Linear Past. FoSSaCS (2008)
Laura Bozzelli, Salvatore La Torre, Adriano Peron
Verification of well-formed communicating recursive state machines. Theor. Comput. Sci. 403 (2-3) (2008)
Laura Bozzelli, Ruggero Lanotte
Complexity and Succinctness Issues for Linear-Time Hybrid Logics. JELIA (2008)
Laura Bozzelli, Salvatore La Torre
Decision Problems for Lower/Upper Bound Parametric Timed Automata. ICALP (2007)
Laura Bozzelli
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. CONCUR (2007)
Laura Bozzelli
Complexity results on branching-time pushdown model checking. Theor. Comput. Sci. 379 (1-2) (2007)
Laura Bozzelli, Régis Gascon
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. LPAR (2006)
Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek
On Decidability of LTL Model Checking for Process Rewrite Systems. FSTTCS (2006)
Laura Bozzelli
Model checking for process rewrite systems and a class of action-based regular properties. Theor. Comput. Sci. 360 (1-3) (2006)

Laura Bozzelli.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Laura Bozzelli