### Table 4. Validation of Petri net model

2005

"... In PAGE 5: ...robability of 0.5. The keys were chosen from a uniformly distributed random variable. Table4 shows the performance results for actual execution time and Petri net simulation... ..."

Cited by 2

### Table 11.1: Timings from the simulations of various Petri Net models

89

### Table 4.2: Results for simulating Petri nets

2007

### Table 7.1: Performance Results of Timed Petri Net

2002

### Table 2: Comparison of IDEF0, IDEF3 and Petri nets elements

"... In PAGE 5: ...Not existing, or very small (elaboration) Existing strong formalism Standardization Existing, very strong Many versions, lack of standardization Software Numerous Numerous Table 1: A comparison of IDEF diagrams and Petri nets IDEF diagrams and Petri nets can also be compared according to their basic elements, as shown in Table2 . We can conclude that IDEF3 diagrams are very powerful method with the basic elements for simulation modeling.... ..."

### Table 4: Meaning of Places in Petri Net Place Meaning

"... In PAGE 48: ...RRR ??? 8.3 Using Petri Nets A Petri Net model of the uncontrolled plant is shown in Figure 22, and the meaning of the places is given in Table4 below. Notice that we have modeled the system such that machine 3 loads one part at a time.... ..."

### Table 1. Corresponding Petri net and graph transformation variants

2002

"... In PAGE 2: ... Based on the correspondence of Petri nets and (typed) graph transformation, which regards Petri nets as rewriting systems on multi-sets of vertices [5], we can derive a model of time within typed graph transformation systems with attributes. The corre- spondence is visualised in Table1 . Besides (low-level) place-transition nets and typed graph transformation systems, it relates (high-level) environment-relationship nets to typed graph transformation with attributes.... ..."

Cited by 3

### Table 1. Corresponding Petri net and graph transformation variants

"... In PAGE 2: ... Based on the correspondence of Petri nets and (typed) graph transformation, which regards Petri nets as rewriting systems on multi-sets of vertices [5], we can derive a model of time within typed graph transformation systems with attributes. The correspondence is visualised in Table1 . Besides (low- level) place-transition nets and typed graph transformation systems, it relates (high-level) environment- relationship nets to typed graph transformation with attributes.... ..."

### Table 2: Synthesis of Petri nets from speed-independent circuits.

1995

"... In PAGE 21: ... The rest of the synthesis method for UC and FC nets remains the same. 7 Applications Table2 describes the results of the application of our algorithms to the synthesis of Petri nets from transition systems obtained from speed-independent circuits. This can be used to produce a user- readable description of the functionality of a circuit, in the form of a timing diagram-like labeled Petri net (a Signal Transition Graph, STG).... ..."

Cited by 1