Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Concurrency, -Algebras, and Probabilistic Fairness
 

Summary: Concurrency, -Algebras,
and Probabilistic Fairness
Samy Abbes and Albert Benveniste
1
PPS/Universit´e Paris 7 Denis Diderot. 175, rue du Chevaleret, 75013 Paris, France
samy.abbes@pps.jussieu.fr
http://www.pps.jussieu.fr/abbes
2
INRIA/IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
Albert.Benveniste@inria.fr
http://www.irisa.fr/distribcom/benveniste
Abstract. We extend previous constructions of probabilities for a prime
event structure E by allowing arbitrary confusion. Our study builds on
results related to fairness in event structures that are of interest per se.
Executions of E are captured by the set of maximal configurations.
We show that the information collected by observing only fair executions
of E is confined in some -algebra F0, contained in the Borel -algebra F
of . Equality F0 = F holds when confusion is finite (formally, for the
class of locally finite event structures), but inclusion F0 F is strict in
general. We show the existence of an increasing chain F0 F1 F2 . . .

  

Source: Abbes, Samy - Laboratoire Preuves, Programmes et Systèmes, Université Paris 7 - Denis Diderot

 

Collections: Computer Technologies and Information Sciences