Markov Nets: Probabilistic Models for Distributed and Concurrent Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Markov Nets: Probabilistic Models for Distributed and Concurrent Systems

Albert Benveniste
Eric Fabre
Stefan Haar


For distributed systems, i.e. large networked complex systems, there is a drastic difference between a local view and knowledge of the system, and its global view. Distributed systems have local state and time, but do not possess global state and time in the usual sense: it is simply not possible to determine, at any given instant, what the current global state of a telecommunication network is. In this paper, motivated by the monitoring of distributed systems and in particular of telecommunications networks, we develop an extension of Markov chains and hidden Markov models (HMM) for distributed and concurrent systems. By a concurrent system, we mean a system in which components may evolve independently, with sparse synchronizations. We follow a so-called true concurrency approach, in which no global state and no global time is available. Instead, we use only local states in combination with a partial order model of time, in which local events are ordered if they are either generated on the same site, or related via some causality relation. Our basic mathematical tool is that of Petri net unfoldings.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4253.pdf (579.48 Ko) Télécharger le fichier

Dates and versions

inria-00072335 , version 1 (23-05-2006)


  • HAL Id : inria-00072335 , version 1


Albert Benveniste, Eric Fabre, Stefan Haar. Markov Nets: Probabilistic Models for Distributed and Concurrent Systems. [Research Report] RR-4253, INRIA. 2001. ⟨inria-00072335⟩
83 View
191 Download


Gmail Facebook Twitter LinkedIn More