On generation of state space for timed Petri nets

Zuberek, W.M.

Proc. ACM 16-th Annual Computer Science Conference (CSC'88); Atlanta, GA, February 1988, pp.239-248.

Abstract:

It is shown that the behavior of timed Petri nets with deterministic firing (D-timed Petri nets) and nets with exponentially distributed firing times (M-timed nets) can be described within one uniform formalism. Moreover, for both classes of nets the state spaces are homogeneous semi-Markov chains, the stationary probabilities of states and many performance measures can thus be obtained by standard techniques developed for analysis of Markov processes. Because of sparsity of nets as well as corresponding systems of equilibrium equations, list structure representations are proposed, and a general procedure for generation of the state space is outlined to show the required processing of list structures.

Keywords:

Timed Petri nets, state space generation, Markov processes, Markov chains, stationary probabilities.

References:

Available in pdf and postscript.