The following pages link to Joost-Pieter Katoen (Q236073):
Displaying 50 items.
- Multi-cost bounded tradeoff analysis in MDP (Q2208304) (← links)
- Stochastic games with lexicographic reachability-safety objectives (Q2226751) (← links)
- \textsf{PrIC3}: property directed reachability for MDPs (Q2226756) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
- One net fits all. A unifying semantics of dynamic fault trees using GSPNs (Q2280191) (← links)
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times (Q2323973) (← links)
- Multi-cost bounded reachability in MDP (Q2324235) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- A new rejection sampling method without using hat function (Q2405113) (← links)
- Criterion on stability for Markov processes applied to a model with jumps (Q2447224) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- A theory of stochastic systems. I: Stochastic automata (Q2575854) (← links)
- A theory of stochastic systems. II: Process algebra (Q2575855) (← links)
- The complexity of reachability in parametric Markov decision processes (Q2662678) (← links)
- (Q2754096) (← links)
- (Q2754196) (← links)
- (Q2769589) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Model checking for performability (Q2843861) (← links)
- Monodic temporal logic with quantified propositional variables (Q2893321) (← links)
- Minimal Critical Subsystems for Discrete-Time Markov Models (Q2894278) (← links)
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2911645) (← links)
- Efficient Modelling and Generation of Markov Automata (Q2912690) (← links)
- Compositional Abstraction Techniques for Probabilistic Automata (Q2915179) (← links)
- Analysis of timed and long-run objectives for Markov automata (Q2921114) (← links)
- SMT-Based Bisimulation Minimisation of Markov Models (Q2926637) (← links)
- Multi-objective Parameter Synthesis in Probabilistic Hybrid Systems (Q2945585) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- Quantitative automata model checking of autonomous stochastic hybrid systems (Q2986716) (← links)
- Robust PCTL model checking (Q2986774) (← links)
- Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems (Q2986934) (← links)
- Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
- A Local Greibach Normal Form for Hyperedge Replacement Grammars (Q3004590) (← links)
- The How and Why of Interactive Markov Chains (Q3066128) (← links)
- Abstract Probabilistic Automata (Q3075492) (← links)
- (Q3086919) (← links)
- Observing Continuous-Time MDPs by 1-Clock Timed Automata (Q3172860) (← links)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (Q3172933) (← links)
- Tight Game Abstractions of Probabilistic Automata (Q3190145) (← links)
- Parametric LTL on Markov Chains (Q3190162) (← links)
- Are Parametric Markov Chains Monotonic? (Q3297607) (← 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)
- Weighted Lumpability on Markov Chains (Q3457985) (← links)
- Probabilistic Programming: A True Verification Challenge (Q3460539) (← links)
