Flow analysis of stochastic marked graphs

The discrete-event systems called stochastic marked graphs (SMGs) are investigated from a stability point of view. Being a special class of timed Petri nets with stochastic firing times, they are studied under the assumption of ergodicity of flow of their free strongly connected components, which is a milder behavior assumption than that of Markovian behavior. The asymptotic behavior of SMGs at large times (steady state) is studied, and the average flow of tokens in the system is specified.<>