Product form equilibrium distributions and a convolution algorithm for stochastic Petri nets
References (35)
- et al.
Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation
(1987) - et al.
Markovian petri net protocols with product form solution
Performance Evaluation
(1991) - et al.
Open, closed and mixed networks of queues with different classes of customers
J. ACM
(1975) - et al.
Spatial birth-death processes with multiple changes and applications to batch service networks and clustering processes
Computational algorithms for closed queueing networks with exponential servers
Comm. ACM
(1973)A software package for the analysis of generalised stochastic petri net models
- et al.
SPNP: Stochastic Petri net package
- et al.
A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference
IEEE Trans. Comm.
(1994) - et al.
Product form equilibrium distributions and an algorithm for classes of batch movement queueing networks and stochastic Petri nets
- et al.
RECAL — A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks
J. ACM
(1986)
Mean value analysis by chain of product form queueing networks
IEEE Trans. Comput.
(1989)
Reachability in reversible free-choice systems
Product form solutions for closed synchronized systems of stochastic sequential processes
Product form closed synchronized systems of stochastic sequential processes: A convolution algorithm
(1992)
Closed queueing systems with exponential servers
Oper. Res.
(1967)
Product form in networks of queues with batch arrivals and batch services
Queueing Systems
(1990)
Embedded processes in stochastic petri nets
IEEE Trans. Software Engrg.
(1991)
Cited by (39)
Computation of the normalising constant for product-form models of distributed systems with synchronisation
2020, Future Generation Computer SystemsCitation Excerpt :However, this algorithm, in contrast with MDD-rec, is not applicable to any product-form SPN, but only to a subclass of S-invariant reachable SPNs. In this section, we first introduce the conditions required by S-invariant reachable SPNs and then we compare the convolution algorithm of [19] with the proposed algorithm MDD-rec. The following Lemma appears in [40] but with a different formulation, so we include it here for clarity.
Extending propositional dynamic logic for Petri nets
2014, Electronic Notes in Theoretical Computer ScienceAnalysis of stochastic Petri nets with signals
2012, Performance EvaluationA P- and T-invariant characterization of product form and decomposition in stochastic Petri nets
2012, Performance EvaluationMethodological construction of product-form stochastic Petri nets for performance evaluation
2012, Journal of Systems and SoftwareCitation Excerpt :Their SPN structure is shown in Fig. 12. In the original paper it was studied using the HT approach (Henderson et al., 1989; Coleman et al., 1996). We first identify the BBs shown in Fig. 13 using Algorithm 1.
Product-form and stochastic Petri nets: A structural approach
2005, Performance Evaluation
Copyright © 1996 Published by Elsevier B.V.