Markov chains competing for transitions: application to large-scale distributed systems

DOI10.1007/S11009-011-9239-6zbMath1281.60065OpenAlexW2060793080MaRDI QIDQ352904

Emmanuelle Anceaume, Bruno Sericola, Romaric Ludinard, Francois Castella

Publication date: 5 July 2013

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-011-9239-6

zbMATH Keywords

absorbing Markov chainscomposition of Markov chainsfirst time until absorption

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40)

Uses Software

• Chord

Cites Work

• Automata, Languages and Programming
• Algorithms – ESA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Markov chains competing for transitions: application to large-scale distributed systems