Results 1  10
of
53
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
GreatSPN 1.7: GRaphical Editor and Analyzer for Timed and Stochastic Petri Nets
, 1995
"... This paper describes the GreatSPN 1.7 package for the modeling, validation, and performance evaluation of distributed systems using Generalized Stochastic Petri Nets and their colored extension. The tool provides a friendly framework to experiment with timed Petri net based modeling techniques. It i ..."
Abstract

Cited by 95 (17 self)
 Add to MetaCart
(Show Context)
This paper describes the GreatSPN 1.7 package for the modeling, validation, and performance evaluation of distributed systems using Generalized Stochastic Petri Nets and their colored extension. The tool provides a friendly framework to experiment with timed Petri net based modeling techniques. It implements efficient analysis algorithms to allow its use on "real" applications, not only toy examples. Developed in a University for non profit purposes, it is distributed free of charge to other universities for educational and research purposes. An overview of the complete architecture of the package is given together with examples of its application. Then the various analysis and simulation modules are described. 1 Introduction GreatSPN 1.7 is a tool for the modeling and analysis of systems, based on the Petri net formalism. In this paper we first briefly describe the historical evolution of the package, which explains the reasons for some implementation choices as well as the intended p...
Reward Model Solution Methods With Impulse And Rate Rewards: An Algorithm And Numerical Results
, 1994
"... This thesis has been submitted in partial fulfillment of requirements for an advanced ..."
Abstract

Cited by 34 (6 self)
 Add to MetaCart
(Show Context)
This thesis has been submitted in partial fulfillment of requirements for an advanced
DISCRETETIME MARKOVIAN STOCHASTIC PETRI NETS
, 1995
"... We revisit and extend the original definition of discretetime stochastic Petri nets, by allowing the firing times to have a “defective discrete phase distribution”. We show that this formalism still corresponds to an underlying discretetime Markov chain. The structure of the state for this process ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
(Show Context)
We revisit and extend the original definition of discretetime stochastic Petri nets, by allowing the firing times to have a “defective discrete phase distribution”. We show that this formalism still corresponds to an underlying discretetime Markov chain. The structure of the state for this process describes both the marking of the Petri net and the phase of the firing time for of each transition, resulting in a large state space. We then modify the wellknown power method to perform a transient analysis even when the state space is infinite, subject to the condition that only a finite number of states can be reached in a finite amount of time. Since the memory requirements might still be excessive, we suggest a bounding technique based on truncation.
A formal definition of dataflow graph models
 IEEE Trans. Comput
, 1986
"... AbstractIn this paper, a new model for parallel computations and parallel computer systems that is based on data flow principles is presented. Uninterpreted data flow graphs can be used to model computer systems including data driven and parallel processors. A data flow graph is defined to be a bi ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
(Show Context)
AbstractIn this paper, a new model for parallel computations and parallel computer systems that is based on data flow principles is presented. Uninterpreted data flow graphs can be used to model computer systems including data driven and parallel processors. A data flow graph is defined to be a bipartite graph with actors and links as the two vertex classes. Actors can be considered similar to transitions in Petri nets, and links similar to places. The nondeterministic nature of uninterpreted data flow graphs necessitates the derivation of liveness conditions. Index TermsBipartite graphs, data flow graphs, deadlocks, liveness, parallel computations, Petri nets. I.
Recent Developments in NonMarkovian Stochastic Petri Nets
, 1998
"... Analytical modeling plays a crucial role in the analysis and design of computer systems. Stochastic Petri Nets represent a powerful paradigm, widely used for such modeling in the context of dependability, performance and performability. Many structural and stochastic extensions have been proposed in ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
Analytical modeling plays a crucial role in the analysis and design of computer systems. Stochastic Petri Nets represent a powerful paradigm, widely used for such modeling in the context of dependability, performance and performability. Many structural and stochastic extensions have been proposed in recent years to increase their modeling power, or their capability to handle large systems. This paper reviews recent developments by providing the theoretical background and the possible areas of application. Markovian Petri nets are first considered together with very well established extensions known as Generalized Stochastic Petri nets and Stochastic Reward Nets. Key ideas for coping with large state spaces are then discussed. The challenging area of nonMarkovian Petri nets is considered, and the related analysis techniques are surveyed together with the detailed elaboration of an example. Finally new models based on Continuous or Fluid Stochastic Petri Nets are briefly discussed.
Petri Nets for Modelling Metabolic Pathways: A Survey
"... Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. We point out the main problems that arise in the construction of a Petri net model of a metabolic pathway and we outline some solutions proposed in the literature. Second, we present a comprehensive review of recent research on this topic, in order to assess the maturity of the field and the availability of a methodology for modelling a metabolic pathway by a corresponding Petri net. 1
Welldefined stochastic Petri nets, in
 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS ’96, IEEE Computer Society
, 1996
"... ..."
(Show Context)
Time processes of time Petri nets
 IN APPLICATIONS AND THEORY OF PETRI NETS
, 1996
"... The objective of this thesis is to give time Petri nets a partial order semantics, like the nonsequential processes of untimed net systems. A time process of a time Petri net is defined as a traditionally constructed causal process with a valid timing. This means that the events of the process are l ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
The objective of this thesis is to give time Petri nets a partial order semantics, like the nonsequential processes of untimed net systems. A time process of a time Petri net is defined as a traditionally constructed causal process with a valid timing. This means that the events of the process are labeled with occurrence times which must satisfy specific validness criteria. An efficient algorithm for checking validness of known timings is presented. Interleavings of the time processes are defined as linearizations of the causal partial order of events where also the time order of events is preserved. The relationship between firing schedules of a time Petri net and the interleavings of the time processes of the net is shown to be bijective. Also, a sufficient condition is given for when the invalidity of timings for a process can be inferred from its initial subprocess. An alternative characterization for the validness of timings results in an algorithm for constructing the set of all vali...