PROPhESY

swMATH33602MaRDI QIDQ45311FDOQ45311

Author name not available (Why is that?)

Cited In (16)

• Smoothed model checking for uncertain continuous-time Markov chains
• The complexity of reachability in parametric Markov decision processes
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Quantitative static analysis of communication protocols using abstract Markov chains
• A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
• Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
• Bayesian statistical parameter synthesis for linear temporal properties of stochastic models
• Formal system verification. State-of the-art and future trends
• Parameter Synthesis Algorithms for Parametric Interval Markov Chains
• Sequential convex programming for the efficient verification of parametric MDPs
• Out of control: reducing probabilistic models by control-state elimination
• Synthesizing optimal bias in randomized self-stabilization
• Exact quantitative probabilistic model checking through rational search
• Probabilistic programming: a true verification challenge
• Abstract model repair for probabilistic systems
• \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving

This page was built for software: PROPhESY