### Table 2. Model Notations

"... In PAGE 32: ... Peer-to-Peer Model The proposed uid model for the estimation of the transfer time distribution in P2P flle sharing applications will be described using the Fluid Stochastic Petri Net (FSPN) formalism [18, 17]. Table2 reports the other notations derived from the reference. Table 2.... ..."

### Table 1: Evaluation SPNP model with monitoring results under minimal load

1994

"... In PAGE 10: ... The SPNP #28stochastic Petri net package#29 implementation#5B3#5D of the performability model has been veri#0Ced with the performability indices actually measured by the JEWEL monitor under various workloads. In Table1 the monitored results for the three di#0Berent con#0Cgurations are presented in comparison with the values calculated by SPNP.We see that the model results, under minimal load, come very close to the values actually mea- sured.... ..."

### Table 1. Parameters for proxy-based integrated location and service management

"... In PAGE 6: ... This assumption is later relaxed by examining a more general function F(k) that returns the number of hops as a function of the number of subnets k. The system parameters that characterize the mobility and service characteristics of an MN in an MIP system are sum- marized in Table1 for easy reference. PERFORMANCE MODEL A stochastic Petri net (SPN) model as showed in Figure 6 is developed to analyse the behavior of an MN in an MIP system under our proxy-based regional registration scheme.... ..."

### Table 6. Effects of the failure dependencies in the CTMC model of the real-time computer example.

"... In PAGE 17: ...he standby unit cannot fail while powered-o , i.e., s = 0. 5 CONCLUSIONS Table6 shows a comparison of the introduc- tion of failure dependencies in the real-time com- puter model. Entries in this table refer to the ex- amples previously discussed, the respective size (in terms of number of states and transitions) of the CTMC underlying the stochastic Petri net model, and an observation stating if the three subsystems in the model remained statistically independent (s- independent) or not.... ..."

### Table 3. Petri net elements.

"... In PAGE 4: ... The Petri nets used here, further referred to as extended Petri nets, are extended with inhibitor [1] and reset arcs [2]. In Table3 , the Petri net elements are explained. Table 3.... ..."

### Table 3: Petri net minimization.

1998

"... In PAGE 29: ... Therefore, automatic techniques to produce succint representations of the same system can be useful. Table3 describes the results of the application of our algorithms to the minimization of a given labeled Petri net. The examples correspond to speci cations of asynchronous circuits that have been produced manually by system designers.... In PAGE 29: ... P, T, F and M are the numbers of places, transitions, arcs and markings respectively. Figure 16 depicts the initial and nal Petri net for the example future shown in Table3 . The nal result illustrates how powerful the synthesis techniques can be in nding compact representa- tions of the same behavior.... ..."

Cited by 22

### Table 3: Petri net minimization.

1998

"... In PAGE 30: ... Therefore, automatic techniques to produce succint representations of the same system can be useful. Table3 describes the results of the application of our algorithms to the minimization of a given labeled Petri net. The examples correspond to speci cations of asynchronous circuits that have been produced manually by system designers.... In PAGE 30: ... P, T, F and M are the numbers of places, transitions, arcs and markings respectively. Figure 16 depicts the initial and nal Petri net for the example future shown in Table3 . The nal result illustrates how powerful the synthesis techniques can be in nding compact representa- tions of the same behavior.... ..."

### 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 1. Each step in Table 1 also is marked in F

"... In PAGE 5: ... Each step in Table 1 also is marked in F Step Description of s 1 PRO 2 Translate f 3 Assig 4 Anal and reliab 5 Final FinalDesign Model (5) CSPL/SPNP Model (4) Refine and verify Refineand validate PROMELA/Spin Model (1) Functional Specification PCX Translator (2) amp;(3) Spinmodel checking Non-Functional Specification User Needs User Specification PetriNetsmodel checking Figure 1. The PCX approach for the system model analysis LA model based on the requirement specification that Table1 . Methodology: steps for specification and analysis teps used in the approach MELA/Spin model for analyzing the logical consistency rom PROMELA to Stochastic Petri Nets.... ..."

### Table 1: Previous techniques for CSC of Petri nets

"... In PAGE 2: ... The Unique State Coding (USC) prop- erty, similar to CSC but still more restrictive, has been also used for the same purpose. Table1 summarizes the most signi cant e orts in the area of CSC for Petri nets. Among the di erent subclasses of Petri nets, algorithms have been proposed for Marked Graphs (MGs) [Van90, KKT91], Free Choice nets [LMBSV92], and general Petri nets [VLGM92].... ..."