The following pages link to (Q4551150):
Displaying 9 items.
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- Protocol conformance through refinement mappings in cadence SMV (Q998103) (← links)
- Error bounds for stochastic shortest path problems (Q2408892) (← links)
- ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM (Q2948486) (← links)
- Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms (Q3179391) (← links)
- Using Bounded Model Checking to Verify Consensus Algorithms (Q3540251) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- (Q5875395) (← links)
