Probabilistic guarded commands mechanized in HOL
<p>The probabilistic guarded-command language (<em>pGCL</em>) contains both demonic and probabilistic non-determinism, which makes it suitable for reasoning about distributed random algorithms. Proofs are based on weakest precondition semantics, using an underlying logic of real- (...
| Main Authors: | , , |
|---|---|
| Formato: | Journal article |
| Idioma: | English |
| Publicado em: |
Elsevier
2005
|
| Assuntos: |