Results 1 
5 of
5
Probabilistic trueconcurrency models: branching cells and distributed probabilities, in "Information and Computation
, 2006
"... This paper is devoted to trueconcurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finit ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper is devoted to trueconcurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild condition, confusionfree event structures are locally finite. In locally finite event structures, maximal configurations can be tiled with branching cells: branching cells are minimal and finite substructures capturing the choices performed while scanning a maximal configuration. A probabilistic event structure (p.e.s.) is a pair (E, P), where E is a prime event structure and P is a probability on the space of maximal configurations of E. We introduce the new class of distributed probabilities for p.e.s.: distributed probabilities are such that random choices in
Trueconcurrency probabilistic models Branching cells and distributed probabilities for event structures
, 2006
"... ..."
doi:10.1017/S096012950700607X Printed in the United Kingdom A projective formalism applied to topological and
, 2004
"... This paper introduces projective systems for topological and probabilistic event structures. The projective formalism is used for studying the domain of configurations of a prime event structure and its space of maximal elements. This is done from both a topological and a probabilistic viewpoint. We ..."
Abstract
 Add to MetaCart
(Show Context)
This paper introduces projective systems for topological and probabilistic event structures. The projective formalism is used for studying the domain of configurations of a prime event structure and its space of maximal elements. This is done from both a topological and a probabilistic viewpoint. We give probability measure extension theorems in this framework. 1.
www.elsevier.com/locate/tcs Projective topology on bifinite domains and applications
"... 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 theo ..."
Abstract
 Add to MetaCart
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. © 2006 Elsevier B.V. All rights reserved.
unknown title
, 2004
"... A projective formalism applied to topoligical and probabilistic event structures ..."
Abstract
 Add to MetaCart
(Show Context)
A projective formalism applied to topoligical and probabilistic event structures