Semantic meaning for the places and transitions in Fig. 11.
1. Introduction
Augmented marked graphs were first introduced in 1997 (Chu & Xie, 1997). They are not well known as compared to other sub-classes of Petri nets such as free-choice nets (Desel & Esparza, 1995), and the properties of augmented marked graphs are not studied extensively. However, augmented marked graphs possess a structure which is desirable for modelling shared resources, and for this reason, they are often used in modelling shared resource systems, such as manufacturing systems (Chu & Xie, 1997; Zhou & Venkatesh, 1999; Jeng et al., 2000; Jeng et al., 2002; Huang et al., 2003; Cheung & Chow, 2005).
There are a few published works on augmented marked graphs. Based on siphons and mathematical programming, Chu and Xie proposed a necessary and sufficient condition of live and reversible augmented marked graphs, which checks the existence of potential deadlocks (Chu & Xie, 1997). However, this involves the flow of tokens during execution and cannot be checked simply by looking into the structure. Chu and Xie also proposed another siphon-based characterisation for live and reversible augmented marked graphs but it provides a sufficient condition only. On the other hand, the boundedness and conservativeness of augmented marked graphs were not investigated.
In the literature, apart from (Chu & Xie, 1997), the studies of augmented marked graphs mainly focus on their property-preserving synthesis or composition. Jeng et al. proposed a synthesis of process nets (covering augmented marked graphs) for manufacturing system design, where the condition of liveness and reversibility are based on siphons and the firability of transitions (Jeng et al., 2000; Jeng et al., 2002). Huang et al. also investigated the composition of augmented marked graphs so that properties such as liveness, boundedness and reversibility can be preserved (Huang et al., 2003).
In our earlier works on augmented marked graphs, we proposed characterisations for their liveness, boundedness, reversibility and conservativeness and applied the characterisations to the analysis and design of manufacturing systems, object-oriented systems and shared resource systems (Cheung, 2004; Cheung, 2005; Cheung & Chow, 2005a; Cheung & Chow, 2005b; Cheung & Chow, 2005c; Cheung, 2006; Cheung & Chow, 2006; Cheung et al., 2006; Cheung, 2007). This paper consolidates our previous works with a special focus on the properties of augmented marked graphs.
First, we provide a number of characterisations for live and reversible augmented marked graphs, based on siphons and cycles. In particular, a property called R-inclusion property is introduced to characterise the siphon-trap property of augmented marked graphs. With this property, the liveness and reversibility of an augmented marked graph can be analysed through cycles instead of siphons. Second, we introduce R-transformation which transforms an augmented marked graph into a marked graph. Its boundedness and conservativeness can be determined by checking the cycles of the transformed marked graph. Based on these characterisations, some pretty simple conditions and procedures are derived for checking the liveness, reversibility, boundedness and conservativeness of an augmented marked graph. These will be illustrated using the dining philosophers problem. We then show the application to manufacturing system design.
The rest of this paper is organised as follows. Following this introduction, Section 2 provides the preliminaries to be used in this paper. Section 3 describes augmented marked graphs and their known properties. Section 4 shows characterisations for liveness and reversibility while Section 5 shows characterisations for boundedness and conservativeness. Section 6 then illustrates these characterisations using the dining philosophers example. Section 7 describes the application to manufacturing system design. Finally, Section 8 concludes this paper with a brief discussion.
2. Preliminaries
This section provides the preliminaries to be used in this paper for those readers who are not familiar with Petri nets (Peterson, 1981; Reisig, 1985; Murata, 1989; Desel & Reisig, 1998).
An ordinary PT-net is usually written as P, T, F . In the rest of this paper, unless specified otherwise, all PT-nets refer to ordinary PT-nets.
For clarity in presentation, the pre-set and post-set of a set of places or transitions X = { x1, x2,..., xn } can be written as X and X respectively, where X = x1 x2 ... xn and X = x1 x2 ... xn.
3. Augmented marked graphs
This section describes augmented marked graphs and their known properties on liveness and reversibility.
Figure 1 shows an augmented marked graph (N, M0; R), where R = { r1, r2 }. For r1, Dr1 = { t1, t11, t3, t9 }. For r2, Dr2 = { t2, t11, t4, t10 }.
For the augmented marked graph (N, M0; R) in Figure 1, the minimal siphons include : { p1, p5, p8}, { r1, p2, p4, p6, p7, p9 }, { r1, p2, p4, p6, p7, p10 }, { r2, p3, p5, p6, p8, p9 } and { r2, p3, p5, p6, p8, p10 }. Each of these minimal siphons contains a marked trap, and would never become empty. (N, M0; R) is live and reversible.
4. Liveness and reversibility
This section provides characterisations for live and reversible augmented marked graphs, based on siphons and cycles. Strategies for checking liveness and reversibility are then presented.
For clarity in presentation, P[{}] and T[{}] can be written as P[] and T[], to denote the set of places in a cycle and the set of transitions generated by , respectively.
Consider the augmented marked graph (N, M0; R) shown in Figure 1. Every minimal siphon is covered by cycles. For example, for a minimal siphon S1 = { r1, p2, p4, p6, p7, p9 }, there exists a set of cycles Y1 = { 11, 12 }, where 11 = r1, p4, p7 and 12 = r1, p2, p6, p9 , such that S1 = P[Y1]. For another minimal siphon S2 = { r2, p3, p5, p6, p8, p10 }, there exists a set of cycles Y2 = { 21, 22 }, where 21 = r2, p5, p8 and 22 = r2, p3, p6, p10 , such that S2 = P[Y2]. S1 is a minimal siphon, in which r1 R is the only one marked place. Also, S2 is a minimal siphon, in which r2 R is the only one marked place.
For clarity in presentation, N[{p}] can be written as N[p] to denote the set of cycles that contains a place p.
Figure 2 shows an augmented marked graph (N, M0; R), where R = { r1, r2 }. There are five minimal siphons, namely, S1 = { r1, p3, p4, p7, p8 }, S2 = { r1, p3, p5, p7, p8 }, S3 = { r2, p2, p4, p6, p8, p9, p10 }, S4 = { r2, p2, p5, p6, p8, p9, p10 } and S5 = { p1, p3, p7 }. S1, S2, S3 and S4 are R-siphons while S5 is a NR-siphon.
For the augmented marked graph (N, M0; R) shown in Figure 2. every R-siphon is covered by a set of cycles in N[R]. For example, a R-siphon S1 = { r1, p3, p4, p7, p8 } is covered by a set of cycles Y1 = { 11, 12 } N[R], where 11 = r1, p3, p7 and 12 = r1, p4, p8 . Another R-siphon S2 = { r1, p3, p5, p7, p8 } is covered by a set of cycles Y2 = { 21, 22 } N[R], where 21 = r1, p3, p7 and 22 = r1, p5, p8 .
Consider the augmented marked graph (N, M0; R) shown in Figure 2. Every R-siphon contains marked trap. Each of the R-siphons S1 = { r1, p3, p4, p7, p8 }, S2 = { r1, p3, p5, p7, p8 }, S3 = { r2, p2, p4, p6, p8, p9, p10 } and S4 = { r2, p2, p5, p6, p8, p9, p10 } contains a marked trap and would never become empty. Also, the NR-siphon S5 = { p1, p3, p7 } contains itself as a marked trap and would never become empty. (N, M0; R) is live and reversible.
Property 4.8 provides a simpler necessary and sufficient condition for live and reversible augmented marked graphs, as compared to Properties 3.1 and 3.2. According to Property 4.8, only R-siphons are considered. Typically, for an augmented marked graph (N, M0; R), the set R is small, so only a small number of siphons need to be considered. Properties 3.4 and 4.10 also refers to the same set of siphons but only a sufficient condition is provided.
With Properties 4.8 and 4.10, we can determine if an augmented marked graph is live and reversible based on R-siphons. On the other hand, Property 4.5 provides a characterisation for R-siphons so that R-siphons can be easily identified by finding cycles in N[R].
We may now derive the following strategy for checking the liveness and reversibility of an augmented marked graph (N, M0; R) :
Find all R-siphons based on N[R].
Check if every R-siphon contains a marked trap. If yes, report (N, M0; R) is live and reversible. Otherwise, go to (c).
For each R-siphon which does not contain any marked trap, check if it would never become empty. If yes, (N, M0; R) is live and reversible. Otherwise, (N, M0; R) is neither live nor reversible.
In the following, a property called R-inclusion is introduced for characterising the liveness and reversibility of augmented marked graphs.
For the PT-net N shown in Figure 3, consider three cycles 1, 2, 3 N[p3], where 1 = p3, p2, p7 , 2 = p3, p4 and 3 = p3, p1, p6, p10, p8 . Y1 = { 1, 2 } is conflict-free because for any q, q' P[Y1], there exists in P[Y1] a conflict-free path from q to q'. Y2 = { 2, 3 } is not conflict-free. Consider Y2. We have p4, p8 P[Y2]. p4 is connected to p8 via only one path = p4, t5, p3, t1, p1, t3, p6, t6, p10, t9, p8 in Y2, and is not conflict-free because p4, p8 t5.
For the augmented marked graph shown in Figure 1, { r1, p2, p4, p6, p7, p9 } is a minimal siphon covered by a set of cycles { r1, p4, p7 , r1, p2, p6, p9 } which is conflict free. { r2, p3, p5, p6, p8, p10 } is another minimal siphon covered by a set of cycles { r2, p5, p8 , r2, p3, p6, p10 } which is conflict-free. For the augmented marked graph shown in Figure 2, { r1, p3, p4, p7, p8 } is a minimal siphon covered by a set of cycles { r1, p3, p7 , r1, p4, p8 } which is conflict free. { r1, p3, p5, p7, p8 } is another minimal siphon covered by a set of cycles { r1, p3, p7 , r1, p5, p8 } which is conflict free.
Figure 4 shows an augmented marked graph (N, M0; R), where R = { r1, r2 }. Consider r1. For any set of cycles Y1 N[R] such that Y1 is conflict-free, r1 T[Y1] r1 T[Y1]. Next, consider r2. For any set of cycles Y2 N[R] such that Y2 is conflict-free, r2 T[Y2] r2 T[Y]. Both r1 and r2 satisfy the R-inclusion.
Figure 5 shows an augmented marked graph (N, M0; R), where R = { r1, r2 }. For r1, there exists a set of cycles Y1 = { 11, 12 } N[R], where 11 = r1, p5 and 12 = r1, p5, r2, p6 . r1 = { t5, t6 } T[Y1] = { t3, t4, t5, t6 }, but r1 = { t2, t3 } T[Y1]. For r2, there exists a set of cycles Y2 = { 21, 22 } N[R], where 21 = r2, p6 and 22 = r2, p6, r1, p5 . r2 = { t5, t6 } T[Y2] = { t3, t4, t5, t6 }, but r2 = { t1, t4 } T[Y2]. Hence, r1 and r2 do not satisfy the R-inclusion property.
Consider the augmented marked graph (N, M0; R), where R = { r1, r2 }, shown in Figure 4. Both r1 and r2 satisfy the R-inclusion property. { r1, p3, p4 } is a minimal siphon which contains itself as a marked trap. { r2, p5, p6 } is another minimal siphon which contains itself as a marked trap.
Consider the augmented marked graph (N, M0; R), where R = { r1, r2 }, shown in Figure 4. Both r1 and r2 satisfy the R-inclusion property. (N, M0; R) satisfies the siphon-trap property, and is live and reversible.
Property 4.14 provides a cycle-based sufficient condition for live and reversible augmented marked graphs. Without finding siphons and checking if each of these siphons contains a marked trap, we need to check the R-inclusion property which involves finding cycles and checking their pre-sets and post-sets. This provides an alternative characterisation for live and reversible augmented marked graphs, apart from the existing siphon-based ones.
Based on Properties 4.5, 4.8, 4.10, 4.12 and 4.14, we may revise the strategy for checking the liveness and reversibility of an augmented marked graph (N, M0; R) with the use of the R-inclusion property, as follows.
Check if every r R satisfies the R-inclusion property. If yes, report (N, M0; R) is live and reversible. Otherwise go to (b).
Let R' R be the set of places which do not satisfy the R-inclusion property. Based on N[R'], find all R-siphons which contain at least one place in R'.
For each R-siphon identified in (b), check if it contains a marked trap. If yes, (N, M0; R) is live and reversible. Otherwise, go to (d).
For each R-siphon identified in (b) that does not contain any marked trap, check if it would never become empty. If yes, (N, M0; R) is live and reversible. Otherwise, (N, M0; R) is neither live nor reversible.HHHHHH
5. Boundedness and conservativeness
This section first introduces a transformation, called R-transform, for augmented marked graphs. Based on R-transform, a number of characterisations for bounded and conservative augmented marked graphs are then derived. Strategies for checking boundedness and conservativeness are then presented.
Figure 6 shows an augmented marked graph (N, M0; R). Figure 7 shows the R-transform of (N, M0; R), where r is replaced by { q1, q2 }. It is a live marked graph.
Consider the R-transform (N', M0') of an augmented marked graph, as shown in Figure 7. For q1, there exists a place invariant 1, such that 1[q1] = 1 and 1[q2] = 1[p1] = 1[p2] = 0. For q2, there also exists a place invariant 2, such that 2[q2] = 1 and 2[q1] = 2[p1] = 2[p2] = 0. In (N', M0'), every place belongs to a cycle. There also exists a place invariant > 0, where [q1] = [q2].
Consider the augmented marked graph (N, M0; R) shown in Figure 6, and the R-transform (N', M0') of (N, M0; R). Every place in (N', M0') belongs to a cycle. (N, M0; R) is bounded and conservative. (N', M0') is also bounded and conservative.
Figure 8 shows another augmented marked graph (N, M0; R). Figure 9 shows the R-transform (N', M0') of (N, M0; R), where r is replaced by { q1, q2 }. For (N', M0'), places p3 and p10 do not belong to any cycle. (N, M0; R) is neither bounded nor conservative.
Based on Properties 5.5, the following strategy is derived for checking the boundedness and conservativeness of an augmented marked graph (N, M0; R) :
Create the R-transform of (N, M0; R).
Let (N', M0') be the R-transform. For each place p in N', check if there exists a cycle that contains p. If yes, (N, M0; R) is bounded and conservative. Otherwise, (N, M0; R) is neither bounded nor conservative.
6. The Dining philosophers problem
This section illustrates the properties of augmented marked graphs obtained in the previous two sections using the dining philosophers problem. By modelling the dining philosophers problem by an augmented marked graph, the system is analysed on its liveness, reversibility, boundedness and conservativeness based on the properties of augmented marked graphs.
Six philosophers (H1, H2, H3, H4, H5 and H6) are sitting around a circular table for dinner. They are either meditating or eating the food placed at the centre of the table. There are six pieces of chopsticks (C1, C2, C3, C4, C5 and C6) shared by them for getting the food to eat, as shown in Figure 10. For one to get the food to eat, both the chopstick at the right hand side and the chopstick at the left hand side must be available. The philosopher then grasps both chopsticks simultaneously and then takes the food to eat. Afterwards, the chopsticks are released and returned to their original positions simultaneously.
Figure 11 shows an augmented marked graph (N, M0; R), representing the dining philosophers problem (version 1). Table 1 shows the semantic meanings of the places and transitions. There are 24 R-siphons, namely, {r1, p61, p11}, {r1, p61, p12}, {r1, p62, p11}, {r1, p62, p12}, {r2, p11, p21}, {r2, p11, p22}, {r2, p12, p21}, {r2, p12, p22}, {r3, p21, p31}, {r3, p21, p32}, {r3, p22, p31}, {r3, p22, p32}, {r4, p31, p41}, {r4, p31, p42}, {r4, p32, p41}, {r4, p32, p42}, {r5, p41, p51}, {r5, p41, p52}, {r5, p42, p51}, {r5, p42, p52}, {r6, p51, p61}, {r6, p51, p62}, {r6, p52, p61} and {r6, p52, p62}. Each of these R-siphons contains a marked trap and would never become empty. Based on the results obtained in Section 4, (N, M0; R) is live and reversible. On the other hand, for the R-transform of (N, M0; R), every place belongs to a cycle. Based on the results obtained in Section 5, (N, M0; R) is bounded and conservative.
The Dining Philosophers Problem is now modified as follows. For one to get the food to eat, he or she first grasps the chopstick at the right hand side if available, then grasps the chopstick at the left hand side if available, and then takes the food to eat. Afterwards, the chopsticks are released and returned to their original positions simultaneously.
Semantic meaning for places | Semantic meaning for transitions | ||
p 11 | H 1 is meditating. | t 11 | H 1 takes the action to grasp C 1 and C 2 . |
p 12 | H 1 has got C 1 and C 2 and takes the food. | t 12 | H 1 takes the action to return C 1 and C 2 . |
p 21 | H 2 is meditating. | t 21 | H 1 takes the action to grasp C 2 and C 3 . |
p 22 | H 2 has got C 2 and C 3 and takes the food. | t 22 | H 1 takes the action to return C 2 and C 3 . |
p 31 | H 3 is meditating. | t 31 | H 1 takes the action to grasp C 3 and C 4 . |
p 32 | H 3 has got C 3 and C 4 and takes the food. | t 32 | H 1 takes the action to return C 3 and C 4 . |
p 41 | H 4 is meditating. | t 41 | H 1 takes the action to grasp C 4 and C 5 . |
p 42 | H 4 has got C 4 and C 5 and takes the food. | t 42 | H 1 takes the action to return C 4 and C 5 . |
p 51 | H 5 is meditating. | t 51 | H 1 takes the action to grasp C 5 and C 6 . |
p 52 | H 5 has got C 5 and C 6 and takes the food. | t 52 | H 1 takes the action to return C 5 and C 6 . |
p 61 | H 6 is meditating. | t 61 | H 1 takes the action to grasp C 6 and C 1 . |
p 62 | H 6 has got C 6 and C 1 and takes the food. | t 62 | H 1 takes the action to return C 6 and C 1 . |
r 1 | C 1 is available for pick. | ||
r 2 | C 2 is available for pick. | ||
r 3 | C 3 is available for pick. | ||
r 4 | C 4 is available for pick. | ||
r 5 | C 5 is available for pick. | ||
r 6 | C 6 is available for pick. |
Figure 12 shows an augmented marked graph (N, M0; R), representing the dining philosophers problem (version 2). Table 2 shows the semantic meanings of the places and transitions. The set of places {r1, p13, r2, p23, r3, p33, r4, p43, r5, p53, r6, p63} is a R-siphon which would become empty after firing the sequence of transitions t11, t12, t13, t14, t15, t16. Based on the results obtained in Section 4, (N, M0; R) is neither live nor reversible. Deadlocks would occur, for example, after firing t11, t12, t13, t14, t15, t16. On the other hand, for the R-transform of (N, M0; R), every place belongs to a cycle. Based on the results obtained in Section 5, (N, M0; R) is bounded and conservative.
7. Application to manufacturing system
Manufacturing systems are typically shared resource systems, wherein the resources used to be maximally shared among different asynchronous processes. Moreover, every resource has a pre-defined capacity limit that can never be exceeded. Therefore, in manufacturing system design, a major design objective is to achieve a live, bounded and reversible system - liveness implies freeness of deadlock, boundedness implies absence of capacity overflow, and reversibility allows system recovery. Verification of the system liveness, boundedness and reversibility is essentially required, though very time-consuming.
Possessing a specific structure for representing shared resources, augmented marked graphs are often used for modelling manufacturing systems. By modelling a manufacturing system as an augmented marked graph, this section shows how the system liveness, boundedness and reversibility can be analysed, based on the properties of augmented marked graphs.
Semantic meaning for places | Semantic meaning for transitions | ||
p 11 | H 1 is meditating. | t 11 | H 1 takes the action to grasp C 1 . |
p 12 | H 1 has got C 1 and prepares to pick C 2 . | t 12 | H 1 takes the action to grasp C 2 . |
p 13 | H 1 has got C 1 and C 2 and takes the food. | t 13 | H 1 takes the action to return C 1 and C 2 . |
p 21 | H 2 is meditating. | t 21 | H 2 takes the action to grasp C 2 . |
p 22 | H 2 has got C 2 and prepares to pick C 3 . | t 22 | H 2 takes the action to grasp C 3 . |
p 23 | H 2 has got C 2 and C 3 and takes the food. | t 23 | H 2 takes the action to return C 2 and C 3 . |
p 31 | H 3 is meditating. | t 31 | H 3 takes the action to grasp C 3 . |
p 32 | H 3 has got C 3 and prepares to pick C 4 . | t 32 | H 3 takes the action to grasp C 4 . |
p 33 | H 3 has got C 3 and C 4 and takes the food. | t 33 | H 3 takes the action to return C 3 and C 4 . |
p 41 | H 4 is meditating. | t 41 | H 4 takes the action to grasp C 4 . |
p 42 | H 4 has got C 4 and prepares to pick C 5 . | t 42 | H 4 takes the action to grasp C 5 . |
p 43 | H 4 has got C 4 and C 5 and takes the food. | t 43 | H 4 takes the action to return C 4 and C 5 . |
p 51 | H 5 is meditating. | t 51 | H 5 takes the action to grasp C 5 . |
p 52 | H 5 has got C 5 and prepares to pick C 6 . | t 52 | H 5 takes the action to grasp C 6 . |
p 53 | H 5 has got C 5 and C 6 and takes the food. | t 53 | H 5 takes the action to return C 5 and C 6 . |
p 61 | H 6 is meditating. | t 61 | H 6 takes the action to grasp C 6 . |
p 62 | H 6 has got C 6 and prepares to pick C 1 . | t 62 | H 6 takes the action to grasp C 1 . |
p 63 | H 6 has got C 6 and C 1 and takes the food. | t 63 | H 6 takes the action to return C 6 and C 1 . |
r 1 | C 1 is available for pick. | ||
r 2 | C 2 is available for pick. | ||
r 3 | C 3 is available for pick. | ||
r 4 | C 4 is available for pick. | ||
r 5 | C 5 is available for pick. | ||
r 6 | C 6 is available for pick. |
Production process 1 : R1 picks components from the feeder area, and moves into the PCB area for inserting components. The finished product is then moved out from the PCB area.
Production process 2 : R2 picks components from the feeder area, and moves into the PCB area for inserting components. The finished product is then moved out from the PCB area.
Figure 14 shows an augmented marked graph (N, M0; R), representing the FWS-200 flexible workstation system. Table 3 shows the semantic meanings of the places and transitions.
For the augmented marked graph (N, M0; R) shown in Figure 14, every R-siphon would never become empty. Based on the results obtained in Section 4, (N, M0; R) is live and reversible. For the R-transform of (N, M0; R), every place belongs to a cycle. Based on the results obtained in Section 5, (N, M0; R) is bounded and conservative. It is then concluded that the FWS-200 flexible workstation system is live, bounded, reversible and conservative.
Semantic meaning for places | Semantic meaning for transitions | ||
p 11 | R 1 is ready | t 11 | R 1 starts picking components |
p 12 | Components for R 1 are available | t 12 | R 1 starts inserting components |
p 13 | R 1 is picking components from feeder | t 13 | R 1 starts moving out the product |
p 14 | R 1 is inserting components in PCB area | t 21 | R 2 starts picking components |
p 21 | R 2 is ready | t 22 | R 2 starts inserting components |
p 22 | Components for R 2 are available | t 23 | R 2 starts moving out the finished product |
p 23 | R 2 is picking components from feeder | ||
p 24 | R 2 is inserting components in PCB area | ||
r 1 | Feeder area is available | ||
r 2 | PCB area is available |
Assembly process 1 : C1 requests R1. After acquiring R1, it requests R2. After acquiring R2, it performs assembling and then releases both R1 and R2 simultaneously.
Assembly process 2 : C2 requests R2. After acquiring R2, it requests R3. After acquiring R3, it perform assembling and then releases both R2 and R3 simultaneously.
Assembly process 3 : C3 requests R3. After acquiring R3, it requests R1. After acquiring R1, it perform assembling and then releases both R3 and R1 simultaneously.
Figure 16 shows an augmented marked graph (N, M0; R), representing the flexible assembly system. Table 4 shows the semantic meanings of the places and transitions.
Semantic meaning for places | Semantic meaning for transitions | ||
p 12 | C 1 is occupying R 1 | t 11 | C 1 starts acquiring R 1 |
p 13 | C 1 is occupying R 1 and R 2 | t 12 | C 1 starts acquiring R 2 |
p 21 | C 2 is ready | t 13 | C 1 finishes assembling and release R 1 and R 2 |
p 22 | C 2 is occupying R 2 | t 21 | C 2 starts acquiring R 2 |
p 23 | C 2 is occupying R 2 and R 3 | t 22 | C 2 starts acquiring R 3 |
p 21 | C 3 is ready | t 23 | C 2 finishes assembling and release R 2 and R 3 |
p 22 | C 3 is occupying R 3 | t 31 | C 3 starts acquiring R 3 |
p 23 | C 3 is occupying R 3 and R 1 | t 32 | C 3 starts acquiring R 1 |
r 1 | R 1 is available | t 33 | C 3 finishes assembling and release R 3 and R 1 |
r 2 | R 2 is available | ||
r 3 | R 3 is available |
For the augmented marked graph (N, M0; R) shown in Figure 16, there exists a R-siphon S = { p13, p23, p33, r1, r2, r3 } which becomes empty after firing the sequence of transitions t11, t21, t31 . Based on the results obtained in Section 4, (N, M0; R) is neither live nor reversible. A deadlock would occur after firing t11, t21, t31 . For the R-transform of (N, M0; R), every place belongs to a cycle. Based on the results obtained in Section 5, (N, M0; R) is bounded and conservative. It is then concluded that the flexible assembly system is non-live, non-reversible but bounded and conservative.
8. Conclusion
In the past decade, augmented marked graphs have evolved into a sub-class of Petri nets. They are often used for modelling shared resource systems, such as manufacturing systems. One major reason is that augmented marked graphs possess a special structure which is desirable for modelling shared resources. However, the properties of augmented marked graphs are not extensively studied. In the literature, there are a few published works on augmented marked graphs.
This paper consolidates our earlier works on augmented marked graphs with a special focus on liveness, boundedness, reversibility and conservativeness. We provide a number of characterisations for live and reversible augmented marked graphs. In particulars, some of these characterisations are based on cycles, instead of siphons. Besides, we introduce the R-transformation, on which characterisations for bounded and conservative augmented marked graphs are obtained. With these characterisations, some pretty simple conditions and procedures for checking the liveness, reversibility, boundedness and conservativeness of an augmented marked graph are derived. These have been illustrated using the dining philosophers problem.
Typically, in designing shared resource systems, one need to achieve design objectives on two folds. On one hand, the resources are scarce and should be maximally shared. On the other hand, the system should be carefully designed so that erroneous situations due to the sharing of resources, such as deadlock and capacity overflow, can be avoided. Yet, the verification of liveness, boundedness and reversibility is very difficult and time-consuming. This paper contributes to provide an effective means to analysing these essential properties. By modelling a shared resource system as an augmented marked graph, its liveness, boundedness, reversibility and conservativeness can be effectively analysed, based on the characterisations and properties of augmented marked graphs. We specifically show the application to the analysis of manufacturing systems which are typically shared resource systems. Promising results are obtained.
References
- 1.
Barkaoui K. Couvreur J. M. Dutheillet C. 1995 On Liveness in Extended Non Self-Controlling Nets, ,935 25 44 , Springer-Verlag. - 2.
Cheung K. S. 2004 New Characterisations for Live and Reversible Augmented Marked Graphs, ,92 5 239 243 . - 3.
Cheung K. S. 2005 A Synthesis Method for Designing Shared-Resource Systems, ,24 6 629 653 . - 4.
Cheung K. S. 2006 Modelling and Analysis of Manufacturing Systems Using Augmented Marked Graphs, ,35 1 19 26 . - 5.
Cheung K. S. 2007 Boundedness and Conservativeness of Augmented Marked Graphs, ,24 2 235 244 . - 6.
Cheung K. S. Chow K. O. 2005a Cycle-Inclusion Property of Augmented Marked Graphs, ,94 6 271 276 . - 7.
Cheung K. S. Chow K. O. 2005b Analysis of Manufacturing Systems Based on Augmented Marked Graphs, ,2 847 851 . - 8.
Cheung K. S. Chow K. O. 2005c A Synthesis Approach to Deriving Object-Based Specifications from Object Interaction Scenarios, In : Nilsson et al. (eds.), ,647 656 , Springer. - 9.
Cheung K. S. Chow K. O. 2006 Analysis of Capacity Overflow for Manufacturing Systems, ,287 292 . - 10.
Cheung K. S. Cheung T. Y. Chow K. O. 2006 A Petri-Net-Based Synthesis Methodology for Use-Case-Driven System Design, ,79 6 772 790 . - 11.
Chu F. Xie X. 1997 Deadlock Analysis of Petri Nets Using Siphons and Mathematical Programming, ,13 6 793 804 . - 12.
Desel J. Esparza J. 1995 , Cambridge University Press. - 13.
Desel J. Reisig W. 1998 Place Transition Petri Nets, ,1491 122 173 , Springer-Verlag. - 14.
Huang H. J. Jiao L. Cheung T. Y. 2003 Property-Preserving Composition of Augmented Marked Graphs that Share Common Resources, ,1446 1451 . - 15.
Jeng M. D. Xie X. Huang Y. 2000 Manufacturing Modeling Using Process Nets with Resources, ,2185 2190 . - 16.
Jeng M. D. Xie X. Peng M. Y. 2002 Process Nets with Resources for Manufacturing Modeling and their Analysis, ,18 6 875 889 . - 17.
Murata T. 1989 Petri Nets : Properties, Analysis and Applications, ,77 4 ,541 580 . - 18.
Peterson J. L. 1981 , Prentice Hall. - 19.
Proth J. M. Xie X. 1996 , Wiley. - 20.
Reisig W. 1985 , Springer-Verlag. - 21.
Zhou M. C. Venkatesh K. 1999 , World Scientific.