HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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 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.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 7:56:50 PM
Last modification on : Friday, February 4, 2022 - 3:23:40 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:56:16 PM


  • HAL Id : inria-00072162, version 1


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



Record views


Files downloads