Paper Info
Title
An efficient algorithm for the transient analysis of a class of deterministic stochastic Petri nets
Abstract
In this paper a new algorithm for the transient solution of a sub-class of deterministic stochastic Petri nets (DSPN) is proposed. The technique can be applied to DSPNs comprising only deterministic and immediate transitions and such that in each tangible marking only one deterministic transition is enabled. The algorithm does not require any additional restriction on the deterministic transition delays that can have any positive real value. Most of the optimized algorithms presented in the literature are based on an efficient solution of the equations governing the stochastic process associated with the DSPN; the new algorithm we propose is based on an efficient combinatorial analysis of the paths within the state space underlying the DSPN, instead.
Year
DOI
Venue
2004
10.1109/DSN.2004.1311954
DSN
Keywords
Field
DocType
Petri nets,deterministic algorithms,stochastic processes,transient analysis,combinatorial analysis,deterministic Petri nets,stochastic Petri nets,stochastic processes,transient analysis
Stochastic optimization,Petri net,Computer science,Stochastic process,Algorithm,Stochastic Petri net,Theoretical computer science,Deterministic algorithm,Transient analysis,Combinatorial analysis,State space
Conference
ISBN
Citations 
PageRank 
0-7695-2052-9
1
0.36
References 
Authors
6
2
Name
Order
Citations
PageRank
M. Gribaudo120915.51
Matteo Sereno238837.24