Stationary regime and stability of free-choice Petri nets

The aim of this paper is to give conditions under which a class of stochastic Petri nets called free choice nets satisfy a set of monotonicity and separability conditions ensuring the existence of a finite stationary regime for the marking process (or a finite periodic regime in the deterministic case). The scheme of conflict resolution is via a stochastic routing sequence. This assumption is essential for ensuring basic monotonicity properties. The main tools for proving these properties is ergodic theory.