Truly Concurrent Synchronization of Markov Chains
Résumé
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.
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|