The following pages link to Massimo Benerecetti (Q264997):
Displaying 32 items.
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- Automatic synthesis of switching controllers for linear hybrid systems: safety control (Q391117) (← links)
- Tracking smooth trajectories in linear hybrid systems (Q1680510) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Reasoning About Substructures and Games (Q2957764) (← links)
- Reachability games for linear hybrid systems (Q2986753) (← links)
- Tracking differentiable trajectories across polyhedra boundaries (Q2986923) (← links)
- (Q3045457) (← links)
- (Q3367209) (← links)
- (Q3384167) (← links)
- Dynamic State Machines for Formalizing Railway Control System Specifications (Q3460219) (← links)
- (Q4209291) (← links)
- (Q4413373) (← links)
- (Q4518909) (← links)
- (Q4535644) (← links)
- (Q4536746) (← links)
- Solving Parity Games via Priority Promotion (Q4633557) (← links)
- Contextual reasoning distilled (Q4784279) (← links)
- Formal specification of beliefs in multi-agent systems (Q4935597) (← links)
- (Q4964733) (← links)
- (Q5015267) (← links)
- Solving Mean-Payoff Games via Quasi Dominions (Q5164175) (← links)
- Substructure Temporal Logic (Q5271074) (← links)
- (Q5324176) (← links)
- Abstraction Refinement of Linear Programs with Arrays (Q5758120) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
- Alternating (in)dependence-friendly logic (Q6076360) (← links)
- Taming strategy logic: non-recurrent fragments (Q6077842) (← links)
- Solving mean-payoff games via quasi dominions (Q6204169) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)
