The following pages link to Ashutosh Trivedi (Q278756):
Displaying 43 items.
- Expected reachability-time games (Q278757) (← links)
- Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
- Regular model checking with regular relations (Q2140498) (← links)
- Selectively-amortized resource bounding (Q2145338) (← links)
- Expected reachability-price games (Q2176709) (← links)
- Type-directed bounding of collections in reactive programs (Q2287091) (← links)
- On timed scope-bounded context-sensitive languages (Q2327552) (← links)
- A Logical Characterization for Dense-Time Visibly Pushdown Automata (Q2798712) (← links)
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (Q2799176) (← links)
- A Perfect Class of Context-Sensitive Timed Languages (Q2817374) (← links)
- Playing Stochastic Games Precisely (Q2912689) (← links)
- On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
- First-order definable string transformations (Q2978509) (← links)
- Optimal scheduling for constant-rate multi-mode systems (Q2986754) (← links)
- Regular Transformations of Infinite Strings (Q2986782) (← links)
- Safe schedulability of bounded-rate multi-mode systems (Q2986930) (← links)
- What's decidable about recursive hybrid automata? (Q2988912) (← links)
- Bounded-rate multi-mode systems based motion planning (Q2988914) (← links)
- (Q3165971) (← links)
- Concavely-Priced Probabilistic Timed Automata (Q3184689) (← links)
- Adding Negative Prices to Priced Timed Games (Q3190143) (← links)
- Discriminating Traces with Time (Q3303919) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Concavely-Priced Timed Automata (Q3543287) (← links)
- Expected Reachability-Time Games (Q3588088) (← links)
- Global Almost-Sure Reachability in Stochastic Constant-Rate Multi-Mode Systems (Q4561426) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- Stochastic Timed Games Revisited (Q4608565) (← links)
- FO-Definable Transformations of Infinite Strings (Q4636559) (← links)
- (Q4636594) (← links)
- Recursive Timed Automata (Q4931300) (← links)
- (Q4995373) (← links)
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning (Q5039514) (← links)
- (Q5089282) (← links)
- Model-Free Reinforcement Learning for Stochastic Parity Games (Q5089286) (← links)
- The Reach-Avoid Problem for Constant-Rate Multi-mode Systems (Q5096103) (← links)
- From Monadic Second-Order Definable String Transformations to Transducers (Q5271083) (← links)
- Revisiting Robustness in Priced Timed Games (Q5275373) (← links)
- Reachability-Time Games on Timed Automata (Q5428863) (← links)
- Weak Singular Hybrid Automata (Q5500562) (← links)
- Policy synthesis and reinforcement learning for discounted LTL (Q6535643) (← links)
- The hexatope and octatope abstract domains for neural network verification (Q6661753) (← links)
- Verification of hyperproperties for dynamical systems via barrier certificates (Q6668199) (← links)
