The following pages link to Jan Křetínský (Q690503):
Displayed 50 items.
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- Item:Q690503 (redirect page) (← links)
- On determinism in modal transition systems (Q843096) (← links)
- Counterexample explanation by learning small strategies in Markov decision processes (Q1702916) (← links)
- Compositionality for quantitative specifications (Q1797783) (← links)
- Continuous-time stochastic games with time-bounded reachability (Q1951600) (← links)
- Comparison of algorithms for simple stochastic games (Q2105472) (← links)
- Abstraction-based segmental simulation of chemical reaction networks (Q2112140) (← links)
- Value iteration for long-run average reward in Markov decision processes (Q2151247) (← links)
- Automata Tutor v3 (Q2226718) (← links)
- Faster statistical model checking for unbounded temporal properties (Q2272915) (← links)
- Logical vs. behavioural specifications (Q2304534) (← links)
- Strategy representation by decision trees in reactive synthesis (Q2324222) (← links)
- Refinement checking on parametric modal transition systems (Q2340259) (← links)
- From LTL to deterministic automata. A safraless compositional approach (Q2363815) (← links)
- Value iteration for simple stochastic games: stopping criterion and learning algorithm (Q2672267) (← links)
- Index appearance record with preorders (Q2675810) (← links)
- Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory (Q2842098) (← links)
- Compositional Verification and Optimization of Interactive Markov Chains (Q2842120) (← links)
- On Refinements of Boolean and Parametric Modal Transition Systems (Q2851908) (← links)
- Dual-Priced Modal Transition Systems with Time Durations (Q2891444) (← links)
- Modal Process Rewrite Systems (Q2915103) (← links)
- (Q2917271) (← links)
- (Q2920113) (← links)
- (Q2957522) (← links)
- Measuring performance of continuous-time stochastic processes using timed automata (Q2986711) (← links)
- Fixed-Delay Events in Generalized Semi-Markov Processes Revisited (Q3090827) (← links)
- Modal Transition Systems: Composition and LTL Model Checking (Q3172917) (← links)
- Parametric Modal Transition Systems (Q3172920) (← links)
- Probabilistic Bisimulation: Naturally on Distributions (Q3190122) (← links)
- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis (Q3297602) (← links)
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata (Q3303906) (← links)
- Index Appearance Record for Transforming Rabin Automata into Parity Automata (Q3303907) (← links)
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete (Q3393402) (← links)
- Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata (Q3457793) (← links)
- Controller Synthesis for MDPs and Frequency LTL $$_{\setminus \mathbf{G}\mathbf U}$$ (Q3460051) (← links)
- Stochastic Real-Time Games with Qualitative Timed Automata Objectives (Q3584931) (← links)
- (Q4608672) (← links)
- Limit-Deterministic Büchi Automata for Linear Temporal Logic (Q4633559) (← links)
- Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (Q4635808) (← links)
- Rabinizer: Small Deterministic Automata for LTL(F,G) (Q4649288) (← links)
- (Q5009420) (← links)
- (Q5009450) (← links)
- (Q5021007) (← links)
- A Unified Translation of Linear Temporal Logic to ω-Automata (Q5056447) (← links)
- Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes (Q5096097) (← links)
- (Q5129946) (← links)
- One Theorem to Rule Them All (Q5145312) (← links)
- Conditional Value-at-Risk for Reachability and Mean Payoff in Markov Decision Processes (Q5145337) (← links)
- Approximating Values of Generalized-Reachability Stochastic Games (Q5145624) (← links)