In: Lecture Notes in Computer Science : Petri Nets and Other Models of Concurrency - ICATPN 2006, Volume 4024, 2006, pages 221-240. 2006. URL: http://dx.doi.org/10.1007/1176758913.
Abstract: In this work, we address the problem of transient and steady-state analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but without any additional constraint. Rather than computing an approximate distribution of the model (as done in previous methods), we develop an exact analysis of an approximate model. The design of this method leads to a uniform handling of the computation of the transient and steady state behaviour of the model. This method is an adaptation of a former one developed by the same authors for general stochastic processes (which was shown to be more robust than alternative techniques). Using Petri nets as the modelling formalism enables us to express the behaviour of the approximate process by tensorial expressions. Such a representation yields significant savings w.r.t. time and space complexity.
Back to the Petri Nets Bibliography