In this paper we use Stochastic Petri Nets (SPNs) to study the interaction of multiple TCP sources that share one or two buffers, thereby considerably extending earlier work. We first consider two sources sharing a buffer and investigate the consequences of two popular assumptions for the loss process in terms of fairness and link utilization. The results obtained by our model are in agreement ...

I n this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such a n approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. W e first characterize the class of stochastic Petri nets of interest by formally defining ...

Generalizedd StochasticPetriNetsprovidethe modeller withh immediate transitions, but aa model will be correct only if the modeller cann specify how too solve the firingg conflicts betweenn these transitions. This task is usually cumbersome andd may be impossible for large nets. Inn confusion-free nets, these conflict sets are subsets of equivalence classes of aa structural conflict relation, wh...

In this paper we present and compare two diier-ent approaches for the transient solution of Markov regenerative stochastic Petri Nets: the method based on Markov regenerative theory and the method of supplementary variables. In both cases the equations that govern the marking process of the non-Markovian stochastic Petri net are presented and then solved either in time-domain or using a Laplace...

We consider asynchronously composed I/O-Petri nets (AIOPNs) with built-in communication channels. They are equipped with a compositional semantics in terms of asynchronous I/O-transition systems (AIOTSs) admitting infinite state spaces. We study various channel properties that deal with the production and consumption of messages exchanged via the communication channels and establish useful rela...

Generalized Stochastic Petri Nets (GSPN) and Stochastic Process Algebras (SPA) can both be used to study functionality as well as performance of parallel and distributed systems. In order to provide insight into the similarities and diierences between the formalisms, we study the model construction process in both by means of a large example, a distributed electronic mail system. This compariso...

This paper addresses the computation of lower bounds for the steady-state throughput of stochas-tic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by con...

Some insight on the meaning of \modeling power" for Stochastic Petri Net models is given. Extensions characterizing a Stochastic Petri Net are categorized as logical or stochas-tic. Three logical constructs are shown to be equivalent: inhibitor arcs, transition priorities, and enabling functions associated with the transitions. A direct transformation of Petri Nets with inhibitor arcs into Petr...

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th ...