The following pages link to Antonín Kučera (Q235697):
Displaying 50 items.
- (Q198022) (redirect page) (← links)
- Regularity of normed PA processes (Q294692) (← links)
- Trading performance for stability in Markov decision processes (Q340568) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- Stochastic game logic (Q715046) (← links)
- Qualitative reachability in stochastic BPA games (Q719240) (← links)
- Runtime analysis of probabilistic programs with unbounded recursion (Q743128) (← links)
- Reachability in recursive Markov decision processes (Q924718) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Comparing expressibility of normed BPA and normed BPP processes (Q1306565) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Effective decomposability of sequential behaviours (Q1575536) (← links)
- On finite representations of infinite-state behaviours (Q1606922) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Approximating the termination value of one-counter MDPs and stochastic games (Q1951577) (← links)
- Continuous-time stochastic games with time-bounded reachability (Q1951600) (← links)
- Optimizing the expected mean payoff in energy Markov decision processes (Q1990496) (← links)
- Checking qualitative liveness properties of replicated systems with stochastic scheduling (Q2226750) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- The stuttering principle revisited (Q2484066) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- (Q2754154) (← links)
- (Q2766532) (← links)
- (Q2852013) (← links)
- Continuous-Time Stochastic Games with Time-Bounded Reachability. (Q2920113) (← links)
- On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS (Q2947866) (← links)
- Measuring performance of continuous-time stochastic processes using timed automata (Q2986711) (← links)
- Runtime Analysis of Probabilistic Programs with Unbounded Recursion (Q3012930) (← links)
- Approximating the Termination Value of One-Counter MDPs and Stochastic Games (Q3012931) (← links)
- (Q3060981) (← links)
- Equivalence-Checking with Infinite-State Systems: Techniques and Results (Q3085977) (← links)
- Minimizing Expected Termination Time in One-Counter Markov Decision Processes (Q3167006) (← links)
- (Q3172531) (← links)
- (Q3224096) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Cobra: A Tool for Solving General Deductive Games (Q3460038) (← links)
- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives (Q3519498) (← links)
- Stochastic Real-Time Games with Qualitative Timed Automata Objectives (Q3584931) (← links)
- Reachability Games on Extended Vector Addition Systems with States (Q3587462) (← links)
- (Q4222869) (← links)
- (Q4223069) (← links)
- (Q4270070) (← links)
- (Q4411829) (← links)
- (Q4484513) (← links)
- (Q4501545) (← links)
- Stability in Graphs and Games (Q4608661) (← links)
