Semantics of sub-probabilistic programs

Abstract

The aim of this paper is to extend the probabilistic choice in probabilistic programs to sub-probabilistic choice, i.e., of the form

References

1. Gill J Computationalcomplexity of probabilistic Turing machinesProceedings of 6th ACM Annual Symposium on Theory of ComputingNew YorkACMPress 1974 9195
2. Paz A Introductionto Probabilistic AutomataNew YorkAcademic Press 1971
3. Yao A Probabilisticcomputations: toward a unified measure of complexityProceeding of 18th IEEE Symposium on Foundations of Computer ScienceProvidenceIEEEComputer Society Press 1977 222227
4. Rabin M O ProbabilisticalgorithmTraub J FProceedings of Alorithm and ComplexityNew YorkAcademic Press 1976 2140
5. Kozen D Semanticsof probabilistic programsJournal of Computerand System Science 1981 22328350
6. Kozen D A probabilisticPDLJournal of Computer and System Science 1985 30162178
7. Chen Y X Stablesemantics of weakest prepredicatesJournalof Software 2003 24(Suppl.)161167
8. Chen Y X Jung A An introduction to fuzzy predicatetransformersProceedings of the 3rd InternationalSymposium on Domain TheoryXi'anShaanxi Normal University 2004
9. Chen Y X Plotkin G Wu H Y On healthy fuzzy predicate transformersProceedings of the 4th International Symposium on Domain TheorychangshaHunanUniversity 2006
10. Gierz G Hofmann K H Keimel K et al.Continuous Lattices and Domains, Encyclopedia ofMathemmatics and its Applications (volume 93)CambridgeCambridge UniversityPress 2003
11. He J F Seidel K McIver A K Probabilistic models for the guarded command languageScience of Computer Programming 1997 28171192
12. Jones C Plotkin G A probabilistic powerdomainof evaluationsProceedings of the 4th AnnualSymposium on Logic in Computer ScienceIEEE Computer Society Press 1989 186195
13. Plotkin G D Dijkstra'spredicate transformers and Smyth's powerdomainsBjørner DAbstract SoftwareSpecifications. Lecture Notes in Computer Science 1980 86527553
14. Morgan C McIver A Seidel K Probabilistic predicate transformersACM Trans. Programming Languages and Systems 1996 18325353
15. McIver A K Morgan C Partial correctness for probabilisticdemonic programsTheoretical Computer Science 2001 266513541
16. McIver A K Morgan C Demonic, angelic and unboundedprobabilistic choices in sequential programsActo Informatica 2001 37329354
17. Tix R Keimel K Plotkin G Semantics domains for combining probability and non-determinismElectronic Notes in Theoretical Computer Science 2005 1291104
18. Ying M S Reasoningabout probabilistic sequential programs in a probabilistic logicActa Informatica 2003 39315389
19. Jones C Probabilisticnon-determinismPhD thesis EdinburghUniversity of Edinburgh 1990 Also published as Techniccal report No. CST-63-90
20. Dijkstra E W ADiscipline of ProgrammingPrentice HallInternational, Englewood Cliffs 1976
21. Ying M S Additivemodels of probabilistic processesTheoreticalComputer Science 2002 275481519