Timed Petri nets definitions, properties, and applications

Zuberek, W.M.

doi:10.1016/0026-2714(91)90007-t

Cited by 206 publications

(103 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In timed nets [48], occurrence times are associated with transitions, and transition occurrences are real-time events, i.e., tokens are removed from input places at the beginning of the occurrence period, and they are deposited to the output places at the end of this period (sometimes this is also called a three-phase firing mechanism as opposed to one-phase instantaneous occurrences of transitions in stochastic nets [2], [3] and time nets [24]). All occurrences of enabled transitions are initiated in the same instants of time in which the transitions become enabled (although some enabled transitions cannot initiate their occurrences).…”

Section: Timed Petri Netsmentioning

confidence: 99%

“…In both cases, the concepts of state and state transitions have been formally defined and used in the derivation of different performance characteristics of the model [48]. Only D-timed Petri nets are used in this paper.…”

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 3 more Smart Citations

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

Zuberek

2004

IEEE Trans. Semicond. Manufact.

Self Cite

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: Timed Petri Netsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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.

Self Cite

View full text Add to dashboard Cite

show abstract

“…[Kienhuis et al, 1997] finds a satisfactory architecture design, mapping and structure for the algorithms. Important requirements for the models and modelling techniques are: [Jensen, 1992], timed Petri nets [Zuberek, 1991], stochastic delays [Molloy, 1982] and hierarchy provide expressive modelling power. These Petri net concepts are supported by the tool ExSpect [ASPT, 1994].…”

Section: Problem Statementmentioning

confidence: 99%

Performance Analysis of Dataflow Architectures Using Timed Coloured Petri Nets

Witlox

Wolf

Aarts

et al. 2000

Hardware Design and Petri Nets

View full text Add to dashboard Cite

Abstract. We present an approach to model dataflow architectures at a high level of abstraction using timed coloured Petri nets. We specifically examine the value of Petri nets for evaluating the performance of such architectures. For this purpose we assess the value of Petri nets both as a modelling technique for dataftow architectures and as an analysis tool that yields valuable performance data for such architectures through the execution of Petri net models. Because our aim is to use the models for performance analysis, we focus on representing the timing and communication behaviour of the architecture rather than the functionality. A modular approach is used to model architectures. We identify five basic hardware building blocks from which Petri net models of dataflow architectures can be constructed. In defining the building blocks we will identify strengths and weaknesses of Petri nets for modelling dataflow architectures. A technique called folding is applied to build generic models of dataflow architectures. A timed coloured Petri net model of the Prophid data.flow architecture, which is being developed at Philips Research Laboratories, is presented. This model has been designed in the tool ExSpect. The performance of the Prophid architecture has been analysed by simulation with this model.

show abstract

References

2014

Mobility Protocols and Handover Optimization

View full text Add to dashboard Cite

Timed Petri nets definitions, properties, and applications

Cited by 206 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

Performance Analysis of Dataflow Architectures Using Timed Coloured Petri Nets

References

Contact Info

Product

Resources

About