There exist many diierent Petri net formalisms. In this paper, we present the Petri Net Cube which helps to structure and classify the variety of Petri net formalisms. We show, that three basic aspects are suucient for describing most classical Petri net formalisms. Since these aspects are independent of each other, we call them the Dimensions of Petri Nets.

Petri nets have become a mature modelling and analysis tool applicable in many application domains. Since the introduction of the Petri net concept in 1962 (Petri 14]), Petri nets have been investigated and applied by many researchers. Many extensions of the classical Petri net have been proposed. To model attributes, `colour' has been added. Time concepts have been added to describe the tempor...

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.

As part of the Petri Net Baukastenn Pad99b] the Expert View presents mathematical concepts and results of Petri net theory in a structured and application oriented way. Consistent formal Petri net techniques and transformations between these are main issues. We introduce the notions of formal Petri net techniques, abstract Petri net frames, instantiations, and transformations. These notions are...

As part of the Petri Net Baukastenn Pad99b] the Expert View presents mathematical concepts and results of Petri net theory in a structured and application oriented way. Consistent formal Petri net techniques and transformations between these are main issues. We introduce the notions of formal Petri net techniques, abstract Petri net frames, instantiations, and transformations. These notions are...

Petri nets are used to study many types of networked systems. [1] have designed a software tool for analysis and simulation of Petri nets. We extend this tool to handle a form of Petri net known as Predicate Transition (PrT) nets. We implement mechanisms that automate the process of folding a Petri net to a PrT net and finding invariants. We can compute invariants for systems that use either Pe...

We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks — possibly one per place — allowing a local timing as well as distributed time synchronisation. We give a formal...