The following pages link to Ocan Sankur (Q481097):
Displayed 34 items.
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Assume-admissible synthesis (Q520340) (← links)
- Incremental methods for checking real-time consistency (Q1996034) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Non-blind strategies in timed network congestion games (Q2112118) (← links)
- Symbolic quantitative robustness analysis of timed automata (Q2272910) (← links)
- Shrinking timed automata (Q2637311) (← links)
- Complexity of planning for connected agents in a partially known environment (Q2680862) (← links)
- Non-Zero Sum Games for Reactive Synthesis (Q2798706) (← links)
- Robust Controller Synthesis in Timed Automata (Q2842132) (← links)
- Robust Weighted Timed Automata and Games (Q2842657) (← links)
- (Q2911615) (← links)
- A Comparison of Succinctly Represented Finite-State Systems (Q2914368) (← links)
- (Q2978542) (← links)
- Untimed Language Preservation in Timed Systems (Q3088071) (← links)
- Timed Automata Can Always Be Made Implementable (Q3090823) (← links)
- (Q3113781) (← links)
- Robust Reachability in Timed Automata: A Game-Based Approach (Q3167005) (← links)
- Robust Model-Checking of Timed Automata via Pumping in Channel Machines (Q3172846) (← links)
- Probabilistic Robust Timed Games (Q3190118) (← links)
- An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP (Q3303889) (← links)
- (Q4636592) (← links)
- (Q5111455) (← links)
- Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (Q5145280) (← links)
- Robustness in Timed Automata (Q5168510) (← links)
- Variations on the Stochastic Shortest Path Problem (Q5172631) (← links)
- Admissible Strategies in Timed Games (Q5217311) (← links)
- (Q5357697) (← links)
- Percentile queries in multi-dimensional Markov decision processes (Q5892424) (← links)
- Percentile queries in multi-dimensional Markov decision processes (Q5915876) (← links)
- Abstraction refinement algorithms for timed automata (Q6154573) (← links)
- Repairing real-time requirements (Q6160924) (← links)
- (Q6176099) (← links)
- Robust controller synthesis in timed Büchi automata: a symbolic approach (Q6194594) (← links)