Concurrency, sigma-algebras and probabilistic fairness

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

We give an interpretation through sigma-algebras of phenomena encountered in concurrency theory when dealing with "infinite confusion"--the extreme opposite of confusion-free event structures. The set of runs of a safe Petri net is equipped with its Borel sigma-algebra F. The fine structure of F describes the complexity of choices along runs, and we show that a transfinite induction of finite degree is needed to explore all choices of runs in general. The degree is minimal (zero) when confusion is bounded, corresponding to the classes of confusion free and locally finite event structures. We relate this construction to probabilistic fairness by showing how to randomize the net equipped with its Borel sigma-algebra by using only the first step of our decomposition, and making it thus more effective. Hence the serious difficulty brought by the above transfiniteness in the application of Kolmogorov extension theorem is bypassed thanks to probabilistic fairness

Domains: Networking and Internet Architecture [cs.NI]

Samy Abbes, Albert Benveniste. Concurrency, sigma-algebras and probabilistic fairness. FOSSACS 2009, Mar 2009, York, United Kingdom. pp.380-394. ⟨hal-00267518v4⟩