### Table 2: Results of Petri net alignment Petri net 1 Petri net 2 Similarity Alignment

2006

"... In PAGE 5: ...5, we can infer align(Quantity) = Number; Quantity in Petri net 1 is aligned with Number of Petri net 2. An excerpt of further results is depicted in Table2 . These results have directly been taken from the implementation of the approach described in this paper.... ..."

Cited by 7

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

1998

"... In PAGE 32: ...2 Bottom-up approach: analysis of concurrent systems PN synthesis can also be used for the analysis of systems. Table3 describes the results of the ap- plication of our algorithms to the synthesis of Petri nets from TSs obtained from speed-independent circuits (all examples are described in [32]). 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 Transi- tion Graph, STG).... In PAGE 32: ... Another potential application is to optimize the input to direct synthesis methods, that have been devised for Petri nets using both synchronous and asynchronous circuit design tech- niques ([39, 8, 44]). Figure 16 illustrates one of the examples shown in Table3 (a4 tflo1). Initially, a TS is derived by calculating all reachable states of the circuit (symbolic techniques can be used here).... ..."

Cited by 22

### Table 1. Effects of Approach on Petri Nets and Reachability Graphs

1996

"... In PAGE 11: ... The code for readers/writers programs is fairly standard, with a Boolean variable WriterPresent used to track the presence of a writer. The notation gasXY indicates an instance of the standard gas station problem [HL85] with The effects of using these techniques for the sample programs can be found in Table1 . In the table, NA means that no additional information is included in the Petri net for the program.... ..."

Cited by 7

### 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 3. results obtained on Intel Xeon 3Ghz with 4Gb of memory : cat. : category of example (PN = (unbounded) Petri net, PNT = Petri net with transfer arcs, BPN = bounded Petri net) P : number of places, T: number of transitions. EEC : results ob- tained with the \Expand, Enlarge and Check quot; algorithm. Pre + Inv: results obtained with a backward approach, using invariant heuristics, Pre: same without invariants. All the memory consumptions in KB and times in second.

2005

"... In PAGE 15: ... Immediate from Proposition 7 and Proposition 8. u t B Experiments on EPN Table3 contains the results of the whole set of experiments we made on EPN. A web page with a description of the examples may be found at http://www.... ..."

Cited by 2

### Table 3. results obtained on Intel Xeon 3Ghz with 4Gb of memory : cat. : category of example (PN = (unbounded) Petri net, PNT = Petri net with transfer arcs, BPN = bounded Petri net) P : number of places, T: number of transitions. EEC : results ob- tained with the \Expand, Enlarge and Check quot; algorithm. Pre + Inv: results obtained with a backward approach, using invariant heuristics, Pre: same without invariants. All the memory consumptions in KB and times in second.

2005

"... In PAGE 17: ...u t B Experiments on EPN Table3 contains the results of the whole set of experiments we made on EPN. A web page with a description of the examples may be found at http://www.... ..."

Cited by 2

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

2002

### 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. Incidence matrix A of the petri net in Fig. 7.

"... In PAGE 21: ... The incidence matrix A of the Petri net in Fig. 7 is listed in Table1 . Now we begin to analyze and verify the following ve cases for secure agent communication and agent migration, which show the key behaviors and properties of our models.... In PAGE 25: ... 7 by deleting two arcs: t19 to m1, and t43 to m2; adding two new transitions: t49 and t50; and adding six new arcs: l1 to t49, t49 to m1, t49 to p1, l2 to t50, t50 to m2, and t50 to p2. The incidence matrix A of the Petri net model (shown in Table1 ) is revised into A0 by updating the rows for transitions t19 and t43, and adding two new rows for transitions t49 and t50. The revisions to incidence matrix A are summarized in Table 2.... ..."

Cited by 2