Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets

Ramamoorthy, C. V.; Ho, G.S.

doi:10.1109/tse.1980.230492

Cited by 473 publications

(79 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…If a net is covered by a family of conflict-free cyclic subnets (i.e., if each place and each transition of a net belongs to one of subnets), the cycle time of the net, , is equal to the maximum cycle time of the covering subnets [32], [36]:…”

Section: Timed Petri Netsmentioning

confidence: 99%

“…In order to analyze the performance of such models, the durations of all activities must be included in the model description. Several types of nets "with time" have been proposed by associating "time delays" with places [36], or occurrence durations with transitions [2], [32], [48] of net models. Also, the introduced temporal properties can be deterministic [32], [33], [36], [48], or can be random variables described by probability distribution functions (the negative exponential distribution being the most popular choice) [2], [3], [48].…”

Section: Introductionmentioning

confidence: 99%

“…Several types of nets "with time" have been proposed by associating "time delays" with places [36], or occurrence durations with transitions [2], [32], [48] of net models. Also, the introduced temporal properties can be deterministic [32], [33], [36], [48], or can be random variables described by probability distribution functions (the negative exponential distribution being the most popular choice) [2], [3], [48]. For analysis of temporal constraints imposed on some events (e.g., a message must be received within time units from the moment of sending), time intervals can be associated with places or transitions of net models [1], [24].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cluster Tools With Chamber Revisiting—Modeling and Analysis Using Timed Petri Nets

Zuberek

2004

IEEE Trans. Semicond. Manufact.

View full text Add to dashboard Cite

Abstract-Timed Petri nets are formal models of discrete concurrent systems. Since the durations of all activities are included in the model descriptions, many performance characteristics can be derived from such models. In the case of cluster tools, net models represent the flow of wafers through the chambers of the tool as well as consecutive actions performed by the robotic transporter. Steady-state performance of cluster tools with chamber revisiting is investigated in this paper. A systematic development of detailed tool schedules, based on a general behavioral description of the tool, is proposed and is used to derive the corresponding Petri net models. Symbolic performance characteristics of the modeled tools are obtained by using place invariants, without exhaustive reachability analysis. Simple examples presented in the paper can be easily extended in many ways.

show abstract

Section: Timed Petri Netsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cluster Tools With Chamber Revisiting—Modeling and Analysis Using Timed Petri Nets

Zuberek

2004

IEEE Trans. Semicond. Manufact.

View full text Add to dashboard Cite

show abstract

“…The determination of the liveness and the computation of the optimal throughput of a MTEG are two fundamental questions which are polynomially solved from a long time [2], [3], [4]. The minimization of a weighted sum of the initial markings for a minimum given throughput of a MTEG is in N P , and many authors developed efficient heuristics and exact methods to solve it (see.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A new approach for minimizing buffer capacities with throughput constraint for embedded system design

Benazouz

Marchetti

Munier-Kordon

et al. 2010

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010

View full text Add to dashboard Cite

Abstract-The design of streaming (e.g. multimedia or network packet processing) applications must consider several optimizations such as the mimimization of the whole surface of the memory needed on a Chip. The minimum throughput of the output is usually fixed. In this paper, we present an original methodology to solve this problem.The application is modelled using a Marked Timed Weighted Event Graphs (in short MTWEG), which is a subclass of Petri nets. Transitions correspond to specific treatments and the places model buffers for data transfers. It is assumed that transitions are periodically fired with a fixed throughput.The problem is first mathematically modelled using an Integer Linear Program. We then study for a unique buffer the optimum throughput according to the capacity. A first polynomial simple algorithm computing the minimum surface for a fixed throughput is derived when there is no circuit in the initial MTWEG, which corresponds to a wide class of applications. We prove in this case that the capacities of every buffer may be optimized independently.For general MTWEG, the problem is NP-Hard and an original polynomial 2-approximation algorithm is presented. For practical applications, the solution computed is very close to the optimum.

show abstract

“…Rarnarnoorthy [Ram80], Sifakis [Sif7?] and others have used Petti nets for the performance evaluation of concurrent systems. The introduction of Stochastic Petri nets [SPNs] proposed by Molloy [MoI82] has ttiggered a number of interesting developments in this area, for example, the study of Discrete Time Stochastic Petri Nets [MoI8S] and of Generalized Stochastic Petti Nets [Mar84 Bal86].…”

Section: Introductionmentioning

confidence: 99%

Stochastic high-level Petri nets and applications

Lin

Marinescu

1988

IEEE Trans. Comput.

View full text Add to dashboard Cite

A new class of stochastic Petri nets is proposed in this paper. The Stochastic High Level Petti nets [SHLPNs] are High Level Petti nets augmented with exponentially distributed firing times. The main advantage of modeling homogeneous systems using SHLPNs is that the resulting models are simpler, more intuitive and have a smaller number of states as our examples show. IntroductionRarnarnoorthy Molloy has proved that there is an isomorphism between k-bounded Petri nets with exponentially distributed transition rates and finite Markov processes. Two stochastic systems are isomorphic if: a-there are one-te-one mappings between the state spaces of the two systems, and between the set of state transitions of the two systems, b-the probability of a transition from one state to another in one system equals the probability of a transition between the corresponding states of the other system. The importance of this result is that the methodology used to find the steady state probabilities of Markov chain can be used. for the SPN system in which each marking corresponds to a Markov state.Though the Stochastic Petri nets do not provide more modeling power than the Markov processes, they can be used as a convenient description of the system being modeled. Since the size of the state space of a Stochastic Petti net is equal to the size of the Markov process space, the complexity of solving an SPN model is the same as in the case of

show abstract

Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets

Cited by 473 publications

References 10 publications

Cluster Tools With Chamber Revisiting—Modeling and Analysis Using Timed Petri Nets

Cluster Tools With Chamber Revisiting—Modeling and Analysis Using Timed Petri Nets

A new approach for minimizing buffer capacities with throughput constraint for embedded system design

Stochastic high-level Petri nets and applications

Contact Info

Product

Resources

About