Ergodic theory of stochastic decision free Petri nets

Abstract

The class of decision-free Petri nets under stochastic timing assumptions, also known as stochastic event graphs, is considered. Under the assumption that the variables used for the timing of an event graph form stationary and ergodic sequences of random variables, use is made of an associated stochastic recursive equation in order to construct the event graph's stationary and ergodic regime. In particular, the conditions under which the existence of this regime is guaranteed are determined. >