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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.V. BURRILL, "Measure, integration and probability". Mc.Graw Hill (1970).
D. FRUTOS ESCRIG, "A characterization of Plotkin's order in powerdomains and some of its properties" TCS 31 (1984).
D. FRUTOS ESCRIG, "Algunas cuestiones relacionadas con la semántica de construcciones probabilísticas" Tesis doctoral. Madrid, july 1985.
G. PLOTKIN, "A powerdomain construction" SIAM J. Comput. 5 (1976).
N. SAHEB-DJAHROMI, "CPO's of measures for nondeterminism" TCS 12 (1980).
D. SCOTT, "Domains for denotational semantics", ICALP-82 LNCS 140 Springer-Verlag, (1982).
M. SMYTH, "Powerdomains", J.C.S.S. 16 (1978).
M. SMYTH & G. PLOTKIN, "Category theoretic solution of recursive domain equations" SIAM J. Comput. 11,4 (1982).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Escrig, D.F. (1985). 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. https://doi.org/10.1007/3-540-16078-7_64
Download citation
DOI: https://doi.org/10.1007/3-540-16078-7_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16078-6
Online ISBN: 978-3-540-39758-8
eBook Packages: Springer Book Archive