Skip to Main content Skip to Navigation
Reports

Probabilistic Cluster Unfoldings for Petri Nets

Stefan Haar 1
1 SIGMA2 - Signal, models, algorithms
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : 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.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071831
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:55:19 PM
Last modification on : Thursday, February 11, 2021 - 2:48:05 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:40:15 PM

Identifiers

  • HAL Id : inria-00071831, version 1

Citation

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

Share

Metrics

Record views

179

Files downloads

232