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

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

"... In PAGE 6: ... More on that is also in [4]. 5 Applications Table2 describesthe results of the applicationof ouralgorithms 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).... ..."

### 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: Place and transition descriptions for the Petri net of gure 1. 4.1 Controller Synthesis The Petri net model of the plant has the following incidence matrix and marking vector.

1997

Cited by 3

### 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 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: 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... ..."