Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T09:36:41.405Z Has data issue: false hasContentIssue false
  • English
  • Français

Predicate transformers for extended probability and non-determinism

Published online by Cambridge University Press:  01 June 2009

KLAUS KEIMEL  and
GORDON D. PLOTKIN
KLAUS KEIMEL
Affiliation:
Fachbereich Mathematik, Technische Universität, 64289 Darmstadt, Germany
GORDON D. PLOTKIN
Affiliation:
School of Informatics, LFCS, University of Edinburgh, Edingburgh EH8 9AB, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

We investigate laws for predicate transformers for the combination of non-deterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended non-negative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to conical powerdomains, which are the appropriate powerdomains for the combined forms of non-determinism. As with standard powerdomains for non-deterministic choice, these come in three flavours – lower, upper and (order-)convex – so there are also three kinds of predicate transformers. In order to make the connection, the powerdomains are first characterised in terms of relevant classes of functionals.

Much of the development is carried out at an abstract level, a kind of domain-theoretic functional analysis: one considers d-cones, which are dcpos equipped with a module structure over the non-negative extended reals, in place of topological vector spaces. Such a development still needs to be carried out for probabilistic choice per se; it would presumably be necessary to work with a notion of convex space rather than a cone.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 19 , Issue 3 , June 2009 , pp. 501 - 539
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bonnesen, T. and Fenchel, W. (1934) Theorie der konvexen Körper, Ergebnisse der Mathematik und ihrer Grenzgebiete 3, Springer Verlag.Google Scholar
Bonsall, F. F. (1954) Sublinear functionals and ideals in partially ordered vector spaces. Proc. London Math. Soc., Series 3, 4 402–418.CrossRefGoogle Scholar
Bonsangue, M. M. (1998) Topological Duality in Semantics. Electronic Notes in Theoretical Computer Science 8 1–274.Google Scholar
Dijkstra, E. W. (1976) A Discipline of Programming, Prentice-Hall.Google Scholar
Escardó, M. (2004) Synthetic topology of data types and classical spaces. Electronic Notes in Theoretical Computer Science 87 1–150.CrossRefGoogle Scholar
Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M. and Scott, D. S. (2003) Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications 93, Cambridge University Press.CrossRefGoogle Scholar
Graham, S. (1988) Closure Properties of a Probabilistic Powerdomain Construction. In: Main, M., Melton, A., Mislove, M. and Schmidt, D. (eds.) Mathematical Foundations of Programming Language Semantics. Springer-Verlag Lecture Notes in Computer Science 298 213–233.CrossRefGoogle Scholar
Heckmann, R. (1993) Power domains and second-order predicates. Theoretical Computer Science 111 59–88.CrossRefGoogle Scholar
Heckmann, R. (1994) Probabilistic domains. In: Proc. of CAAP'94. Springer-Verlag Lecture Notes in Computer Science 136 21–56.Google Scholar
Hörmander, L. (1955) Sur la fonction d'appui des ensembles convexes dans un espace localement convexe. Ark. Mat. 3 181–186.CrossRefGoogle Scholar
Huber, P. J. (1981) Robust Statistics, Wiley.CrossRefGoogle Scholar
Johnstone, P. T. (1985) Vietoris locales and localic semilattices. In: Hoffmann, R.-E., Hofmann, K. H. (eds.) Continuous Lattices and Their Applications. Lecture Notes in Pure and Applied Mathematics 101 155–180.Google Scholar
Jones, C. (1990) Probabilistic non-determinism, Ph.D. Thesis, University of Edinburgh, Report ECS-LFCS-90-105.Google Scholar
Jones, C. and Plotkin, G. D. (1989) A probabilistic powerdomain of evaluations. In Proc. of LICS'89, IEEE Press 186–195.Google Scholar
Jung, A. and Tix, R. (1998) The troublesome probabilistic powerdomain. In: Edalat, A., Jung, A., Keimel, K. and Kwiatkowska, M. (eds.) Proc. of Comprox III. Electronic Notes in Theoretical Computer Science 13 70–91.CrossRefGoogle Scholar
Keimel, K. and Gierz, G. (1982) Halbstetige Funktionen und stetige Verbände. In: Hoffmann, R.-E. (ed.) Continuous Lattices and Related Topics, Mathematik Arbeitspapiere Nr. 27, Universität Bremen 59–67.Google Scholar
Kirch, O. (1993) Bereiche und Bewertungen. Master's thesis, Technische Hochschule Darmstadt. (Available at www.mathematik.tu-darmstadt.de:8080/ags/ag14/papers/kirch/.)Google Scholar
Kutateladze, S. S. and Rubinov, A. M. (1972) Minkowski duality and its applications. Russian Mathematical Surveys 27 (3)137–191.CrossRefGoogle Scholar
Maaβ, S. (2002) Exact functionals and their core. Statistical Papers 43 (1)75–93.CrossRefGoogle Scholar
McIver, A. and Morgan, C. (2001a) Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica 37 329–354.CrossRefGoogle Scholar
McIver, A. and Morgan, C. (2001b) Partial correctness for probabilistic demonic programs. Theoretical Computer Science 266 513–541.CrossRefGoogle Scholar
McIver, A. and Morgan, C. (2005) Abstraction, Refinement and Proof for Probabilistic Systems, Monographs in Computer Science, Springer Verlag.Google Scholar
McIver, A., Morgan, C. and Seidel, K. (1996) Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18 325–353.Google Scholar
Minkowski, H. (1903) Volumen und Oberfläche. Mathematische Annalen 57 447–495.CrossRefGoogle Scholar
Plotkin, G. D. (1980) Dijkstra's predicate transformers and Smyth's power domains. In: Bjorner, D. (ed.) Abstract Software Specifications. Springer-Verlag Lecture Notes in Computer Science 86 527–553.CrossRefGoogle Scholar
Plotkin, G. D. (2006) A Domain-Theoretic Banach–Alaoglu Theorem. Mathematical Structures in Computer Science 16 299–312.CrossRefGoogle Scholar
Rockafellar, R. T. (1972) Convex Analysis, Princeton University Press.Google Scholar
Smyth, M. B. (1983) Power domains and predicate transformers: a topological view. In: Díaz, J. (ed.) Proc. of 10th ICALP. Springer-Verlag Lecture Notes in Computer Science 154 662–675.CrossRefGoogle Scholar
Tix, R. (1995) Stetige Bewertungen auf topologischen Räumen. Master's thesis, Technische Hochschule Darmstadt. (Available at www.mathematik.tu-darmstadt.de:8080/ags/ag14/papers/tix/.)Google Scholar
Tix, R., Keimel, K. and Plotkin, G. D. (2008) Semantic Domains for Combining Probability and Non-Determinism. Electronic Notes in Theoretical Computer Science 222 1–104.CrossRefGoogle Scholar
Tolstogonov, A. A. (1976) Support functions of convex compacta (in Russian). Matematicheskie Zametki 22 203–213. (English translation in: Mathematical Notes 22 604–612.)Google Scholar
Walley, P. (1991) Statistical Inference with Imprecise Probabilities, Chapman and Hall.Google Scholar
Ying, M. (2003) Reasoning about probabilistic sequential programs in a probabilistic logic. Acta Informatica 39 315–389.CrossRefGoogle Scholar