Automatic verification of probabilistic free choice

DOI10.1007/3-540-47813-2_15MaRDI QIDQ4736998zbMATH OpenFDO

Authors Lenore D. Zuck, Amir Pnueli, Yonit Kesten

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2294/22940208.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Automated verification and strategy synthesis for probabilistic systems
• Probabilistic verification of proofs
• scientific article; zbMATH DE number 804604
• Verification of Probabilistic Programs
• Probabilistic verification
• The complexity of probabilistic verification
• Probabilistic verification of proofs in calculuses
• Probabilistic verification and approximation

Cited in

(4)

• Model checking and abstraction to the aid of parameterized systems (a survey)
• Parameterized verification by probabilistic abstraction
• Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
• Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm

This page was built for publication: Automatic verification of probabilistic free choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736998)