BOZZELLI, LAURA
 Distribuzione geografica
Continente #
NA - Nord America 471
EU - Europa 223
AS - Asia 116
AF - Africa 5
Continente sconosciuto - Info sul continente non disponibili 1
Totale 816
Nazione #
US - Stati Uniti d'America 462
IT - Italia 148
CN - Cina 54
VN - Vietnam 54
IE - Irlanda 16
SE - Svezia 10
FI - Finlandia 9
CA - Canada 8
DE - Germania 7
FR - Francia 7
BE - Belgio 6
UA - Ucraina 6
CI - Costa d'Avorio 5
LV - Lettonia 5
GB - Regno Unito 4
IN - India 3
NL - Olanda 3
IR - Iran 2
SG - Singapore 2
EU - Europa 1
GE - Georgia 1
PA - Panama 1
PL - Polonia 1
RO - Romania 1
Totale 816
Città #
Ashburn 71
Chandler 63
Dong Ket 54
Millbury 33
Lawrence 29
Boston 27
Des Moines 22
Naples 22
Nanjing 16
Washington 14
Wilmington 13
Princeton 11
Anacapri 10
Napoli 10
Jacksonville 8
Ottawa 8
Beijing 7
Fairfield 7
Brussels 6
Woodbridge 6
Caserta 5
Cormeilles-en-Parisis 5
Hebei 5
Nanchang 5
Guangzhou 4
Shenyang 4
Tianjin 4
Amsterdam 3
Jiaxing 3
Redwood City 3
San Giorgio A Cremano 3
Vietri sul Mare 3
Buffalo 2
Cava 2
Dublin 2
Ottaviano 2
Pescara 2
Portici 2
Somma Vesuviana 2
Villa Literno 2
Andover 1
Arzano 1
Bari 1
Bologna 1
Capri 1
Caravaggio 1
Cincinnati 1
Como 1
Florence 1
Frignano 1
Gesualdo 1
Helsinki 1
Houston 1
Kashan 1
Kronberg 1
Kunming 1
Lappeenranta 1
Los Angeles 1
Marcianise 1
Milan 1
Mogliano Veneto 1
Moncalieri 1
Mordano 1
New York 1
Nocera Inferiore 1
None 1
Norwalk 1
Odesa 1
Panama City 1
Pioltello 1
Pune 1
Rennes 1
Rome 1
Saint-denis 1
San Vitaliano 1
Sezze 1
Singapore 1
Solofra 1
Sorrento 1
Tassullo 1
Tbilisi 1
Thiene 1
Venezia 1
Totale 543
Nome #
Hierarchical cost-parity games 41
Pushdown Module Checking 35
Complexity analysis of a unifying algorithm for model checking interval temporal logic 33
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption 30
Hierarchical cost-parity games 29
Complexity analysis of a unifying algorithm for model checking interval temporal logic 28
Asynchronous Extensions of HyperLTL 28
Complexity of timeline-based planning over dense temporal domains: Exploring the middle ground 27
Which fragments of the interval temporal logic HS are tractable in model checking? 26
Interval temporal logic model checking based on track bisimilarity and prefix sampling 26
On a temporal logic of prefixes and infixes 26
Event-Clock Nested Automata 25
Context-free timed formalisms: Robust automata and linear temporal logics 25
Adding the relation meets to the temporal logic of prefixes and infixes makes It EXPSPACEL-complete 24
Verification of Well-Formed Communicating Recursive State Machines 23
The complexity of model checking knowledge and time 23
Module Checking of Pushdown Multi-agent Systems 23
Alternating-time temporal logics with linear past 23
Timeline-based planning over dense temporal domains with trigger-less rules is NP-complete 22
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions 22
Interval vs. point temporal logic model checking: An expressiveness comparison 21
Undecidability of future timeline-based planning over dense temporal domains 21
Model Checking Timeline-based Systems over Dense Temporal Domains? 20
Timed context-free temporal logics 19
Complexity issues for timeline-based planning over dense time under future and minimal semantics 19
Verification of well-formed Communicating Recursive State Machines 18
Pushdown Module Checking 18
Interval temporal logic for visibly pushdown systems 17
Model checking interval temporal logics with regular expressions 17
Taming the complexity of timeline-based planning over dense temporal domains 16
Results on Alternating-Time Temporal Logics with Linear Past 15
On the complexity of ATL and ATL* module checking 14
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy 14
Timeline-based planning over dense temporal domains 14
Quantifying Over Trees in Monadic Second-Order Logic 13
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete 13
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison 13
Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments 11
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions 11
SATISFIABILITY AND MODEL CHECKING FOR THE LOGIC OF SUB-INTERVALS UNDER THE HOMOGENEITY ASSUMPTION 11
Pspace-completeness of the temporal logic of sub-intervals and suffixes 9
Model checking for Process Rewrite Systems and a class of action-based regular properties 6
Decidability and complexity of timeline-based planning over dense temporal domains 3
Parametric Interval Temporal Logic over Infinite Words 3
On the Complexity of Model Checking Knowledge and Time 3
PSPACE-completeness of the temporal logic of sub-intervals and suffixes 2
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties 2
A Quantitative Extension of Interval Temporal Logic over Infinite Words 2
On decidability of LTL model checking for process rewrite systems 2
Controller synthesis for MTL specifications 2
Complexity results on branching-time pushdown model checking 2
Branching-time temporal logic extended with qualitative presburger constraints 1
Visibly Linear Temporal Logic 1
Interval Temporal Logic for Visibly Pushdown Systems 1
Model checking for process rewrite systems and a class of action-based regular properties 1
Totale 894
Categoria #
all - tutte 4.335
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 4.335


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20195 0 0 0 0 0 0 0 0 0 0 0 5
2019/202066 34 0 2 1 5 2 0 2 0 4 9 7
2020/2021124 1 1 2 2 3 8 27 2 10 10 4 54
2021/2022219 3 0 3 3 4 15 8 10 26 14 44 89
2022/2023194 40 11 4 3 21 24 3 32 29 4 17 6
2023/2024221 9 37 17 38 22 43 7 1 36 8 3 0
Totale 894