The following pages link to Sebastian Junges (Q832289):
Displaying 33 items.
- Runtime monitors for Markov decision processes (Q832291) (← links)
- Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
- Enforcing almost-sure reachability in POMDPs (Q832296) (← links)
- Counterexample-guided inductive synthesis for probabilistic systems (Q1982641) (← links)
- Parameter synthesis for Markov models: faster than ever (Q1990499) (← links)
- Finding provably optimal Markov chains (Q2044197) (← links)
- Inductive synthesis for probabilistic programs reaches new horizons (Q2044199) (← links)
- Markov automata with multiple objectives (Q2151241) (← links)
- Gradient-descent for randomized controllers under partial observability (Q2152644) (← links)
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
- Multi-cost bounded tradeoff analysis in MDP (Q2208304) (← links)
- \textsf{PrIC3}: property directed reachability for MDPs (Q2226756) (← links)
- One net fits all. A unifying semantics of dynamic fault trees using GSPNs (Q2280191) (← links)
- Multi-cost bounded reachability in MDP (Q2324235) (← links)
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers (Q2850015) (← links)
- Are Parametric Markov Chains Monotonic? (Q3297607) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions (Q4990151) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- (Q5089265) (← links)
- Fault Trees on a Diet (Q5351872) (← links)
- On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
- Convex Optimization for Parameter Synthesis in MDPs (Q6053142) (← links)
- A practitioner's guide to MDP model checking algorithms (Q6535370) (← links)
- Robust almost-sure reachability in multi-environment MDPs (Q6535373) (← links)
- Efficient sensitivity analysis for parametric robust Markov chains (Q6535680) (← links)
- Search and explore: symbiotic policy synthesis in POMDPs (Q6535683) (← links)
- Counterexample-driven synthesis for probabilistic program sketches (Q6535945) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- Parameter synthesis for Markov models: covering the parameter space (Q6564178) (← links)
