The following pages link to Joost-Pieter Katoen (Q236073):
Displaying 33 items.
- Counterexamples in Probabilistic Model Checking (Q5758104) (← links)
- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning (Q5758124) (← links)
- On the Complexity of Reachability in Parametric Markov Decision Processes (Q5875375) (← links)
- Improving Generalization in Software IC3 (Q5883575) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900585) (← links)
- Metric semantics for true concurrent real time (Q5940931) (← links)
- Process algebra for performance evaluation (Q5958464) (← links)
- Conditioning in probabilistic programming (Q5971400) (← links)
- Monitoring CTMCs by multi-clock timed automata (Q6041132) (← links)
- Sound value iteration (Q6041136) (← links)
- Causal ambiguity and partial orders in event structures (Q6044126) (← links)
- Convex Optimization for Parameter Synthesis in MDPs (Q6053142) (← links)
- Parameter-Independent Strategies for pMDPs via POMDPs (Q6104800) (← links)
- Model Checking for Safe Navigation Among Humans (Q6104810) (← links)
- Model Checking Temporal Properties of Recursive Probabilistic Programs (Q6137848) (← links)
- The probabilistic termination tool amber (Q6145021) (← links)
- POMDP controllers with optimal budget (Q6160772) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q6411355) (← links)
- Verification of Indefinite-Horizon POMDPs (Q6485882) (← links)
- Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
- Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains (Q6518110) (← links)
- Under-approximating expected total rewards in POMDPs (Q6535603) (← links)
- Search and explore: symbiotic policy synthesis in POMDPs (Q6535683) (← links)
- Counterexample-driven synthesis for probabilistic program sketches (Q6535945) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- Generative Datalog with continuous distributions (Q6551262) (← links)
- Parameter synthesis for Markov models: covering the parameter space (Q6564178) (← links)
- Towards concurrent quantitative separation logic (Q6587133) (← links)
- Stochastic games with lexicographic objectives (Q6632196) (← links)
- Multi-objective Optimization of Long-run Average and Total Rewards: Supplemental Material (Q6697781) (← links)
- Computing Expected Visiting Times and Stationary Distributions in Markov Chains: Fast and Accurate (Artifact) (Q6697803) (← links)
