The following pages link to Joost-Pieter Katoen (Q236073):
Displaying 16 items.
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- Bottom-up tree acceptors (Q1263293) (← links)
- Model-checking large structured Markov chains. (Q1400291) (← links)
- Inferring covariances for probabilistic programs (Q1693100) (← links)
- Systolic arrays for the recognition of permutation-invariant segments (Q1924628) (← links)
- Layered reasoning for randomized distributed algorithms (Q1941864) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- Robust PCTL model checking (Q2986774) (← links)
- Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems (Q2986934) (← links)
- Probabilistic Programming: A True Verification Challenge (Q3460539) (← links)
- Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
- YMCA (Q5262955) (← links)
