scientific article; zbMATH DE number 1796134

zbMath0991.68503MaRDI QIDQ4551150

Marta Kwiatkowska, Roberto Segala, Gethin Norman

Publication date: 4 September 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2102/21020194

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)

Related Items (8)

Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints ⋮ Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms ⋮ Error bounds for stochastic shortest path problems ⋮ Compositional probabilistic verification through multi-objective model checking ⋮ ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM ⋮ Unnamed Item ⋮ Using Bounded Model Checking to Verify Consensus Algorithms ⋮ Verification of consensus algorithms using satisfiability solving

Uses Software

• PRISM
• CUDD
• Cadence SMV

This page was built for publication: