000052583 001__ 52583
000052583 005__ 20190125164354.0
000052583 037__ $$aREP_WORK
000052583 088__ $$a200376
000052583 245__ $$aWhat Good are Probabilistic Specifications and What Probabilistic Specifications are Good?
000052583 269__ $$a2003
000052583 260__ $$c2003
000052583 336__ $$aReports
000052583 520__ $$aThe number of probabilistic approaches to ``classic'' distributed systems problems such as reliable broadcast, consensus, or leader election, has further increased recently. Probabilistic algorithms, possibly starting from probabilistic system models, have been motivated by the need for practicable solutions to such problems, circumventing bottlenecks and limitations inherent to distributed computing. While many approaches coming out of this revival of probabilistic approaches are indeed pathbreaking, it is legitimate to question the usefulness of certain efforts, which claim some form of probabilistic reliability, yet fail to provide clear specifications of the proposed algorithms. In this paper, we point out the inherent difficulties related to the specification of the behavior of probabilistic algorithms through various examples.
000052583 6531_ $$aProbabilistic Specifications
000052583 700__ $$aEugster, Patrick Th.
000052583 909CO $$pIC$$preport$$ooai:infoscience.tind.io:52583
000052583 909C0 $$xU10407$$0252114$$pDCL
000052583 937__ $$aLPD-REPORT-2003-013
000052583 970__ $$a200376/IC
000052583 973__ $$aEPFL
000052583 980__ $$aREPORT