✦ LIBER ✦

Stopping times of distributed consensus protocols: A probabilistic analysis

✍ Scribed by Özalp Babaog̃lu

Book ID: 113163052
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 558 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90127-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A probabilistic polynomial-time process

A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols

✍ John C. Mitchell; Ajith Ramanathan; Andre Scedrov; Vanessa Teague 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 528 KB

A Probabilistic Polynomial-time Calculus

A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols: (Preliminary Report)

✍ J. Mitchell; A. Ramanathan; A. Scedrov; V. Teague 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We describe properties of a process calculus that has been developed for the purpose of analyzing security protocols. The process calculus is a restricted form of π-calculus, with bounded replication and probabilistic polynomial-time expressions allowed in messages and boolean tests. In order to avo

A Probabilistic Scheduler for the Analys

A Probabilistic Scheduler for the Analysis of Cryptographic Protocols

✍ Srečko Brlek; Sardaouna Hamadou; John Mullins 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Monotone runs of uniformly distributed i

Monotone runs of uniformly distributed integer random variables: A probabilistic analysis

✍ Guy Louchard 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Asymptotic distributions of continuous-t

Asymptotic distributions of continuous-time random walks: A probabilistic approach

✍ Marcin Kotulski 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 589 KB

Ascending runs of sequences of geometric

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis

✍ Guy Louchard; Helmut Prodinger 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Using a Markov chain approach and a polyomino-like description, we study some asymptotic properties of sequences of ascending runs of geometrically distributed random variables. We analyze the limiting trajectories, the number of runs and the run length distribution, the hitting time to a length k r