Probabilistic Cluster Unfoldings for Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

Probabilistic Cluster Unfoldings for Petri Nets

Stefan Haar


This article introduces a probabilistic unfolding semantics for untimed Petri nets. No structural or safety assumptions are made. We show that cluster semantics is an adequate framework for the construction of probability measures for concurrent runs. The unfolding semantics is constructed by local choices on each cluster, and a distributed scheduling mechanism (cluster net) authorizing cluster actions. The probability measures for the choice of step in a cluster are obtained by constructing Markov Fields on the conflict graph of transitions, from suitable Gibbs potentials. We introduce and characterize stopping times for these models, and a strong Markov property.
Fichier principal
Vignette du fichier
RR-4426.pdf (520.81 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00072162 , version 1


Stefan Haar. Probabilistic Cluster Unfoldings for Petri Nets. [Research Report] RR-4426, INRIA. 2002. ⟨inria-00072162⟩
60 View
50 Download


Gmail Facebook Twitter LinkedIn More