Probabilistic Cluster Unfoldings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Fundamenta Informaticae Year : 2002

Probabilistic Cluster Unfoldings

Stefan Haar

Abstract

This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, giving probability measures for concurrent runs. 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, that authorizes cluster actions. We introduce and characterize stopping times for these models, and prove a strong Markov property. Particularly adaquate 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.

Domains

Other [cs.OH]
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00638276 , version 1

Cite

Stefan Haar. Probabilistic Cluster Unfoldings. Fundamenta Informaticae, 2002, 53 (3-4), pp.281-314. ⟨inria-00638276⟩
31 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More