Information and Computation
Almost Every Domain is Universal
Electronic Notes in Theoretical Computer Science (ENTCS)
A projective formalism applied to topological and probabilistic event structures
Mathematical Structures in Computer Science
True-concurrency probabilistic models: Markov nets and a law of large numbers
Theoretical Computer Science
Hi-index | 0.00 |
We revisit extension results from continuous valuations to Radon measures for bifinite domains. In the framework of bifinite domains, the Prokhorov theorem (existence of projective limits of Radon measures) appears as a natural tool, and helps building a bridge between Measure theory and Domain theory. The study we present also fills a gap in the literature concerning the coincidence between projective and Lawson topology for bifinite domains. Motivated by probabilistic considerations, we study the extension of measures in order to define Borel measures on the space of maximal elements of a bifinite domain.