Results 1 
8 of
8
A Class of Generalized Stochastic Petri Nets for the Performance Analysis of Multiprocessor Systems
 ACM Trans. on Comp. Systems
, 1984
"... A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems ..."
Abstract

Cited by 308 (4 self)
 Add to MetaCart
(Show Context)
A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems
Stochastic petri nets: An elementary introduction
 In Advances in Petri Nets
, 1989
"... ABSTRACT Petri nets in which random firing delays are associated with transitions whose ..."
Abstract

Cited by 66 (0 self)
 Add to MetaCart
(Show Context)
ABSTRACT Petri nets in which random firing delays are associated with transitions whose
How to Specify and Verify the LongRun Average Behavior of Probabilistic Systems
 In Proc. LICS'98
, 1998
"... Longrun average properties of probabilistic systems refer to the average behavior of the system, measured over a period of time whose length diverges to infinity. These properties include many relevant performance and reliability indices, such as system throughput, average response time, and mean t ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
(Show Context)
Longrun average properties of probabilistic systems refer to the average behavior of the system, measured over a period of time whose length diverges to infinity. These properties include many relevant performance and reliability indices, such as system throughput, average response time, and mean time between failures. In this paper, we argue that current formal specification methods cannot be used to specify longrun average properties of probabilistic systems. To enable the specification of these properties, we propose an approach based on the concept of experiments. Experiments are labeled graphs that can be used to describe behavior patterns of interest, such as the request for a resource followed by either a grant or a rejection. Experiments are meant to be performed infinitely often, and it is possible to specify their longrun average outcome or duration. We propose simple extensions of temporal logics based on experiments, and we present modelchecking algorithms for the verif...
Stochastic PiCalculus With General Distributions
 in Proc. of the 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), CLUT
, 1996
"... In this study we extend stochastic ßcalculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used to ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this study we extend stochastic ßcalculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used to compute the residual life times of parallel activities that are not immediately selected when enabled. The policy according to which residual life times are computed is the enabling memory introduced for stochastic Petri nets and also implemented in TIPP through the mechanism of start references. 1 Introduction Many researchers advocate the need of integrating behavioural and performance analysis since the early stages of design of complex systems. This problem is even presented as a challenge for the future of computer science in [11]. The widespread dissemination of distributed systems and the paradigm of mobile computing makes the above integration essential. In fact, a design error whic...
Integrating performance analysis in the context of LOTOSbased design
 In Proc. of MASCOTS'94
, 1994
"... ..."
On the Simulation of Stochastic Petri Nets
"... Stochastic Petri Nets are well suited for the modelbased performance and dependability evaluation of complex systems. In the past few years, many papers have been published dealing with the transient and steadystate analysis of all kinds of SPNs. However, because of the use of analytical methods ..."
Abstract
 Add to MetaCart
Stochastic Petri Nets are well suited for the modelbased performance and dependability evaluation of complex systems. In the past few years, many papers have been published dealing with the transient and steadystate analysis of all kinds of SPNs. However, because of the use of analytical methods, there are at least two limits: in most work related to Markov theory, including DTMCs and CTMCs, the researchers had to restrict the transitions to geometric or exponential distributions to ensure the memoryless property; another potential problem comes from the model size, since the state space will become too large to be stored in the computer main memory when the model size increases. Discrete event simulation can avoid these problems: simulation can deal with general distributions just as well as memoryless distributions and, for very large systems, simulation will simply take longer in terms of CPU time. However, in order to complete simulation experiments involving large model...
Deriving models of a preemptable process using Petri nets
"... Modelling a realtime system includes modelling each process of the system. Such a process commences at some instant, executes for a constant period and at the end of this period the process terminates. Furthermore, the process can be preempted prior to completing its execution. Two Petri net model ..."
Abstract
 Add to MetaCart
Modelling a realtime system includes modelling each process of the system. Such a process commences at some instant, executes for a constant period and at the end of this period the process terminates. Furthermore, the process can be preempted prior to completing its execution. Two Petri net models of such a process is described in this paper. The first contains a new transition type, called an xtransition, which can remove unavailable tokens from a timed place. This is required when modelling preemption of the process. Using xtransitions the operation of the model is quite easy to understand. The second model uses normal transitions only and has been produced to compare the two models. The second was more difficult to produce than the first. It has more components and is more complicated than the first model. 2 1 Introduction The modelling of a typical preemptable process using Petri nets is described in this paper. Such a process commences at some instant, executes for a perio...