The following pages link to Nils Jansen (Q402122):
Displaying 11 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)
- Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes (Q5026215) (← links)
- (Q5089265) (← links)
- Conditioning in probabilistic programming (Q5971400) (← links)
- Convex Optimization for Parameter Synthesis in MDPs (Q6053142) (← links)
