Cited in
(39)- Quantitative static analysis of communication protocols using abstract Markov chains
- On the Complexity of Reachability in Parametric Markov Decision Processes
- Sylvan
- Sequential convex programming for the efficient verification of parametric MDPs
- Formal system verification. State-of the-art and future trends
- The complexity of reachability in parametric Markov decision processes
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- Out of control: reducing probabilistic models by control-state elimination
- Probabilistic programming: a true verification challenge
- Synthesizing optimal bias in randomized self-stabilization
- Exact quantitative probabilistic model checking through rational search
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- MCGP
- PRISM
- MRMC
- PASS
- PARAM
- STOCKS
- DFTCalc
- CArL
- Rapture
- Prophet
- Storm
- SReach
- JScience
- SamIam
- PRISM-PSY
- Jani
- iscasMc
- AMT
- ASDeX
- POWER-TRUCTOR
- PAYNT
- Bayesian statistical parameter synthesis for linear temporal properties of stochastic models
- Smoothed model checking for uncertain continuous-time Markov chains
- A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
- FACT
- Abstract model repair for probabilistic systems
- Parameter Synthesis Algorithms for Parametric Interval Markov Chains
This page was built for software: PROPhESY
