default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaura Bozzelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j31]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete. Log. Methods Comput. Sci. 20(1) (2024)- [j30]Laura Bozzelli
, Bastien Maubert, Aniello Murano:
On the Complexity of Model Checking Knowledge and Time. ACM Trans. Comput. Log. 25(1): 8:1-8:42 (2024) - [c63]Alberto Bombardelli, Laura Bozzelli, César Sánchez, Stefano Tonetta:
Unifying Asynchronous Logics for Hyperproperties. FSTTCS 2024: 14:1-14:18 - [c62]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. ICALP 2024: 128:1-128:20 - [c61]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Full Characterisation of Extended CTL. TIME 2024: 18:1-18:18 - [i20]Alberto Bombardelli, Laura Bozzelli, César Sánchez, Stefano Tonetta:
Unifying Asynchronous Logics for Hyperproperties. CoRR abs/2404.16778 (2024) - [i19]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Automata-Theoretic Characterisations of Branching-Time Temporal Logics. CoRR abs/2404.17421 (2024) - 2023
- [j29]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
Pspace-completeness of the temporal logic of sub-intervals and suffixes. Inf. Comput. 294: 105083 (2023) - [j28]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Interval Temporal Logic for Visibly Pushdown Systems. ACM Trans. Comput. Log. 24(3): 24:1-24:32 (2023) - [c60]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying Over Trees in Monadic Second-Order Logic. LICS 2023: 1-13 - [i18]Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero, Adriano Peron:
Quantifying over Trees in Monadic Second-Order Logic. CoRR abs/2304.11613 (2023) - 2022
- [j27]Laura Bozzelli, Aniello Murano, Adriano Peron:
Context-free timed formalisms: Robust automata and linear temporal logics. Inf. Comput. 283: 104673 (2022) - [j26]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) - [j25]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Complexity issues for timeline-based planning over dense time under future and minimal semantics. Theor. Comput. Sci. 901: 87-113 (2022) - [c59]Laura Bozzelli, Adriano Peron, César Sánchez:
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. CONCUR 2022: 27:1-27:16 - [c58]Laura Bozzelli, Adriano Peron:
A Quantitative Extension of Interval Temporal Logic over Infinite Words. TIME 2022: 11:1-11:16 - [c57]Laura Bozzelli, Adriano Peron:
Parametric Interval Temporal Logic over Infinite Words. GandALF 2022: 97-113 - [i17]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete. CoRR abs/2202.07881 (2022) - [i16]Laura Bozzelli, Adriano Peron:
A quantitative extension of Interval Temporal Logic over infinite words. CoRR abs/2206.13920 (2022) - [i15]Laura Bozzelli, Adriano Peron, César Sánchez:
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties. CoRR abs/2207.02956 (2022) - 2021
- [j24]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Complexity analysis of a unifying algorithm for model checking interval temporal logic. Inf. Comput. 280: 104640 (2021) - [c56]Laura Bozzelli, Adriano Peron, César Sánchez:
Asynchronous Extensions of HyperLTL. LICS 2021: 1-13 - [c55]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes. TIME 2021: 9:1-9:19 - [c54]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: 179-194 - [i14]Laura Bozzelli, Adriano Peron, César Sánchez:
Asynchronous Extensions of HyperLTL. CoRR abs/2104.12886 (2021) - 2020
- [j23]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Model checking interval temporal logics with regular expressions. Inf. Comput. 272: 104498 (2020) - [j22]Laura Bozzelli, Aniello Murano, Loredana Sorrentino:
Alternating-time temporal logics with linear past. Theor. Comput. Sci. 813: 199-217 (2020) - [j21]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Gerhard J. Woeginger:
Timeline-based planning over dense temporal domains. Theor. Comput. Sci. 813: 305-326 (2020) - [j20]Laura Bozzelli, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Hierarchical cost-parity games. Theor. Comput. Sci. 847: 147-174 (2020) - [c53]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Undecidability of Future Timeline-based Planning over Dense Temporal Domains? ICTCS 2020: 155-166 - [c52]Laura Bozzelli, Aniello Murano, Adriano Peron:
Module Checking of Pushdown Multi-agent Systems. KR 2020: 162-171 - [c51]Laura Bozzelli, Angelo Montanari, Adriano Peron, Pietro Sala:
On a Temporal Logic of Prefixes and Infixes. MFCS 2020: 21:1-21:14 - [i13]Laura Bozzelli, Aniello Murano, Adriano Peron:
Module checking of pushdown multi-agent systems. CoRR abs/2003.04728 (2020) - [i12]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 abs/2006.04652 (2020)
2010 – 2019
- 2019
- [j19]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: 125-144 (2019) - [j18]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): 4:1-4:31 (2019) - [c50]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Interval Temporal Logic for Visibly Pushdown Systems. FSTTCS 2019: 33:1-33:14 - [c49]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains. FSTTCS 2019: 34:1-34:14 - [c48]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Model Checking Timeline-Based Systems over Dense Temporal Domains. ICTCS 2019: 235-247 - [c47]Laura Bozzelli, Bastien Maubert, Aniello Murano:
The Complexity of Model Checking Knowledge and Time. IJCAI 2019: 1595-1601 - [c46]Laura Bozzelli, Angelo Montanari, Adriano Peron:
Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic. TIME 2019: 18:1-18:17 - [i11]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Undecidability of future timeline-based planning over dense temporal domains. CoRR abs/1904.09184 (2019) - [i10]Laura Bozzelli, Aniello Murano, Adriano Peron:
Timed Context-Free Temporal Logics. CoRR abs/1911.08406 (2019) - 2018
- [j17]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: 241-264 (2018) - [j16]Laura Bozzelli, César Sánchez:
Visibly Linear Temporal Logic. J. Autom. Reason. 60(2): 177-220 (2018) - [c45]Laura Bozzelli, Aniello Murano, Adriano Peron:
Timed Context-Free Temporal Logics. GandALF 2018: 235-249 - [c44]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: 116-127 - [c43]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Decidability and Complexity of Timeline-Based Planning over Dense Temporal Domains. KR 2018: 627-628 - [c42]Laura Bozzelli, Aniello Murano, Adriano Peron:
Event-Clock Nested Automata. LATA 2018: 80-92 - [c41]Laura Bozzelli, Aniello Murano, Loredana Sorrentino:
Results on Alternating-Time Temporal Logics with Linear Past. TIME 2018: 6:1-6:22 - [c40]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground. GandALF 2018: 191-205 - [i9]Laura Bozzelli, Aniello Murano, Adriano Peron:
Timed context-free temporal logics (extended version). CoRR abs/1808.04271 (2018) - 2017
- [c39]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: 120:1-120:14 - [c38]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions. SEFM 2017: 104-119 - [c37]Laura Bozzelli, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Hierarchical Cost-Parity Games. TIME 2017: 6:1-6:17 - [c36]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: 31-45 - [c35]Laura Bozzelli, Aniello Murano:
On the Complexity of ATL and ATL* Module Checking. GandALF 2017: 268-282 - [i8]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. CoRR abs/1711.08191 (2017) - [i7]Laura Bozzelli, Aniello Murano, Adriano Peron:
Event-Clock Nested Automata. CoRR abs/1711.08314 (2017) - 2016
- [j15]Laura Bozzelli, César Sánchez:
Foundations of Boolean stream runtime verification. Theor. Comput. Sci. 631: 118-138 (2016) - [c34]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: 389-405 - [c33]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. FSTTCS 2016: 26:1-26:14 - [c32]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling. ICTCS 2016: 49-61 - [c31]Laura Bozzelli, David Pearce:
On the Expressiveness of Temporal Equilibrium Logic. JELIA 2016: 159-173 - [c30]Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Model Checking the Logic of Allen's Relations Meets and Started-by is PNP-Complete. GandALF 2016: 76-90 - 2015
- [j14]Laura Bozzelli, Bastien Maubert, Sophie Pinchinat:
Uniform strategies, rational relations and jumping automata. Inf. Comput. 242: 80-107 (2015) - [j13]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The complexity of one-agent refinement modal logic. Theor. Comput. Sci. 603: 58-83 (2015) - [c29]Laura Bozzelli, Bastien Maubert, Sophie Pinchinat:
Unifying Hyper and Epistemic Temporal Logics. FoSSaCS 2015: 167-182 - [c28]Laura Bozzelli, David Pearce:
On the Complexity of Temporal Equilibrium Logic. LICS 2015: 645-656 - [i6]Laura Bozzelli, David Pearce:
On the complexity of Temporal Equilibrium Logic. CoRR abs/1503.00043 (2015) - 2014
- [j12]Laura Bozzelli, César Sánchez:
Visibly rational expressions. Acta Informatica 51(1): 25-49 (2014) - [j11]Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat:
Refinement modal logic. Inf. Comput. 239: 303-339 (2014) - [j10]Laura Bozzelli, Sophie Pinchinat:
Verification of gap-order constraint abstractions of counter systems. Theor. Comput. Sci. 523: 1-36 (2014) - [c27]Laura Bozzelli, César Sánchez:
Visibly Linear Temporal Logic. IJCAR 2014: 418-433 - [c26]Laura Bozzelli, César Sánchez:
Foundations of Boolean Stream Runtime Verification. RV 2014: 64-79 - [i5]Laura Bozzelli, Bastien Maubert, Sophie Pinchinat:
Unifying Hyper and Epistemic Temporal Logic. CoRR abs/1409.2711 (2014) - 2013
- [c25]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The Complexity of One-Agent Refinement Modal Logic. IJCAI 2013: 2977-2981 - [c24]Bastien Maubert, Sophie Pinchinat, Laura Bozzelli:
The Complexity of Synthesizing Uniform Strategies. SR 2013: 115-122 - 2012
- [j9]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
On timed alternating simulation for concurrent timed games. Acta Informatica 49(4): 249-279 (2012) - [c23]Laura Bozzelli, César Sánchez:
Visibly Rational Expressions. FSTTCS 2012: 211-223 - [c22]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The Complexity of One-Agent Refinement Modal Logic. JELIA 2012: 120-133 - [c21]Laura Bozzelli:
Strong Termination for Gap-Order Constraint Abstractions of Counter Systems. LATA 2012: 155-168 - [c20]Laura Bozzelli, Sophie Pinchinat:
Verification of Gap-Order Constraint Abstractions of Counter Systems. VMCAI 2012: 88-103 - [i4]Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat:
Refinement Modal Logic. CoRR abs/1202.3538 (2012) - 2011
- [j8]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
Hardness of preorder checking for basic formalisms. Theor. Comput. Sci. 412(49): 6795-6808 (2011) - [c19]Laura Bozzelli, Pierre Ganty:
Complexity Analysis of the Backward Coverability Algorithm for VASS. RP 2011: 96-109 - [c18]Laura Bozzelli, Ruggero Lanotte:
Hybrid and First-Order Complete Extensions of CaRet. TABLEAUX 2011: 58-72 - [c17]Bastien Maubert, Sophie Pinchinat, Laura Bozzelli:
Opacity Issues in Games with Imperfect Information. GandALF 2011: 87-101 - [c16]Laura Bozzelli:
New results on pushdown module checking with imperfect information. GandALF 2011: 162-177 - 2010
- [j7]Laura Bozzelli, Aniello Murano, Adriano Peron:
Pushdown module checking. Formal Methods Syst. Des. 36(1): 65-95 (2010) - [j6]Laura Bozzelli, Ruggero Lanotte:
Complexity and succinctness issues for linear-time hybrid logics. Theor. Comput. Sci. 411(2): 454-469 (2010) - [c15]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
Hardness of Preorder Checking for Basic Formalisms. LPAR (Dakar) 2010: 119-135
2000 – 2009
- 2009
- [j5]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): 1-28 (2009) - [j4]Laura Bozzelli, Salvatore La Torre:
Decision problems for lower/upper bound parametric timed automata. Formal Methods Syst. Des. 35(2): 121-151 (2009) - [c14]Laura Bozzelli, Axel Legay, Sophie Pinchinat:
On Timed Alternating Simulation for Concurrent Timed Games. FSTTCS 2009: 85-96 - 2008
- [j3]Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of well-formed communicating recursive state machines. Theor. Comput. Sci. 403(2-3): 382-405 (2008) - [c13]Laura Bozzelli:
The Complexity of CTL* + Linear Past. FoSSaCS 2008: 186-200 - [c12]Laura Bozzelli, Ruggero Lanotte:
Complexity and Succinctness Issues for Linear-Time Hybrid Logics. JELIA 2008: 48-61 - [c11]Laura Bozzelli:
The Complexity of CaRet + Chop. TIME 2008: 23-31 - 2007
- [j2]Laura Bozzelli:
Complexity results on branching-time pushdown model checking. Theor. Comput. Sci. 379(1-2): 286-297 (2007) - [c10]Laura Bozzelli:
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages. CONCUR 2007: 476-491 - [c9]Laura Bozzelli, Salvatore La Torre:
Decision Problems for Lower/Upper Bound Parametric Timed Automata. ICALP 2007: 925-936 - [c8]Laura Bozzelli:
CaRet With Forgettable Past. M4M 2007: 343-361 - 2006
- [j1]Laura Bozzelli:
Model checking for process rewrite systems and a class of action-based regular properties. Theor. Comput. Sci. 360(1-3): 352-372 (2006) - [c7]Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier:
Controller Synthesis for MTL Specifications. CONCUR 2006: 450-464 - [c6]Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On Decidability of LTL Model Checking for Process Rewrite Systems. FSTTCS 2006: 248-259 - [c5]Laura Bozzelli, Régis Gascon:
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. LPAR 2006: 197-211 - [c4]Laura Bozzelli:
Complexity Results on Branching-Time Pushdown Model Checking. VMCAI 2006: 65-79 - [c3]Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of Well-Formed Communicating Recursive State Machines. VMCAI 2006: 412-426 - 2005
- [c2]Laura Bozzelli, Aniello Murano, Adriano Peron:
Pushdown Module Checking. LPAR 2005: 504-518 - [c1]Laura Bozzelli:
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties. VMCAI 2005: 282-297 - 2004
- [i3]Laura Bozzelli:
Verification of Process Rewrite Systems in normal form. CoRR cs.OH/0401013 (2004) - [i2]Laura Bozzelli:
Model checking for Process Rewrite Systems and a class of action - based regular properties. CoRR cs.OH/0405003 (2004) - 2003
- [i1]Laura Bozzelli, Massimo Benerecetti, Adriano Peron:
Verification of recursive parallel systems. CoRR cs.OH/0312019 (2003)
Coauthor Index
[j31] [c62] [c61] [i19] [j29] [j28] [c60] [i18] [j27] [j26] [j25] [c59] [c58] [c57] [i17] [i16] [i15] [j24] [c56] [c55] [c54] [i14] [j23] [j21] [c53] [c52] [c51] [i13] [i12] [j19] [j18] [c50] [c49] [c48] [c46] [i11] [i10] [j17] [c45] [c44] [c43] [c42] [c40] [i9] [c39] [c38] [c36] [i8] [i7] [c34] [c33] [c32] [c30] [j7] [j3] [c3] [c2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
