PROPhESY
From MaRDI portal
Software:45311
swMATH33602MaRDI QIDQ45311FDOQ45311
Author name not available (Why is that?)
Cited In (17)
- Smoothed model checking for uncertain continuous-time Markov chains
- The complexity of reachability in parametric Markov decision processes
- Probabilistic Programming: A True Verification Challenge
- On the Complexity of Reachability in Parametric Markov Decision Processes
- Quantitative static analysis of communication protocols using abstract Markov chains
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
- 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
- Parameter Synthesis Algorithms for Parametric Interval Markov Chains
- 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
- Sequential Convex Programming for the Efficient Verification of Parametric MDPs
- Abstract model repair for probabilistic systems
- Reachability in parametric interval Markov chains using constraints
- Formal System Verification
This page was built for software: PROPhESY
