The following pages link to Laura Bozzelli (Q278750):
Displaying 50 items.
- Foundations of Boolean stream runtime verification (Q278752) (← links)
- Refinement modal logic (Q476194) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- On timed alternating simulation for concurrent timed games (Q715043) (← links)
- The complexity of one-agent refinement modal logic (Q744988) (← links)
- Complexity analysis of a unifying algorithm for model checking interval temporal logic (Q821561) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Pushdown module checking (Q968362) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- Decision problems for lower/upper bound parametric timed automata (Q1041291) (← links)
- Complexity and succinctness issues for linear-time hybrid logics (Q1044839) (← links)
- Event-clock nested automata (Q1647682) (← links)
- Which fragments of the interval temporal logic HS are tractable in model checking? (Q1731517) (← links)
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy (Q1784961) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- Hierarchical cost-parity games (Q2210523) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Verification of gap-order constraint abstractions of counter systems (Q2435309) (← links)
- Visibly rational expressions (Q2453980) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments (Q2817939) (← links)
- Strong Termination for Gap-Order Constraint Abstractions of Counter Systems (Q2890188) (← links)
- Verification of Gap-Order Constraint Abstractions of Counter Systems (Q2891403) (← links)
- The Complexity of One-Agent Refinement Modal Logic (Q2915064) (← links)
- On Timed Alternating Simulation for Concurrent Timed Games (Q2920115) (← links)
- Unifying Hyper and Epistemic Temporal Logics (Q2949438) (← links)
- Visibly Rational Expressions (Q2957493) (← links)
- Hybrid and First-Order Complete Extensions of CaRet (Q3010360) (← links)
- Hardness of Preorder Checking for Basic Formalisms (Q3066095) (← links)
- Complexity Analysis of the Backward Coverability Algorithm for VASS (Q3172868) (← links)
- Visibly Linear Temporal Logic (Q3192209) (← links)
- (Q3384161) (← links)
- (Q3384177) (← links)
- (Q3384890) (← links)
- (Q3388751) (← links)
- Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison (Q4636573) (← links)
- CaRet With Forgettable Past (Q4982130) (← links)
- (Q5079770) (← links)
- On a Temporal Logic of Prefixes and Infixes. (Q5089182) (← links)
- Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption (Q5111452) (← links)
- (Q5875668) (← links)
- (Q5875669) (← links)
- \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes (Q6077844) (← links)
- Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes (Q6080273) (← links)
