BOZZELLI, LAURA
 Distribuzione geografica
Continente #
EU - Europa 378
NA - Nord America 45
AS - Asia 38
Totale 461
Nazione #
RU - Federazione Russa 301
IT - Italia 70
US - Stati Uniti d'America 45
VN - Vietnam 33
IN - India 3
AT - Austria 2
CN - Cina 2
FI - Finlandia 2
IE - Irlanda 2
FR - Francia 1
Totale 461
Città #
Saint Petersburg 300
Dong Ket 33
Anacapri 31
Ashburn 22
Napoli 10
Naples 5
Nocera Superiore 4
Caserta 2
Helsinki 2
Houston 2
Marcianise 2
Mountain View 2
Udine 2
Boardman 1
Chicago 1
Gesualdo 1
Latina 1
Martignacco 1
Mogliano Veneto 1
Nashville 1
New York 1
Portici 1
San Jose 1
San Vitaliano 1
Seattle 1
Sorrento 1
Trumbull 1
Villa Literno 1
Washington 1
Totale 433
Nome #
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption, file e268a72e-c058-4c8f-e053-1705fe0a812c 305
Timeline-based planning over dense temporal domains with trigger-less rules is NP-complete, file e268a72f-eebf-4c8f-e053-1705fe0a812c 14
Complexity analysis of a unifying algorithm for model checking interval temporal logic, file e268a730-a7ac-4c8f-e053-1705fe0a812c 14
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions, file e268a730-40f7-4c8f-e053-1705fe0a812c 12
Quantifying Over Trees in Monadic Second-Order Logic, file 33748e64-3b5a-4fda-8240-83e5b743038e 10
Interval temporal logic model checking based on track bisimilarity and prefix sampling, file e268a730-436a-4c8f-e053-1705fe0a812c 10
On a temporal logic of prefixes and infixes, file e268a732-1169-4c8f-e053-1705fe0a812c 10
Complexity of timeline-based planning over dense temporal domains: Exploring the middle ground, file e268a72f-e9e7-4c8f-e053-1705fe0a812c 8
Timed context-free temporal logics, file e268a72f-e9e6-4c8f-e053-1705fe0a812c 7
Module Checking of Pushdown Multi-agent Systems, file e268a732-5d07-4c8f-e053-1705fe0a812c 7
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison, file e268a72e-703f-4c8f-e053-1705fe0a812c 6
Interval vs. point temporal logic model checking: An expressiveness comparison, file e268a72f-fae2-4c8f-e053-1705fe0a812c 6
Interval temporal logic for visibly pushdown systems, file e268a732-ccdb-4c8f-e053-1705fe0a812c 6
Model Checking Timeline-based Systems over Dense Temporal Domains?, file e268a732-a2b0-4c8f-e053-1705fe0a812c 5
Taming the complexity of timeline-based planning over dense temporal domains, file e268a732-e4f2-4c8f-e053-1705fe0a812c 5
Adding the relation meets to the temporal logic of prefixes and infixes makes It EXPSPACEL-complete, file e268a733-8556-4c8f-e053-1705fe0a812c 4
Complexity analysis of a unifying algorithm for model checking interval temporal logic, file e268a732-2b44-4c8f-e053-1705fe0a812c 3
SATISFIABILITY AND MODEL CHECKING FOR THE LOGIC OF SUB-INTERVALS UNDER THE HOMOGENEITY ASSUMPTION, file e268a733-7881-4c8f-e053-1705fe0a812c 3
Parametric Interval Temporal Logic over Infinite Words, file 292b1206-c309-449c-9607-fb3b86f274e6 2
PSPACE-completeness of the temporal logic of sub-intervals and suffixes, file 354636aa-c23b-498f-b2aa-f71454add360 2
Interval Temporal Logic for Visibly Pushdown Systems, file 6537572b-1023-4561-a07f-8c11a72f60e1 2
Controller synthesis for MTL specifications, file b4500648-5a7e-4bf8-ac6d-6fcc8ad1636d 2
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete, file e268a72e-6a5b-4c8f-e053-1705fe0a812c 2
Undecidability of future timeline-based planning over dense temporal domains, file e268a732-07e8-4c8f-e053-1705fe0a812c 2
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties, file ffbfe50e-7742-4a97-97a3-d9d31f41c37d 2
Model checking for Process Rewrite Systems and a class of action-based regular properties, file 35b8cf1d-6ca4-4666-b4bc-2bbd3a7d9647 1
On decidability of LTL model checking for process rewrite systems, file 77ec1e36-bdeb-49ff-8e88-b78a7bd17b21 1
Model checking for process rewrite systems and a class of action-based regular properties, file 969d9991-e48a-4c57-ae1b-2a1b4c80b616 1
Complexity results on branching-time pushdown model checking, file c2b348d5-a0c2-4191-a0fa-fad3348a5f39 1
On the Complexity of Model Checking Knowledge and Time, file de6f93ed-931d-4c2d-97cf-9ad965538933 1
Which fragments of the interval temporal logic HS are tractable in model checking?, file e268a72f-e917-4c8f-e053-1705fe0a812c 1
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy, file e268a72f-e9e0-4c8f-e053-1705fe0a812c 1
Model checking interval temporal logics with regular expressions, file e268a732-3a5e-4c8f-e053-1705fe0a812c 1
Timeline-based planning over dense temporal domains, file e268a732-476a-4c8f-e053-1705fe0a812c 1
Context-free timed formalisms: Robust automata and linear temporal logics, file e268a732-6b23-4c8f-e053-1705fe0a812c 1
Complexity issues for timeline-based planning over dense time under future and minimal semantics, file e268a733-1f0d-4c8f-e053-1705fe0a812c 1
Asynchronous Extensions of HyperLTL, file e268a733-4080-4c8f-e053-1705fe0a812c 1
Pspace-completeness of the temporal logic of sub-intervals and suffixes, file e268a733-b704-4c8f-e053-1705fe0a812c 1
Totale 462
Categoria #
all - tutte 1.100
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 1.100


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20206 0 0 0 0 3 1 0 0 0 2 0 0
2020/202125 2 0 1 1 0 0 0 0 1 0 2 18
2021/202231 16 1 0 0 2 1 0 0 2 8 0 1
2022/202313 1 1 0 0 0 0 1 0 1 1 8 0
2023/202482 1 1 11 12 1 6 8 6 34 2 0 0
Totale 462