Some probabilistic powerdomains in the category SFP

  • D. Frutos Escrig
Contributed Papers

DOI: 10.1007/3-540-16078-7_64

Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)
Cite this paper as:
Escrig D.F. (1986) Some probabilistic powerdomains in the category SFP. In: Monien B., Vidal-Naquet G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg

Abstract

We define and study some definitions of probabilistic powerdomains over domains in SFP. We give three definitions: the first one is based in the notion of probability distribution over a domain; the second in probabilistic generating trees, that generalize the notion of generating tree, introduced by Smyth; and the last in "informations about probability distributions", that we introduce, getting an information system, as defined by Scott.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • D. Frutos Escrig
    • 1
  1. 1.Dpto. Ecuaciones Funcionales Fac. C. MatemáticasUniversidad ComplutenseMadridSpain

Personalised recommendations