(Enter summary)
Abstract: Recent work in programming semantics has provided a relatively
simple probablistic extension to predicate transformers, making it possible
to treat small imperative probabilistic programs containing both
demonic and angelic nondeterminism [11, 12, 20]. That work in turn
was extended to provide a probabilistic basis for the modal -calculus
[13], and leads to a quantitative -calculus [16, 18]. (Update)
Cited by: More
Games, Probability and the Quantitative μ-Calculus - McIver, Morgan (2002)
(Correct)
Active bibliography (related documents): More All
0.5: Demonic, Angelic and Unbounded Probabilistic Choices in.. - McIver, Morgan (1998)
(Correct)
0.4: Almost-Certain Eventualities and Abstract Probabilities in.. - McIver, Morgan (2002)
(Correct)
0.3: The Generalised Substitution Language extended to probabilistic.. - Morgan (1998)
(Correct)
Similar documents based on text: More All
0.4: An Expectation-Transformer Model for Probabilistic Temporal Logic - Morgan, McIver (1997)
(Correct)
0.4: Refinement-oriented probability for CSP - Morgan, McIver, Seidel, Sanders (1995)
(Correct)
0.3: A Probabilistic Temporal Calculus Based on Expectations - Morgan, McIver (1997)
(Correct)
BibTeX entry: (Update)
C.C. Morgan and A.K. McIver. Cost analysis of games using program logic. In Proc. of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001. http://citeseer.ist.psu.edu/morgan01cost.html More
@misc{ morgan01cost,
author = "C. Morgan and A. McIver",
title = "Cost analysis of games using program logic",
text = "C.C. Morgan and A.K. McIver. Cost analysis of games using program logic.
In Proc. of the 8th Asia-Pacific Software Engineering Conference (APSEC
2001.",
year = "2001",
url = "citeseer.ist.psu.edu/morgan01cost.html" }
Citations (may not include all citations):
195
ACM Transactions on Programming Languages and Systems (context) - Morgan, McIver et al. - 1996
165
Theoretical Computer Science (context) - Kozen, the et al. - 1983
146
Prentice Hall International (context) - Dijkstra, of - 1976
129
Model checking of probabilistic and nondeterministic systems
- Bianco, de Alfaro - 1995
75
Semantics of probabilistic programs (context) - Kozen - 1981
49
It usually works: The temporal logic of stochastic systems
- Aziz, Singhal et al. - 1995
47
Local model checking games (context) - Stirling - 1995
44
Quantitative analysis and model checking
- Huth, Kwiatkowska - 1997
41
Probabilistic models for the guarded command language
- He, Seidel et al. - 1997
41
Modeling and Veri cation of Randomized Distributed Real-Time.. (context) - Segala - 1995
39
A probabilistic PDL (context) - Kozen - 1983
20
Proof rules for probabilistic loops
- Morgan - 1996
16
Computing minimum and maximum reachability times in probabil.. (context) - de Alfaro - 1999
16
pGCL: Formal reasoning for random algorithms
- Morgan, McIver - 1999
9
Computing and System Sciences (context) - Feldman, Harel et al. - 1984
7
Monograph ECS-LFCS (context) - Jones - 1990
6
angelic and unbounded probabilistic choices in sequential pr.. (context) - McIver, Morgan - 2001
6
A logic for reasoning about time and reliability (context) - Hansson, Jonsson - 1994
5
An expectation-based model for probabilistic temporal logic (context) - Morgan, McIver - 1999
2
Almost-certain eventualities and abstract probabilities in q.. (context) - Morgan, McIver - 2000
2
Competitive Markov Decision Processes | Theory (context) - Filar, Vrieze - 1996
1
Stationarity in probabilistic programs
- McIver - 2001
http://web.comlab.ox.ac.uk/oucl/research
Documents on the same site (http://web.comlab.ox.ac.uk/oucl/research/areas/probs/bibliography.html): More
Restricted Demonic Choice for Modular Probabilistic Programs - Robinson, Morgan (1998)
(Correct)
The Generalised Substitution Language extended to probabilistic.. - Morgan (1998)
(Correct)
Stationarity in Probabilistic Programs - McIver (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC