IRIS
Bozzelli, Laura
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
Continente sconosciuto - Info sul continente non disponibili 92
NA - Nord America 8
AS - Asia 4
EU - Europa 4
SA - Sud America 1
Totale 109
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 8
IT - Italia 4
CN - Cina 3
BR - Brasile 1
SG - Singapore 1
Totale 17
Salva come PNG Salva come JPEG
Città #
Secaucus 5
Naples 4
Beijing 1
Botucatu 1
Los Angeles 1
Singapore 1
Totale 13
Salva come PNG Salva come JPEG
Nome #
The Complexity of CTL* + Linear Past 4
Taming the complexity of timeline-based planning over dense temporal domains 4
The Complexity of One-Agent Refinement Modal Logic 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 3
Complexity Results on Branching-Time Pushdown Model Checking 3
A Quantitative Extension of Interval Temporal Logic over Infinite Words 2
Verification of well-formed communicating recursive state machines 1
Visibly Linear Temporal Logic 1
Model checking for process rewrite systems and a class of action-based regular properties 1
Opacity Issues in Games with Imperfect Information 1
PSPACE-completeness of the temporal logic of sub-intervals and suffixes 1
On Decidability of LTL Model Checking for Process Rewrite Systems 1
Controller synthesis for MTL specifications 1
Complexity Analysis of the Backward Coverability Algorithm for VASS 1
Complexity analysis of a unifying algorithm for model checking interval temporal logic 1
Pspace-completeness of the temporal logic of sub-intervals and suffixes 1
Pushdown Module Checking 1
On Timed Alternating Simulation for Concurrent Timed Games 1
Asynchronous Extensions of HyperLTL 1
Complexity results on branching-time pushdown model checking 1
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints 1
Complexity analysis of a unifying algorithm for model checking interval temporal logic 1
CaRet With Forgettable Past 1
Pushdown module checking 1
Interval temporal logic for visibly pushdown systems 1
Which fragments of the interval temporal logic HS are tractable in model checking? 1
Alternating-time temporal logics with linear past 1
Hybrid and First-Order Complete Extensions of CaRet 1
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete 1
Hierarchical cost-parity games 1
SATISFIABILITY AND MODEL CHECKING FOR THE LOGIC OF SUB-INTERVALS UNDER THE HOMOGENEITY ASSUMPTION 1
Complexity issues for timeline-based planning over dense time under future and minimal semantics 1
New results on pushdown module checking with imperfect information 1
Full Characterisation of Extended CTL 1
Strong Termination for Gap-Order Constraint Abstractions of Counter Systems 1
Verification of Well-Formed Communicating Recursive State Machines 1
Unifying Asynchronous Logics for Hyperproperties 1
On the Complexity of Model Checking Knowledge and Time 1
Hierarchical cost-parity games 1
Complexity results on branching-time pushdown model checking 1
Complexity and Succinctness Issues for Linear-Time Hybrid Logics 1
Context-free timed formalisms: Robust automata and linear temporal logics 1
On timed alternating simulation for concurrent timed games 1
Verification of Well-Formed Communicating Recursive State Machines 1
Hardness of Preorder Checking for Basic Formalisms 1
Timed context-free temporal logics 1
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption 1
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties 1
Refinement Modal Logic 1
Complexity of timeline-based planning over dense temporal domains: Exploring the middle ground 1
Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments 1
Model checking for process rewrite systems and a class of action-based regular properties 1
Decision problems for lower/upper bound parametric timed automata 1
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy 1
Module Checking of Pushdown Multi-agent Systems 1
Model Checking Timeline-based Systems over Dense Temporal Domains? 1
Pushdown Module Checking 1
Results on Alternating-Time Temporal Logics with Linear Past 1
Interval Temporal Logic for Visibly Pushdown Systems 1
Quantifying Over Trees in Monadic Second-Order Logic 1
Interval vs. point temporal logic model checking: An expressiveness comparison 1
Adding the relation meets to the temporal logic of prefixes and infixes makes It EXPSPACEL-complete 1
Timeline-based planning over dense temporal domains 1
Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages 1
Decidability and complexity of timeline-based planning over dense temporal domains 1
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison 1
Interval temporal logic model checking based on track bisimilarity and prefix sampling 1
Branching-time temporal logic extended with qualitative presburger constraints 1
Event-Clock Nested Automata 1
Timeline-based planning over dense temporal domains with trigger-less rules is NP-complete 1
An In-Depth Investigation of Interval Temporal Logic Model Checking with Regular Expressions 1
Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties 1
Undecidability of future timeline-based planning over dense temporal domains 1
On decidability of LTL model checking for process rewrite systems 1
On decidability of LTL model checking for process rewrite systems 1
Parametric Interval Temporal Logic over Infinite Words 1
Complexity and succinctness issues for linear-time hybrid logics 1
The complexity of model checking knowledge and time 1
The Complexity of CaRet + Chop 1
On a temporal logic of prefixes and infixes 1
On the complexity of ATL and ATL* module checking 1
Hardness of preorder checking for basic formalisms 1
Controller Synthesis for MTL Specifications 1
Visibly Rational Expressions 1
Verification of Gap-Order Constraint Abstractions of Counter Systems 1
Automata-Theoretic Characterisations of Branching-Time Temporal Logics 1
Model checking interval temporal logics with regular expressions 1
Verification of well-formed Communicating Recursive State Machines 1
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic hs with regular expressions 1
Pushdown Module Checking 1
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete 1
Totale 109
Salva come PNG Salva come JPEG
Categoria #
all - tutte 772
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 772
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2026/2027109 106 3 0 0 0 0 0 0 0 0 0 0
Totale 109