Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures

Samy Abbes (1) , Albert Benveniste (2)

1 PPS - Preuves, Programmes et Systèmes
2 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems

This paper is devoted to probabilistic models for concurrent systems under their true-concurrency seman- tics. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite, that extend confusion-free event structure. In locally finite event structures, maximal configurations can be tiled with branching cells: branching cells are minimal and finite sub-structures capturing the choices performed while scanning a maximal configuration. The probabilistic event structures that we introduce have the property that concurrent processes are independent in the probabilistic sense.

Mots clés: Probabilistic event structure; measure extension theorem; branching cell

Domaines: Réseaux et télécommunications [cs.NI]

Samy Abbes, Albert Benveniste. Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures. Information and Computation, 2006, 204 (2), pp.231-274. ⟨hal-00350226⟩