Performance and Reliability Analysis Using Directed Acyclic Graphs
IEEE Transactions on Software Engineering
Markov and Markov-regenerative PERT networks
Operations Research
Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector
IEEE Transactions on Software Engineering
Stochastic Bounds on Execution Times of Parallel Programs
IEEE Transactions on Software Engineering
Optimal reduction of two-terminal directed acyclic graphs
SIAM Journal on Computing
Parallel simulation of stochastic Petri nets using recurrence equations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Some Analysis Techniques for Asynchronous Multiprocessor Algorithms
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
The computation of transitions firing rates of a stochastic event graph is equivalent to the computation of the completion time of some PERT network. We describe a low polynomial complexity algorithm that provides bounds and approximation of any firing rate using properties of integral orderings among random variables. We test the algorithm on some examples and discuss its use for the computation of the network cycle time.