Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
Probabilistic Choice in Refinement Algebra
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive probabilistic programs and refinement algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Of probabilistic wp and CSP - and compositionality
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
Recent work in probabilistic programmingsemantics has provided a relatively simpleprobabilistic extension to predicate transformers,making it possible to treat small imperativeprobabilistic programs containing both demonic andangelic nondeterminism [1, 2, 6]. That work in turnhaws extended to provide a probabilistic basis for themodal µ-calculus of Kozen [3], and leads to aquantitative µ-calculus [4, 5].Standard (non-probabilistic) µ-calculus can beinterpreted either 'normally,' over its semanticdomain, or as a two-player game between an 'angel'and a 'demon' representing the two forms of choice.Stirling [7] has argued that the two interpretationscorrespond.