The following pages link to Nils Jansen (Q402122):
Displaying 22 items.
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Enforcing almost-sure reachability in POMDPs (Q832296) (← links)
- Parameter synthesis for Markov models: faster than ever (Q1990499) (← links)
- Bounded model checking for probabilistic programs (Q1990501) (← links)
- Minimal Critical Subsystems for Discrete-Time Markov Models (Q2894278) (← links)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (Q3172933) (← links)
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs (Q3303926) (← links)
- Understanding Probabilistic Programs (Q3449623) (← links)
- Fast Debugging of PRISM Models (Q3457786) (← links)
- Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions (Q4990151) (← links)
- Synthesis of Provably Correct Autonomy Protocols for Shared Control (Q5002136) (← links)
- Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes (Q5026215) (← links)
- Control Theory Meets POMDPs: A Hybrid Systems Approach (Q5033812) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- (Q5089265) (← links)
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (Q5175773) (← links)
- High-level Counterexamples for Probabilistic Automata (Q5246720) (← links)
- Conditioning in probabilistic programming (Q5971400) (← links)
- Convex Optimization for Parameter Synthesis in MDPs (Q6053142) (← links)
- Robust almost-sure reachability in multi-environment MDPs (Q6535373) (← links)
- Efficient sensitivity analysis for parametric robust Markov chains (Q6535680) (← links)
- Parameter synthesis for Markov models: covering the parameter space (Q6564178) (← links)
