Markov Nets: Probabilistic Models for Distributed and Concurrent Systems. - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Automatic Control Année : 2003

Markov Nets: Probabilistic Models for Distributed and Concurrent Systems.

Albert Benveniste
Stefan Haar

Résumé

For distributed systems, i.e., large complex networked 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. In this paper, motivated by the monitoring of distributed systems and in particular of telecommunications networks, we develop a generalization of Markov chains and hidden Markov models 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 neither global state nor global time are available. Instead, we use only local states in combination with a partial order model of time. Our basic mathematical tool is that of Petri net unfoldings.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
BFH-tac03.pdf (383.82 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

inria-00638221 , version 1 (04-11-2011)

Identifiants

Citer

Albert Benveniste, Eric Fabre, Stefan Haar. Markov Nets: Probabilistic Models for Distributed and Concurrent Systems.. IEEE Transactions on Automatic Control, 2003, 48 (11), pp.1936-1950. ⟨10.1109/TAC.2003.819076⟩. ⟨inria-00638221⟩
102 Consultations
164 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More