Bozzelli, Laura
 Distribuzione geografica
Continente #
EU - Europa 163
NA - Nord America 102
Continente sconosciuto - Info sul continente non disponibili 92
AS - Asia 47
SA - Sud America 3
OC - Oceania 2
Totale 409
Nazione #
IT - Italia 157
US - Stati Uniti d'America 83
BD - Bangladesh 22
CA - Canada 10
CN - Cina 10
SG - Singapore 8
ES - Italia 4
HK - Hong Kong 3
AU - Australia 2
GB - Regno Unito 2
GD - Grenada 2
MX - Messico 2
PH - Filippine 2
AR - Argentina 1
BR - Brasile 1
CO - Colombia 1
CR - Costa Rica 1
GT - Guatemala 1
HN - Honduras 1
JM - Giamaica 1
TC - Turks e Caicos 1
TH - Thailandia 1
TR - Turchia 1
Totale 317
Città #
Milan 52
Figino 20
Rome 13
Santa Clara 8
Beijing 7
Naples 7
Singapore 6
Ashburn 5
Florence 5
New York 5
Secaucus 5
Badajoz 4
Bologna 4
Turin 4
Bari 3
Brescia 3
Hong Kong 3
Palermo 3
Buffalo 2
Carosino 2
Charlotte 2
Dallas 2
Houston 2
Jersey City 2
Messina 2
Mexico City 2
Perth 2
Toronto 2
Abbotsford British Columbia 1
Afragola 1
Ahoskie 1
Amarillo 1
Anaheim 1
Arcugnano 1
Auburn 1
Bangkok 1
Birmingham 1
Boston 1
Botucatu 1
Bracey 1
Branford 1
Bridgeport 1
Calamba 1
Catania 1
Cebu City 1
Chestermere 1
Concesio 1
Danlí 1
Dartmouth 1
Detroit 1
Dothan 1
East York 1
Forlì 1
Frosinone 1
Galt 1
Garden Grove 1
Genoa 1
Glasgow 1
Grand Bay–Westfield 1
Guatemala City 1
Haines City 1
High Point 1
Hyattsville 1
Istanbul 1
Kingston 1
Las Vegas 1
Lissone 1
Los Angeles 1
Lucca 1
Madisonville 1
Martinsburg 1
McDonough 1
Melara 1
Melbourne 1
Melilli 1
Memphis 1
New Iberia 1
Newark 1
Nola 1
North Providence 1
Ospitaletto 1
Padua 1
Palestrina 1
Partinico 1
Philadelphia 1
Phoenix 1
Pontassieve 1
Ponte San Nicolò 1
Provo 1
Ramona 1
Raven 1
Reggio Emilia 1
Reno 1
Riverside 1
Saint George's 1
Salyersville 1
San Cipriano Picentino 1
San José 1
Sauteurs 1
Scunthorpe 1
Totale 249
Nome #
Complexity results on branching-time pushdown model checking 19
Alternating-time temporal logics with linear past 16
Pushdown Module Checking 14
Adding the relation meets to the temporal logic of prefixes and infixes makes It EXPSPACEL-complete 10
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints 9
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties 9
Asynchronous Extensions of HyperLTL 7
Complexity analysis of a unifying algorithm for model checking interval temporal logic 7
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy 7
Model checking for Process Rewrite Systems and a class of action-based regular properties 7
On decidability of LTL model checking for process rewrite systems 7
The Complexity of CTL* + Linear Past 5
On Decidability of LTL Model Checking for Process Rewrite Systems 5
Pushdown Module Checking 5
A Quantitative Extension of Interval Temporal Logic over Infinite Words 5
Full Characterisation of Extended CTL 5
On timed alternating simulation for concurrent timed games 5
The Complexity of One-Agent Refinement Modal Logic 5
Interval vs. point temporal logic model checking: An expressiveness comparison 5
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages 5
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison 5
The complexity of model checking knowledge and time 5
Model checking interval temporal logics with regular expressions 5
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions 5
Verification of well-formed communicating recursive state machines 4
Opacity Issues in Games with Imperfect Information 4
PSPACE-completeness of the temporal logic of sub-intervals and suffixes 4
Complexity analysis of a unifying algorithm for model checking interval temporal logic 4
On Timed Alternating Simulation for Concurrent Timed Games 4
CaRet With Forgettable Past 4
Pushdown module checking 4
Which fragments of the interval temporal logic HS are tractable in model checking? 4
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete 4
Hierarchical cost-parity games 4
SATISFIABILITY AND MODEL CHECKING FOR THE LOGIC OF SUB-INTERVALS UNDER THE HOMOGENEITY ASSUMPTION 4
Taming the complexity of timeline-based planning over dense temporal domains 4
Verification of Well-Formed Communicating Recursive State Machines 4
On the Complexity of Model Checking Knowledge and Time 4
Hierarchical cost-parity games 4
Complexity results on branching-time pushdown model checking 4
Complexity and Succinctness Issues for Linear-Time Hybrid Logics 4
Context-free timed formalisms: Robust automata and linear temporal logics 4
Decision Problems for Lower/Upper Bound Parametric Timed Automata 4
Timed context-free temporal logics 4
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption 4
Model checking for process rewrite systems and a class of action-based regular properties 4
Decision problems for lower/upper bound parametric timed automata 4
Module Checking of Pushdown Multi-agent Systems 4
Model Checking Timeline-based Systems over Dense Temporal Domains? 4
Pushdown Module Checking 4
Interval Temporal Logic for Visibly Pushdown Systems 4
Quantifying Over Trees in Monadic Second-Order Logic 4
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions 4
Undecidability of future timeline-based planning over dense temporal domains 4
On decidability of LTL model checking for process rewrite systems 4
Complexity and succinctness issues for linear-time hybrid logics 4
Complexity Results on Branching-Time Pushdown Model Checking 4
On the complexity of ATL and ATL* module checking 4
Automata-Theoretic Characterisations of Branching-Time Temporal Logics 4
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete 4
Visibly Linear Temporal Logic 3
Model checking for process rewrite systems and a class of action-based regular properties 3
Controller synthesis for MTL specifications 3
Complexity Analysis of the Backward Coverability Algorithm for VASS 3
Pspace-completeness of the temporal logic of sub-intervals and suffixes 3
Interval temporal logic for visibly pushdown systems 3
Hybrid and First-Order Complete Extensions of CaRet 3
Complexity issues for timeline-based planning over dense time under future and minimal semantics 3
New results on pushdown module checking with imperfect information 3
Unifying Asynchronous Logics for Hyperproperties 3
Hardness of Preorder Checking for Basic Formalisms 3
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties 3
Refinement Modal Logic 3
Complexity of timeline-based planning over dense temporal domains: Exploring the middle ground 3
Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments 3
Timeline-based planning over dense temporal domains 3
Decidability and complexity of timeline-based planning over dense temporal domains 3
Branching-time temporal logic extended with qualitative presburger constraints 3
Timeline-based planning over dense temporal domains with trigger-less rules is NP-complete 3
Parametric Interval Temporal Logic over Infinite Words 3
The Complexity of CaRet + Chop 3
Controller Synthesis for MTL Specifications 3
Visibly Rational Expressions 3
Verification of Gap-Order Constraint Abstractions of Counter Systems 3
Verification of well-formed Communicating Recursive State Machines 3
Strong Termination for Gap-Order Constraint Abstractions of Counter Systems 2
Verification of Well-Formed Communicating Recursive State Machines 2
Results on Alternating-Time Temporal Logics with Linear Past 2
Event-Clock Nested Automata 2
On a temporal logic of prefixes and infixes 2
Hardness of preorder checking for basic formalisms 2
Interval temporal logic model checking based on track bisimilarity and prefix sampling 1
Totale 409
Categoria #
all - tutte 3.027
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 3.027


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2026/2027409 106 179 124 0 0 0 0 0 0 0 0 0
Totale 409