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 : 2003

Probabilistic Cluster Unfoldings for Petri Nets

Stefan Haar


This article introduces probabilistic cluster branching processes, a probabili- stic unfolding semantics for untimed Petri nets with no structural or safety assumptions. The unfolding is constructed by local choices on each cluster (conflict closed subnet), while the authorization for cluster actions is governed by a stochastic trace, the policy. The probabilistic model for this semantics yields probability measures for concurrent runs. We introduce and characterize stopping times for this model, and prove a strong Markov property. Particularly adequate probability measures for the choice of step in a cluster, as well as for the policy, are obtained by constructing Markov Fields from suitable marking-dependent Gibbs potentials.
Fichier principal
Vignette du fichier
RR-4755.pdf (581.51 Ko) Télécharger le fichier

Dates and versions

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


  • HAL Id : inria-00071831 , version 1


Stefan Haar. Probabilistic Cluster Unfoldings for Petri Nets. [Research Report] RR-4755, INRIA. 2003. ⟨inria-00071831⟩
70 View
47 Download


Gmail Facebook X LinkedIn More