Journal article
Reasoning about efficiency within a probabilistic calculus
- Abstract:
-
Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as 'the probability that predicate A is achieved finally'. 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Version of record, pdf, 859.3KB)
-
- Publisher copy:
- 10.1016/S1571-0661(05)80600-0
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Journal:
- Electronic Notes in Theoretical Computer Science Journal website
- Volume:
- 22
- Pages:
- Pages 138–155
- Publication date:
- 1999-01-01
- DOI:
- ISSN:
-
1571-0661
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:c3ff8fb9-4f67-450f-a7f6-4e65965df7fb
- Local pid:
- ora:10055
- Deposit date:
- 2015-02-16
Related Items
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 1999
- Notes:
- © 1999 Elsevier B.V. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
If you are the owner of this record, you can report an update to it here: Report update to this record