Reasoning about efficiency within a probabilistic calculus
<p>Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as &apos;the probability that predicate <em>A</em> is achieved finally&apos;. Using expectations more generally ho...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
1999
|
| Subjects: |
| _version_ | 1826295329728757760 |
|---|---|
| author | McIver, A |
| author_facet | McIver, A |
| author_sort | McIver, A |
| collection | OXFORD |
| description | <p>Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as &apos;the probability that predicate <em>A</em> is achieved finally&apos;. Using expectations more generally however, we can express calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based calculus such efficiency measures and more conventional (but probabilistic) temporal operators [14] can be related.</p> |
| first_indexed | 2024-03-07T03:59:21Z |
| format | Journal article |
| id | oxford-uuid:c3ff8fb9-4f67-450f-a7f6-4e65965df7fb |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T03:59:21Z |
| publishDate | 1999 |
| record_format | dspace |
| spelling | oxford-uuid:c3ff8fb9-4f67-450f-a7f6-4e65965df7fb2022-03-27T06:20:24ZReasoning about efficiency within a probabilistic calculusJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:c3ff8fb9-4f67-450f-a7f6-4e65965df7fbComputingEnglishOxford University Research Archive - Valet1999McIver, A<p>Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as &apos;the probability that predicate <em>A</em> is achieved finally&apos;. Using expectations more generally however, we can express calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based calculus such efficiency measures and more conventional (but probabilistic) temporal operators [14] can be related.</p> |
| spellingShingle | Computing McIver, A Reasoning about efficiency within a probabilistic calculus |
| title | Reasoning about efficiency within a probabilistic calculus |
| title_full | Reasoning about efficiency within a probabilistic calculus |
| title_fullStr | Reasoning about efficiency within a probabilistic calculus |
| title_full_unstemmed | Reasoning about efficiency within a probabilistic calculus |
| title_short | Reasoning about efficiency within a probabilistic calculus |
| title_sort | reasoning about efficiency within a probabilistic calculus |
| topic | Computing |
| work_keys_str_mv | AT mcivera reasoningaboutefficiencywithinaprobabilisticcalculus |