### Table 1. Mapping between PASTA model and Petri Net

"... In PAGE 10: ... In fact, these two types of state machines are two views of the same underlying executable state transition abstraction from two different perspectives. Actually that underlying executable state transition abstraction can be transformed to a global Petri-Net defined by the conversion rule in Table1 . That executable state transition abstraction provides a better and simpler representation than Petri-Net does but with same semantic.... ..."

### Table 1: Petri net modeling elements Sign of Each Element Description

"... In PAGE 3: ... The basic structure of PN includes (i) a finite set of places ; (ii) a finite set of transitions ; (iii) a finite set of arcs ; and (iv) a set of tokens that define the initial markings. The signs commonly used for denoting the place , transition , arc and token are illustrated in Table1 . In essence, the arcs define the input and output functions which govern the flow of tokens from places to transitions and from transitions to places respectively.... ..."

### Table 1. Summary of comparisons between SPREM and Petri Nets.

"... In PAGE 6: ...428 Some comparisons between SPREM and Petri nets are summarized in Table1 based on an example Petri net for modeling of the spiral paradigm, shown in Fig. 3.... ..."

### 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 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

### 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 1: Reachable markings for the Petri net of Figure 3

"... In PAGE 5: ... If t is an EXP transition, the transition between ma and mc will have a constant rate given by: ac = Pbc X t2 quot;(mi) t where quot;(mi) is the set of EXP transitions enabled in mi and t is their ring rate. As an example of the generation of the extended and reduced reachability graph, consider a system based on a client-server paradigm, whose Petri net model is shown in Figure 3 while the reachable markings are identi ed in Table1... ..."

### 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 2. Main result of the security risk assessment

2004

"... In PAGE 11: ... In this context the security risk acceptance criteria is deflned such that all security risks with risk level equal to or higher than quot;High quot; must be treated (scale Low, Medium, High, and Extreme [19]). Table2 gives an overview of the... In PAGE 11: ...Table 2. Main result of the security risk assessment The treatment option suggested for the two security risks in need of treatment is encryption (see Table2 ). Encryption is crosscutting and may be used in various modules in a system.... ..."

Cited by 4