HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Truly Concurrent Synchronization of Markov Chains

Samy Abbes 1 Albert Benveniste 2
2 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We study the synchronization of two discrete Markov chains that share common states. Markov chains define transition systems, and we consider the synchronization product of these from the partial orders viewpoint. We propose a randomization of the new, concurrent system. The random concurrent system we construct has two key properties: first it is Markovian, and second it has a local independence property, meaning that local processes are, in the probabilistic sense, conditionally independent. We compare this construction with the product of Probabilistic Automata.
Document type :
Complete list of metadata

Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Friday, September 28, 2007 - 9:31:55 AM
Last modification on : Friday, February 4, 2022 - 3:23:05 AM
Long-term archiving on: : Monday, September 24, 2012 - 12:51:23 PM


Files produced by the author(s)


  • HAL Id : inria-00175408, version 1


Samy Abbes, Albert Benveniste. Truly Concurrent Synchronization of Markov Chains. [Research Report] PI 1866, 2007, pp.20. ⟨inria-00175408⟩



Record views


Files downloads