Results 1  10
of
439
Concurrent Generalized Petri Nets: Regenerative Conditions
 Proc. of the 9 th International Workshop on Petri Nets and Performance Models (PNPM01
, 2001
"... Concurrent Generalized Petri Nets (CGPN) have beenintroduced in [6, 12] as an extension of the class of Markov Regenerative Stochastic Petri Nets where at most one generally distributed timed transition is enabled in a marking[7]. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Concurrent Generalized Petri Nets (CGPN) have beenintroduced in [6, 12] as an extension of the class of Markov Regenerative Stochastic Petri Nets where at most one generally distributed timed transition is enabled in a marking[7].
A Framework for Comparing Models of Computation
 IEEE TRANSACTIONS ON COMPUTERAIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
, 1998
"... We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly o ..."
Abstract

Cited by 322 (67 self)
 Add to MetaCart
We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly
Petrify: a tool for manipulating concurrent specifications and . . .
"... Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original descripti ..."
Abstract

Cited by 219 (34 self)
 Add to MetaCart
Petrify is a tool for (1) manipulating concurrent specifications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original
Estimation of Delays in NonRegenerative Stochastic Petri Nets
, 1999
"... Many longrun delay characteristics of computer, communication, manufacturing, and transportation systems can be specified as timeaverage limits of sequences of delays in stochastic Petri nets (spn's). We consider spn's with general firing times in which sequences of delays are determined ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Many longrun delay characteristics of computer, communication, manufacturing, and transportation systems can be specified as timeaverage limits of sequences of delays in stochastic Petri nets (spn's). We consider spn's with general firing times in which sequences of delays
On the Synthesis of General Petri Nets
, 1996
"... A polynomial algorithm was given by the authors and Bernardinello for synthesizing pure weighted Petri nets from finite labeled transition systems. The limitation to pure nets, serious in practice e.g. for modelling waiting loops in communication protocols, may be removed by a minor adaptation of th ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
of the algorithm, working for general Petri nets fired sequentially. The rule of sequential firing reduces also the expressivity of Petri nets, since it forces a concurrent interpretation on every diamond. This limitation may also be removed by leaving sequential transition systems and lifting the algorithm
Analysis of Software Rejuvenation using Markov Regenerative Stochastic Petri Net
, 1995
"... In a clientserver type system, the server software is required to run continuously for very long periods. Due to repeated and potentially faulty usage by many clients, such software "ages" with time and eventually fails. Huang et. al. proposed a technique called "software rejuvenatio ..."
Abstract

Cited by 53 (22 self)
 Add to MetaCart
Petri Net (MRSPN) model which is solved both for steady state as well as transient conditions. We provide a closedform analytical solution for ...
Markov Regenerative Stochastic Petri Nets with Age Type General Transitions
 Application and Theory of Petri Nets (16th International Conference), Lecture Notes in Computer Science
, 1995
"... . Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently introduced in the literature with the aim of combining exponential and nonexponential ring times into a single model. However, the realizations of the general MRSPN model, so far discussed, require that at most a single nonexpo ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
. Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently introduced in the literature with the aim of combining exponential and nonexponential ring times into a single model. However, the realizations of the general MRSPN model, so far discussed, require that at most a single non
Generalized stochastic Petri nets: A definition at the net level and its implications
 IEEE Transactions on Software Engineering
, 1993
"... Abstmct The original proposals of several stochastic Petri net modeling techniques and of generalized stochastic Petri nets (GSPN) in particular were based mainly on the characteristics of their underlying stochastic processes. This led to the use of GSPN only as a shortened notation for the descri ..."
Abstract

Cited by 62 (9 self)
 Add to MetaCart
Abstmct The original proposals of several stochastic Petri net modeling techniques and of generalized stochastic Petri nets (GSPN) in particular were based mainly on the characteristics of their underlying stochastic processes. This led to the use of GSPN only as a shortened notation
Petri Nets with k Simultaneously Enabled Generally Distributed Timed Transistions
 Performance Evaluation
, 1998
"... Stochastic Petri nets have been used to analyze the performance and reliability of complex systems comprising concurrency and synchronization. Various extensions have been proposed in literature in order to broaden their field of application to an increasingly larger range of real situations. In thi ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
. In this paper we extend the class of Markov Regenerative Stochastic Petri Nets* (MRSPN*s), removing the restriction that at most one generally distributed timed transition can be enabled in any marking. This new class of Petri Nets, which we call Concurrent Generalized Petri Nets (CGPNs) allows simultaneous
Transient Analysis of Markov Regenerative Stochastic Petri Nets: A Comparison of Approaches
 In 6th International Conference on Petri Nets and Performance Models  PNPM95
, 1995
"... In this paper we present and compare two different 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 nonMark ..."
Abstract

Cited by 30 (12 self)
 Add to MetaCart
In this paper we present and compare two different 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
Results 1  10
of
439