Special Issue Article

Advances in Mechanical Engineering

2017, Vol. 9(8) 117
The Author(s) 2017
A class of generalized Petri nets and its DOI: 10.1177/1687814017700354
journals.sagepub.com/home/ade
state equation

Rongming Zhu, Ya Zhang and Lan Yang

Abstract
By analyzing the evolution nature of a Petri net, this article reports a generalized state equation for Petri nets, including
Petri nets with inhibitor and enabling arcs. By proposing the generalized state equations, all enabled transitions meeting
the firing condition can fire concurrently. Conflicts can be found when any component of a resulting marking vector by
firing the enabled transitions at some marking becomes negative. We first formulate a novel state equation for regular
Petri nets. Then, it is extended to the nets with inhibitor and enabling arcs. A classical problem with conflicts and concur-
rency, that is, the dining philosophers problem, is taken as an example to validate the proposed state equations of Petri
nets.

Keywords
Petri net, state equation, concurrency, inhibitor arc, enabling arc

Date received: 3 December 2016; accepted: 16 February 2017

Academic Editor: ZhiWu Li

Introduction to set up state equations, algebraic equations, and other

Petri nets provide a powerful mathematical formalism
for modeling concurrent systems and their behavior.
Some researchers propose extensive application in mod-
eling, control, and scheduling of a variety of industrial
processes (Li and Zhou, 2006)1,2. Since they were pro-
posed by Petri,3 many researchers and engineers from
different fields have been working on Petri nets and
their applications to real-world systems.4 Petri nets are
a graphical and mathematical modeling tool that is
applicable to many contemporary technological sys-
tems, such as communication protocols, computer net-
works, traffic systems, distributed database, software,
production systems, C3I (command, control, communi-
cation, and intelligence), Internet web services, social
services, workflow management, and even logistics
security systems.5 As a graphical tool, Petri nets can be
used as visual communication aid similar to flow charts,
block diagrams, and networks. In addition, tokens are
used in a net to simulate the dynamic and concurrent
activities of systems. As a mathematic tool, it is possible
mathematical models governing the behavior of sys-
tems.6 A mathematical approach is applicable to almost
every system, no matter it is complicated or simple.
Due to the inherent properties, Petri nets with their var-
iations have received more and more attentions from
academic and industry communities.
In fact, Petri nets as well as digraphs are becoming a
major mathematical tool to characterize, analyze, and
control various problems in resource allocation sys-
tems, including flexible manufacturing systems (FMS)
(Li and Zhou 2006).7 The graph-theoretic approaches
are suitable for describing the interaction between jobs
and resources even in complex resource allocation sys-
tems.8 As a formalism, Petri nets are used to describe
School of Electro-Mechanical Engineering, Xidian University, Xian, China
Corresponding author:
Rongming Zhu, School of Electro-Mechanical Engineering, Xidian
University, No. 2 South Taibai Road, Xian 710071, China.
Email: zhu.rm@163.com

Creative Commons CC-BY: This article is distributed under the terms of the Creative Commons Attribution 4.0 License
(http://www.creativecommons.org/licenses/by/4.0/) which permits any use, reproduction and distribution of the work without
further permission provided the original work is attributed as specified on the SAGE and Open Access pages (https://us.sagepub.com/en-us/nam/
open-access-at-sage).
2 Advances in Mechanical Engineering
the behavior of FMS and to develop appropriate dead-
lock resolution methods (Li and Zhou, 2006).9 The
major strategies using Petri net techniques to cope with
deadlocks in FMS are deadlock detection and recovery,
deadlock avoidance, and deadlock prevention.1013 In
FMS, deadlock prevention is usually achieved either by
effective system design or using an offline mechanism
to control the requests for resources to ensure that
deadlocks never occur.14 Monitors or control places
and related arcs are often used to achieve such pur-
poses.1517
In addition to the deadlock control problem,1820
Petri nets have found extensive application to many
problems in contemporary resource allocation sys-
tems,14,21,22 such as scheduling (Wu and Zhou,
2012),13,2325,6567 supervisory control,26,27 performance
evaluation, and fault diagnosis.2831 Some extensions to
the basic Petri net structure are developed to overcome
this problem by introducing extended concepts, such as
enabling arcs and inhibitor arcs to control a transition
enabling. Petri nets with inhibitor and enabling arcs
can improve the modeling ability and facilitate the
development of system control approaches. However,
it is difficult for us to use state equations to compute
large and complex systems.
The studies on the state equation of a variety of
Petri nets are essential to their applications, leading to
a lot of results,3245since they can provide an algebraic
approach to the analysis of a Petri net. Burns and
Bidanda30 use the concept of transition variables to
translate a safe Petri net into sequential Boolean equa-
tions but not to formulate the state equation. Chamas
and Singh33 extend the state equations for standard
Petri nets to continuous time systems. However, the
involved equations are differential equations rather
than linear or algebraic equations.33 Lee and Lee34 gen-
erate a new state equation whose transition values are
replaced with transition variables, and it is useful for
analyzing token flows in a Petri net. Baskocagil and
Kurtulan35 propose a generalized state equation by
taking into account both inhibitor and enabling arcs.
Inhibitor arcs have been addressed in the works by
Chen and Li,46 Chen et al.,47 Wu et al.,48 and Lorenz
et al.,49 and enabling arcs in the work by Wu et al.50
Petri nets are used to model discrete event systems and
apply the matrix representation to make the analysis of
controllability and reachability for Petri nets.37 Petri
nets with inhibitor and enabling arcs can increase the
modeling power and facilitate the development of sys-
tem control. But it is difficult for us to use those equa-
tions to compute large and complex systems. However,
all enabled transitions meeting the firing condition can
fire concurrently in our equations. Furthermore, we
can obtain the transition vector only by the equations
we proposed.
Specifically, in a Petri net, if all the enabled transi-
tions at a marking do not have priority and there is no
conflict among the enabled transitions, we can fire
them at the same time. This study proposes a novel
state equation for a variety of extended Petri nets.
Furthermore, the transition firing vector is generated
due to the novel state equation, which helps us to
decide the enabled transitions, firing or not, depending
on the number of tokens of the subsequent markings.
If they meet the firing condition, the enabled transi-
tions can fire at the same time. Otherwise, conflicts can
be found immediately when any component of a mark-
ing vector becomes negative.
The rest of this article is organized as follows: section
Preliminaries and notations introduces some preli-
minaries and notations of general Petri nets. Section
Basic Petri nets and their state equations presents a
state equation representation, enabling and firing rules,
and a classical example illustrating concurrency effi-
ciently. We propose the state equation of Petri nets with
enabling arcs and then show its application in section
Petri nets with enabling arcs and their state equa-
tions. Based on section Petri nets with enabling arcs
and their state equations, section Extended Petri nets
and their state equations proposes the generalized
state equations of extended Petri nets, namely, the Petri
net with enabling and inhibitor arcs and then an appli-
cation is shown. Finally, section Conclusion con-
cludes this article.
Preliminaries and notations
Basics of Petri nets
A Petri net51 is defined as a five-tuple
PN = (P, T , I, O, M0 ), where P = fp1 , p2 , . . . , pn g is a
finite and non-empty set of places and
T = ft1 , t2 , . . . , tn g is a finite and non-empty set of tran-
sitions with P \ T = [. I : (P 3 T ) ! N is an input
function that defines directed arcs from places to tran-
sitions, where N is a set of non-negative integers.
O : (T 3 P) ! N is an output function that defines
directed arcs from transitions to places. M0 : P ! N is
the initial marking. A marking is a |P|-dimensional
non-negative integer column vector.

tj = fpi j(pi , tj ) 2 Ig is called the preset of transition tj ,
and tj = fpi j(pi , tj ) 2 Og is called the post-set of transi-
tion tj . A marking in a Petri net is a mapping
M : P ! N . M(pi ) denotes Pthe number of tokens in
places pi at a marking M. p2P M(p)p is used to denote
vector M for economy of space. The tokens in places
are used to define the execution of a Petri net. An input
arc denotes an arc from a place to a transition. An out-
put arc denotes an arc from a transition to a place. The
weights of an input arc and of an output arc are,
Zhu et al.
respectively, denoted by I(pi , tj ) and O(tj , pi ), where
i = 1, 2, . . . , n, j = 1, 2, . . . , m.
In a Petri net, a transition t 2 T is enabled at a
marking M if 8p2 t, M(p)  I(p, t). This fact is denoted
by M[ti. Firing it yields a new marking M# such that
8p 2 P, M 0 (p) = M(p)  I(p, t) + O(t, p), as denoted by
M[tiM#. M# is called an immediately reachable mark-
ing from M. Marking M$ is said to be reachable from
M if there exists a sequence of transitions s = t0 t1    tn
and markings M 1 , M2 , . . . , Mn such that
Mt0 iM1 t1 iM2    Mn tn iM 00 holds. The set of markings
reachable from M in the Petri net is called the reach-
ability set of the Petri net. The reachability set of a
Petri net can be expressed by a reachability graph. A
reachability graph is a directed graph whose nodes are
markings in the reachability set and arcs are labeled by
the transitions of the net. An arc from M1 to M2 is
labeled by t if M1 tiM2 . A Petri net is dead at M0 if
= t 2 T , M0 ti.
9 In a state k, according to Definitions 1 and 2, the
Definition 1. Let PN = (P, T , I, O, M0 ) be a Petri net, pi
be a place, and tj be a transition.51
1. A transition tj is said to be enabled at a marking
M if
 
M pi  I pi , tj , 8pi 2 tj 1 obtain the next state using the state equation when a
2. Once an enabled tj fires, its firing yields a new
marking M#
 
M 0 pi = M pi + J pi , tj , 8pi 2 P 2
where
     
J pi , tj = O tj , pi  I pi , tj
We define
  
J = J pi , tj
where J is an n 3 m matrix that is called the incidence
matrix of the Petri net.
It is appealing to analyze a Petri net using a set of
linear algebraic equations. This article deals with the
state equation of Petri nets with some extensions. As
known, M 2 N n 3 1 is the vector representing the mark-
ing of places. A transition sequence s corresponds to a
firing vector h = h1 , h2 , . . . , hm T where hj 2 N ,
j = 1, 2, . . . , m, and that hj means whether the transi-
tion tj is enabled in s.
Definition 2. A unit firing vector hu =
h1 , h2 , . . . , hm T 2 f0, 1gm 3 1 is defined35 as follows,
where m is the total number of transitions, hj = 1, and
8i 6 = j, hi = 0, that is
 T
hu = 0, 0, . . . , 1j , . . . , 0, 0
3
Figure 1. A Petri net representing a deterministic parallel
activity.
Source: Adopted from Murata.6
We use hu to denote a unit firing vector, while h, as
defined above, is to denote a firing vector in which there
are multiple 1s. In the vector hu , all of the elements are
assumed to be zero except the jth element, implying that
only the jth transition is enabled.
state equation of a Petri net can be written as follows if
a marking M(k + 1) is reachable from M(k) by firing a
transition t whose firing vector is hu (k + 1)
M(k + 1) = M(k) + Jhu (k + 1) 6
where k = 0, 1, 2, . . . . This equation means that we can
transition triggers.
Reachability is a fundamental problem for studying
the dynamic properties of a system modeled with Petri
nets.6 A Petri net is said to be reachable from a state k
to state k + 1 if there exists a unit firing vector
hu (k + 1) that transforms M(k) to M(k + 1) by firing
transition tj. When a feasible transition sequence s is
3 considered, we have the following state equation that
can be seen and popularly used in the literature, that is,
M(k + 1) = M(k) + Jh(k + 1), where h(k + 1) is the
Parikh vector of transition sequence s.5,6,52
4 Parallel activities or concurrency can be easily
expressed in terms of Petri nets.6 In general, two transi-
tions are said to be parallel or concurrent if they are
causally independent, that is, one transition may fire
before, after, or in parallel with the other, as in the case
of t2 and t3 in Figure 1.
Two transitions t1 and t2 as shown in Figure 2(a) are
in conflict since either t1 or t2 can occur, but not both
when the place p1 has one token. Two transitions are par-
allel or concurrent if both can occur in any order without
conflicts. A situation where conflict and concurrency are
mixed is called a confusion,6 as shown in Figure 2(b).
Inhibitor and enabling arcs
An inhibitor arc is a type of arcs from a place to a tran-
sition and its semantics is to disable the transition when
5 the place contains one or more tokens.46,47,5255 It
4 Advances in Mechanical Engineering

Figure 4. An enabling arc.

Figure 2. Petri nets representing conflict and confusion.

Source: Adopted from Murata.6

Figure 3. An inhibitor arc. Figure 5. An illustration of the state equation.

makes the net have the ability to test the absence of That a Petri net is legal at state k + 1 means that the
tokens in a place. As the complementary of inhibitor net is reachable from a reachable state k (from the ini-
arcs, the concept of enabling arcs is introduced by tial marking) to k + 1 by firing a transition. Then, we
Uzam.53 It is a type of arcs from a place to a transition can define the novel state equation.
and its semantics is to enable the transition when the The state equation of a Petri net can be represented
by equation (8), where the first equation is called the
place contains one or more tokens,46,47,53 and if the
transition equation, and the second is called the place
transition fires, it does not change the token count in
equation. pi (k) is the ith element of M(k), that is, the
the place. It makes the net have the ability to test the
number of tokens in the place pi
presence of tokens in a place.

Definition 3. Let P be a place and t be a transition with h(k + 1) = I(P, T )  M(k)
an inhibitor arc labeled with a weight D(p, t) as shown M(k + 1) = M(k) + Jh(k + 1)
in Figure 3. The transition t is disabled at a marking M k = 0, 1, 2, . . .
if M(p)  D(p, t), that is, t is enabled if M(p)\D(p, t). 8
(  
Firing the enabled transition t does not change the   1, M pi  I pi , tj
I pi , tj  pi (k) =  
token count in place p.46 0, M pi \I pi , tj
Definition 4. Let p be a place and t be a transition with where
an enabling arc labeled with a weight E(p, t) as shown
in Figure 4. The transition t is enabled at a marking M   
I(P, T) = I pi , tj 2 N m 3 n
if M(p)  E(p, t) and firing the enabled transition t does    
hj (k + 1) = ^ni= 1 I pi , tj  pi (k)
not change the token count in place p.46
Xm
pi (k + 1) = pi (k) + Jhj (k + 1)
j=1
Basic Petri nets and their state equations
i = 1, 2, . . . , n, j = 1, 2, . . . , m
State equations
From this definition, if h(k + 1) = 0 holds, the net is
In this section, we extend the concept of state equations dead at state k. If h(k + 1) 6 0 and 8pi 2 P,
to a more general case. Before defining the novel state pi (k + 1) 2 N , the net is said to be reachable from M(k)
equations, we present an auxiliary definition as follows. to M(k + 1) by firing transition tj with hj (k + 1) = 1.
Definition 5. A Petri net is said to be illegal at state If h(k + 1) 6 0 and 9pi 2 P, pi (k + 1) 62 N , that is, in
k + 1 if state k, there are several transitions that are enabled;
however, their concurrent firing will lead to a fact that
9pi (k + 1) 62 N 7 the number of tokens in a place pi is not a non-negative
integer as shown in Figure 5. In this state, the net is said
where pi (k + 1) is the number of tokens in pi at mark- to be unreachable (or illegal as defined in Definition 5).
ing M(k + 1). That is to say, if the number of tokens in A small example to illustrate the above state equation
pi is a negative integer, the state is said to be illegal, is given as follows.
i = 1, 2, . . . , n. In Figure 5
Zhu et al.
2 3 2 3 2 3
1 1 0
6 7 6 7 6 7
M(0) = 4 1 5, I(P, T ) = 4 1 5, O(P, T ) = 4 0 5
0 0 1
2 3
1
6 7
J (P, T ) = O(P, T )  I(P, T ) = 4 1 5
1
I p1 , t1  p1 (k) = 1 due to M(p1 )  I p1 , t1
I p2 , t1  p2 (k) = 1, I p3 , t1  p3 (k) = 1
h1 (1) = ^3i = 1 I pi , t1  pi(k) = 1 ^ 1 ^ 1 = 1
2 3 2
1 1
6 7 6
h(1) = 1 M(1) = M(0) + Jh(1) = 4 1 5 + 4 1 5 = 4 0 5
0 1
Modeling the dining philosophers problem
using Petri nets
Here, we introduce a classical problem, the dining phi-
losophers problem, to illustrate the proposed state
equation. The dining philosophers problem is proposed
by Dijkstra.56 Dijkstra describes the philosophers din-
ing system in the work by Dijkstra56 as follows:
Five philosophers, numbered from 1 to 5, are living in a
house where the table is laid for them, each philosopher
having his own place at the table. Their only problem,
besides those of philosophy, is that the dish served is a kind
of noodles that have to be eaten with two forks. There are
two forks next to each plate. However, no neighbors may
be eating simultaneously.
Unfortunately, there may be a situation that all the
five philosophers take their left forks simultaneously.
None will be able to take their right forks and then
they will wait indefinitely. Thus, a deadlock occurs.
The Petri net model57 for this problem in Figure 6 elim-
inates the deadlock. In Figure 6, G, R, H, and E stand
for get forks, return forks, thinking, and eat-
ing, respectively, and the philosophers are denoted by
indices 1, . . . , 5. For i = 1, . . . , 5, condition Fi denotes
that fork i is available for its users.
Equal opportunity is provided by symmetry; if all
the forks are available, each philosopher may switch
from thinking to eating, while if a fork is missing, its
replacement immediately enables the waiting philoso-
pher.58,6264
We can see that the initial marking enables each phi-
losophers get forks transition, in competition with
his neighbors get forks transitions. Hence, it has
many different runs for sequential runs, on which most
of the mentioned literature is based.
Now, we turn to consider concurrency in the model.
For this example, there is no priority for the philoso-
phers and then they may take the forks simultaneously,
which leads to the fact that none of them can eat
5
Figure 6. Petri net model for the dining philosopher problem.
3 2 3
0
7 6 7 noodles successfully. We use the proposed state equa-
1
tions to explain the problem as follows.
First, we define marking vector M(k) =
H T (k), ET (k), F T (k)T , where H(k) = H1 (k), H2 (k),
H3 (k), H4 (k), H5 (k)T , E(k) = E1 (k), E2 (k), E3 (k), E4 (k),
E5 (k)T , and F(k) = F1 (k), F2 (k), F3 (k), F4 (k), F5 (k)T .
Similarly, we define transition vector h(k) =
GT (k),RT (k)T , where G(k)=G1 (k),G2 (k),G3 (k),G4 (k),
G5 (k)T and R(k)=R1 (k),R2 (k),R3 (k),R4 (k),R5 (k)T .
Then, we can find I(P, T ) and O(T, P), as shown in
Appendix 1, and calculate J using equation (3). From
Figure 6, the initial marking is M(0) = [1 1 1 1 1 0 0 0
0 0 1 1 1 1 1]T.
Using equation (8) and M(0), we have
x1 = ^15 i = 1 I(pi , t1 )  pi (0) = 1, x2 = x3 = x4 = x5 = 1,
and x6 = x7 = x8 = x9 = x10 = 0. pi (0) denotes the
number of tokens in place pi at the initial state.
Thus, we have
h(1) = x1 , x2 , . . . , x10 T = 1 1 1 1 1 0 0 0 0 0T 9
From equation (9), we can find that G1 (1), G2 (1),
G3 (1), G4 (1), and G5 (1) are enabled, which indicates
that any philosopher, not all, has a chance to get the
forks. In order to describe the concurrency, we fire the
enabled transitions simultaneously without priority. In
other words, using equation (8) and h(1), we obtain
M(1) = M(0) + Jh(1)
= 0 0 0 0 0 1 1 1 1 1  1  1  1  1  1 T
10
Equation (10) shows that the tokens in the places
representing forks become negative, which is equivalent
to a test on the net. Thus, we conclude that there exist
conflicts or confusions in the net at the initial state,
which can be found easily by equation (10). However,
for this model, it is possible that two philosophers could
collude to starve the third. To solve the collision prob-
lem, we propose Petri nets with enabling arcs and their
state equations. Actually, it generates the priority for
the transition that represents get forks of the five phi-
losophers, and the net becomes deterministic, that is, it
can determine which two philosophers can eat at the
same time.
6 Advances in Mechanical Engineering

Algorithm 1 Reachability set computation by the general-

ized state equation of a Petri net with enabling arcs
Input: a Petri net model with enabling arcs, P N 1 = (P, T,
I, O, E, M0 ).
Figure 7. Two types of arcs from pi to tj .
Output: transition vector h(k) for each step and reachability
set R.
1: Compute S(P, T ) the state matrix and J the incidence
Petri nets with enabling arcs and their
matrix.
state equations 2: Starting from M (0) the reachability set R is initially
Definition empty.
3: k = 0; compute h(k + 1).
A Petri net with enabling arcs is formally defined as a 4: while there is at least one transition is enabled at M (k)
six-tuple PN 1 = (P, T , I, O, E, M0 ), where and the marking has no label do
PN = (P, T , I, O, M0 ) is a Petri net and 5: compute M (k + 1) the corresponding marking by
E  (P 3 T ) ! N is the input function that defines ring the enabled transitions.
weighted enabling arcs from places to transitions. The 6: if {M (k + 1) is legal} then
weight of an enabling arc is denoted as E(pi , tj ), where 7: if {M (k + 1)} is not in R then
E(pi , tj ) = 0 if E(pi , tj ) 62 E where i = 1, 2, . . . , n, 8: Add it.
j = 1, 2, . . . , m. An enabling arc can enable a transition 9: else
if the number of tokens in its incoming place is equal 10: Label it existed.
or greater than the weight of enabling arc. We use tj 11: end if
12: end if
to represent the set of the places connected with tj by
13: k++; compute h(k + 1).
enabling arcs.
14: end while
Similarly, the evolution of PN1 is described by the 15: Output h(k) and R.
movement of tokens between places and accomplished 16: end
by the firing of the enabled transitions. Without loss of
generality, let pi be a place and tj be a transition with a
weighted regular arc with a label I(pi , tj ) on it and a
Similarly, at step k, the state equation of a Petri net
weighted enabled arc with a label E(pi , tj ). It can be gra-
with enabling arcs is represented by the transition vec-
phically represented by two arcs from pi to tj , as shown
tor h(k) and marking vector M(k). The enabled transi-
in Figure 7.
tions are represented as S(P, T )  M(k). Therefore, the
Definition 6. Let PN 1 = (PN , E) be a Petri net with state equation can be rewritten as
enabling arcs, and pi be a place and tj be a transition. 
Transition tj is said to be enabled at a marking M if the h(k + 1) = S(P, T )  M(k)
13
following two conditions are satisfied: M(k + 1) = M(k) + Jh(k + 1)

The rule of operator * is the same as equation (8),

1. M(pi )  I(pi , tj ), 8pi 2 tj ;
and an algorithm for computing M(k) and h(k) is pre-
2. M(pi )  E(pi , tj ), 8pi 2 tj .
sented as follows.

Once the enabled transition tj fires, its firing yields a By Algorithm 1, the marking of each place can be
new marking M# computed. First, we can obtain I(P, T ), O(T , P),
E(P, T ), and M(0) according to the net. Then, equations
    (12) and (3) are used to compute S(P, T ) and J . We can
M 0 pi = M pi  I pi , tj + O tj , pi , 8pi 2 P
obtain h(k + 1) and M(k + 1) by equation (13). Then,
In order to mathematically describe and analyze a by comparing M(k + 1) to the set R, we can decide
Petri net with enabling arcs defined by Definition 6, an whether to put M(k + 1) into the set R. By these steps,
enabling arc matrix E(P, T ) 2 N m 3 n and a state matrix the markings of places and the transition vectors can
S(P, T) 2 N m 3 n are defined as follows be obtained.
By Algorithm 1, the marking of each place can be
  
EP, T = E pi , tj 11 computed. Its computational complexity is related to
   the number of places and transitions. In this article, n
S P, T = S pi , tj 12 denotes the number of places and m denotes that of
transitions. The computational complexity of
where S(pi , tj ) = maxI(pi , tj ), E(pi , tj ). Algorithm 1 is O(mn).
Zhu et al.
Figure 8. A controlled net.
Figure 9. Petri net controller with enabled arcs.
Modeling the dining philosophers problem using Petri
nets with enabling arcs
Figure 8 shows a controlled net consisting of five places
and five transitions. In the net, there are two tokens
flowing through the net. To prevent the occurrence of
deadlocks, the two tokens cannot exist in any two adja-
cent places. Actually, we can understand this solution
just like the arbitrator approach: a philosopher can
only get the two forks or none by introducing an arbi-
trator, for example, a waiter. In order to get the forks,
a philosopher must ask permission of the waiter. The
waiter gives permission to only one philosopher at a
time until he has gotten his two forks. Here, the two
tokens in the controlled net can be regarded as two
waiters, who ask the five philosophers by turn. In fact,
the forks are available again when the waiter turns to
one philosopher, and hence, the two waiters cannot ask
adjacent philosophers, otherwise, conflicts may happen
again.
We apply the controlled net to the original net
through enabling arcs, as shown in Figure 9. Only
when the right and left forks of a philosopher are avail-
able, and one waiter walks to him and allows him to
eat, can the philosopher pick up his left and right forks.
In the following, we use the proposed state equations
to explain and verify its validity.
First, we define marking vector M(k) = H T (k),
E (k), F T (k), C T (k)T , where C(k) = C1 (k), C2 (k), C3 (k),
T Figure 10.
C4 (k), C5 (k)T and the others are the same as above.
Similarly, we define transition vector h(k) = GT (k),
R (k), hTC (k)T , where hTC (k) = tC1 (k), tC2 (k), tC3 (k),
T
tC4 (k), tC5 (k)T and the others are the same as above.
Then, we can find I(P, T ), O(P, T), E(P, T ), and
S(P, T ) according to equations (11) and (12), as shown
7
in Appendix 2, and calculate J using equation (3).
Next, from Figure 9, the initial marking is M(0) = [1 1
1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0]T.
According to the state equation of a Petri net with
enabling arcs, we can compute h(1). We only need to
observe transitions G and R since we model the Petri
net for solving the problem of philosopher dining.
Thus, we put GT (k), RT (k)T and the markings of places
into a table. In state 1, we can see G1 (1) and G3 (1) are
enabled. The philosophers 1 and 3 can get forks when
they fire. Then, R1 (1) and R3 (1) are enabled. The two
philosophers return forks when the transitions fire.
Finally, by repeatedly using equation (13) and M(0),
the results can be obtained, as listed in Table 1.
From Table 1, we can find that the enabled transi-
tions at any time can fire simultaneously because of the
strong concurrency of this system. A philosopher will
eat two times continuously, and some other philoso-
phers keep thinking. In order to ensure that the five phi-
losophers can eat by turns, we propose a new class of
Petri nets as well as their state equation.
Extended Petri nets and their state
equations
Definition
An extended Petri net with enabling arcs and inhibitor
arcs is formally defined as a seven-tuple
EPN = (P, T , I, O, M0 , D, E), where PN45 is a Petri net
and D  (P 3 T ) ! N is the input function that defines
weighted inhibitor arcs (hollow circle-headed arcs)
from places to transitions. The weights of the inhibitor
arcs are denoted as a matrix D(P, T ), where
D(pi , tj ) = + if D(pi , tj ) 62 D, i = 1, 2, . . . , n,
j = 1, 2, . . . , m. An inhibitor arc can inhibit a transition
to be enabled if the number of tokens on its incoming
place is more than the weight of the inhibitor arc.
8
Furthermore, tj represents the set of the places con-
nected with tj by inhibitor arcs.
Similarly, the evolution of EPN is also described by
the movement of tokens between places and accom-
plished by firing the enabled transitions. Without loss
of generality, let pi be a place and tj be a transition with
a weighted regular arc with a label I(pi , tj ), a weighted
enabled arc with a label E(pi , tj ), and a weighted inhibi-
tor arc with a label D(pi , tj ). It can be graphically repre-
sented by above three arcs from pi to tj , as shown in
Definition 7. Let EPN = (PN, D, E) be a Petri net with
enabling arcs and inhibitor arcs, pi be a place, and tj be
a transition.
 Transition tj is said to be enabled at a marking
M if the following three conditions are satisfied:
8 Advances in Mechanical Engineering

Table 1. Results of the enabling arcs solution.

k GT (k), RT (k)T HT (k), ET (k), F T (k), CT (k)T Remarks

0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0T 3 and 1 get forks

1 1 0 1 0 0 0 0 0 0 0T
2 0 0 0 0 0 1 0 1 0 0T
3 1 0 0 1 0 0 0 0 0 0T
4 0 0 0 0 0 1 0 0 1 0T
5 0 1 0 1 0 0 0 0 0 0T
6 0 0 0 0 0 0 1 0 1 0T
7 0 1 0 0 1 0 0 0 0 0T
8 0 0 0 0 0 0 1 0 0 1T
9 0 0 1 0 1 0 0 0 0 0T
10 0 0 0 0 0 0 0 1 0 1T
0 1 0 1 1 1 0 1 0 0 0 0 0 0 1 0 1 0 0 1T 3 and 1 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 0 1 0T 1 and 4 get forks
0 1 1 0 1 1 0 0 1 0 0 0 1 0 0 0 0 1 0 1T 1 and 4 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 1 0 1 0T 4 and 2 get forks
1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 1 0 1 0 0T 4 and 2 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 1 0 0 1T 2 and 5 get forks
1 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 1 0T 2 and 5 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 1T 5 and 3 get forks
1 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 1 0 1 0T 5 and 3 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0T 3 and 1 get forks, the same as k = 0

Algorithm 2 Reachability set computation using the

generalized state equation of an extended Petri net
Input: a Petri net model with enabling and inhibitor arcs,
EP N = (P N, D, E).
Output: transition vector h(k) for each step and reachability Figure 10. Three types of arcs from pi to tj .
set R.
1: Compute S(P, T ) the state matrix, and J the incidence   
matrix, and D(P, T ) the inhibitor arc matrix.   1, M pi \D pi , tj 
D pi , tj 8pi (k) =
2: Starting from M (0) the reachability set R is initially 0, M pi  D pi , tj
empty.
3: k = 0; compute h(k + 1). An algorithm for the reachability set using M(k) and
4: while there is at least one transition is enabled at M (k) h(k) is shown as follows.
and the marking has no label do
5: compute M (k + 1) the corresponding marking by The description of this algorithm is the same as
ring the enabled transitions. Algorithm 1. Finally, we can obtain the transition vec-
6: if {M (k + 1)} is legal then tor and the markings of places. Then, we will explain
7: if M (k + 1) is not in R then how to solve the Five Dining Philosophers Problem
8: Add it. without continuously eating two times by a philosopher
9: else through applying extended Petri nets proposed in this
10: Label it existed. article.
11: end if
12: end if
13: k + +; compute h(k + 1). Modeling the dining philosophers problem using
14: end while
extended Petri nets
15: Output h(k) and R.
16: end In this solution, we apply weighted inhibitor arcs to the
control of the dining philosophers problem, as shown
in Figure 11, which will ensure that the five philoso-
1. M(pi )  W (pi , tj ), 8pi 2 tj ; phers can eat by turns. From the definition of a
2. M(pi )  E(pi , tj ), 8pi 2 tj ; weighted inhibitor arc whose weight is w, transition t is
8
3. M(pi )\I(pi , tj ), 8pi 2 tj . disabled by p if M(Ci )  w. If t is enabled and fires, it
 Once tj fires, its firing yields a new marking does not change the tokens in Ci (i = 1, 2, . . . , 5). In
M 0 (pi ) = M(pi )  I(pi , tj ) + O(tj , pi ), 8pi 2 P. Figure 11, between Ci and tCi , both weighted inhibitor
and regular arcs exist, and all the weighted inhibitor
In order to mathematically describe and analyze arcs are labeled by 2. As a result, only when M(Ci ) = 1,
Petri net with enabling arcs given in Definition 7, we the corresponding transition is enabled. Moreover, the
define an inhibitor arc matrix D(P, T ) 2 N m 3 n as weight of the output arc from Ci is 2 and the weight of
follows tDi to Ci is 2.
Then, we use the state equations to explain the solu-
  
D(P, T ) = D pi , tj 14 tion. First, we define marking vector M(k) as follows:
M(k) = H T (k), ET (k), F T (k), C T (k)T .
The operation rule of operator 8 is defined by
Zhu et al. 9

Table 2. Results of an extended Petri net solution.

k GT (k), RT (k)T HT (k), ET (k), F T (k), CT (k)T Remarks

0 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0T 1 and 3 get forks

1 1 0 1 0 0 0 0 0 0 0T
2 0 0 0 0 0 1 0 1 0 0T
3 0 1 0 0 1 0 0 0 0 0T
4 0 0 0 0 0 0 1 0 0 1T
5 1 0 0 1 0 0 0 0 0 0T
6 0 0 0 0 0 1 0 0 1 0T
7 0 0 1 0 1 0 0 0 0 0T
8 0 0 0 0 0 0 0 1 0 1T
9 0 1 0 1 0 0 0 0 0 0T
10 0 0 0 0 0 0 1 0 1 0T
0 1 0 1 1 1 0 1 0 0 0 0 0 0 1 2 0 2 0 0T 1 and 3 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 1 0 0 1T 2 and 5 get forks
1 0 1 1 0 0 1 0 0 1 0 0 0 1 0 0 2 0 0 2T 2 and 5 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 0 1 0T 4 and 1 get forks
0 1 1 0 1 1 0 0 1 0 0 0 1 0 0 2 0 0 2 0T 4 and 1 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 0 1 0 1T 3 and 5 get forks
1 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 2 0 2T 3 and 5 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 0 1 0 1 0T 2 and 4 get forks
1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 2 0 2 0T . 2 and 4 return forks
1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0T 1 and 3 get forks, the same as k = 0

inhibitor arcs matrix D, enabling arcs matrix E, and

incidence matrix J of the extended net are given in
Appendix 3.
From Table 2, we can see that this method can
ensure that the five philosophers eat by turn in accor-
dance with their seats. The phenomenon that a philoso-
pher eats two times continuously can be eliminated.

Example of the extended Petri net

Figure 11. Application of an extended Petri net to the control
of the dining philosophers problem.
Similarly, we define transition vector h(k) =
GT (k), RT (k), hTC (k), hTD (k)T , where hTD (k) = tD1 (k),
tD2 (k), tD3 (k), tD4 (k), tD5 (k)T .
Then, we can find I(P, T ) and O(T , P) according to
equation (1), E(P, T ) and S(P, T ) according to equations
(11) and (12), and D(P, T ) according to equation (14),
as shown in Appendix 3, and calculate J using equation
(3).
Finally, we can obtain equation (12). Now, from
Figure 10, the initial marking is
M(0) = 1 1 1 1 1 0 0 0 0 0 1 1 1 1 1 1 0 1 0 0T
Our goal is to observe transitions G and R since we
model the Petri net for solving the problem of philoso-
pher dining. Thus, we put GT (k), RT (k)T and the mark-
ings of places into a table. By repeatedly using equation
(15) and M(0), the results can be obtained, as listed in
Table 2.
This table shows the transition vector and the mark-
ing vector in every state. The remarks show which phi-
losopher can eat when the enabled transitions fire in a
transition vector. Then, we use the state equations to
explain the solution. The regular arc matrices I and O,
As known, deadlocks often occur in a resource alloca-
tion system owing to the existence of shared resources
(Wu and Zhou, 2012).19,20,28 It can make an impact on
the running of a system. Petri nets have an important
effect on modeling and controlling these computer-
integrated systems.14,18,21,24 The reachability graph
analysis is also useful for us to solve the deadlock prob-
lem. The reachability graph obtained by analyzing the
net model can entirely reflect the flow of tokens in the
places, as well as the dynamic behavior of a system. An
extended Petri net is given in Figure 12.
In Figure 12, we add some arcs between places and
transitions to achieve the deadlock control purpose. A
weighted enabling arc is added connecting p1 and t1 .
Similarly, there is also a weighted enabling arc between
p10 and t6 . The number of tokens in place p1 or p10 can-
not change when transition t1 or t6 is enabled and fired.
Next, there is one weighted inhibitor arc from p12 to t8
and the other inhibitor arc from p13 to t3 . Once t3 or t8
is enabled and is fired, the number of tokens in p12 or
p13 cannot change. Then, we use the proposed state
equation to present this Petri net with inhibitor arcs
and enabling arcs.
When there are no weighted enabling and inhibitor
arcs in Figure 12, we use the state equations of Petri
nets proposed in our article to compute the reachability
graph. According to the equations, all enabled transi-
tions can fire concurrently. By equations (3) and (8), we
know that M = [1 1 1 0 0 1 2 0 0 1 0 0 0 0] is a dead
10
Table 3. Results of the enabling and inhibitor arcs solution.
k h(k)
0 [4 0 0 0 0 0 0 0 0 4 1 2 2 1]T
1 [1 0 0 0 0 1 0 0 0 0]T
2 [0 1 0 0 0 0 1 0 0 0]T
3 [0 0 1 0 0 0 0 1 0 0]T
4 [0 0 0 1 0 0 0 0 1 0]T
5 [0 0 0 0 1 0 0 0 0 1]T
Figure 12. Example of an extended Petri net.
marking, which shows there exists deadlock in this Petri
net.
Then, we apply the weighted enabling and inhibitor
arcs to solve the deadlock problem shown in Figure 12
and compute markings by the proposed state
equations.
First, we define marking vector M(k) =
p1 (k), p2 (k), . . . , p14 (k)T , where pi (k), i = 1, 2, . . . , 14,
denotes the number of tokens in the place pi in the state
k. Similarly, we define transition vector h(k) =
t1 (k), t2 (k), . . . , t10 (k)T , where ti (k), i = 1, 2, . . . , 10,
denotes the value of the transition ti in the state k.
Then, we can find I(P, T ) and O(T , P) according to
equation (1), E(P, T ) and S(P, T ) according to equa-
tions (11) and (12), and D(P, T ) according to equation
(14) and calculate J using equation (3). Next, from
Figure 12, the initial marking is M(0) = [4 0 0 0 0 0 0 0
0 4 1 2 2 1]T.
Advances in Mechanical Engineering
M(k) Remarks
[3 1 0 0 0 1 0 0 0 3 0 2 2 0]T t1 and t6 are enabled and fired
[3 0 1 0 0 0 1 0 0 3 1 1 1 1]T t2 and t7 are enabled and fired
[3 0 0 1 0 0 0 1 0 3 1 0 0 1]T t3 and t8 are enabled and fired
[3 0 0 0 1 0 0 0 1 3 0 2 2 0]T t4 and t9 are enabled and fired
[4 0 0 0 0 0 0 0 0 4 1 2 2 1]T t5 and t10 are enabled and fired
According to the state equation of a Petri net with
the weighted enabling and inhibitor arcs, we can com-
pute h(1). We only need to observe transition t since we
model the Petri net for solving the problem of dead-
locks. Thus, we show h(k) = t1 (k), t2 (k), . . . , t10 (k)T
and the markings of places in Table 3. In state 1, we
can see that t1 and t6 are enabled. Next, in state 2, t2
and t7 are enabled. Finally, by repeatedly using equa-
tion (15) and M(0), the results can be obtained, as listed
in Table 3.
This table shows the transition vector and the mark-
ing vector in every state. The remarks show which tran-
sitions can enable and fire in a transition vector. Then,
we use the state equations to explain the solution. The
regular arc matrices I and O, inhibitor arcs matrix D,
enabling arcs matrix E, and incidence matrix J of the
Petri net with enabling and inhibitor arcs are computed
by the proposed state equations in this article.
From Table 3, we can see that the system has no
deadlock problem. The transitions can be enabled by
turns and the markings computed by the proposed
state equations form a cycle from M(0) to M(5), which
shows that no deadlocks are in this extended Petri net.
However, we can see that the proposed equation is very
useful to test whether a Petri net has the problem of
deadlocks or confusion.
Conclusion
This article proposes new state equations for Petri nets.
Using the inhibitor and enabling arcs, we can solve the
dining philosophers problem and validate the proposed
equations. The proposed state equation takes the form
similar to the statespace representation of a linear
(continuous time-invariant) system with multiple inputs
and outputs. Under this state equation, all enabled
transitions meeting the firing condition can fire concur-
rently. It is useful for analyzing concurrent systems. We
can use the equations to compute the transition vectors
and the markings of places and also test whether there
exist conflicts or confusions. If there is no conflict in
the net at the initial state, we can obtain legal subse-
quent markings with the simultaneous firing. The defi-
nition of the state matrix takes regular arcs, enabling
Zhu et al.
arcs, and weighted inhibitor arcs into account, which is
convenient for analyzing extended Petri nets with the
three types of arcs.
Future work includes the algebraic equation descrip-
tion for siphons and traps that are important to the
development of deadlock prevention policies for
resource allocation systems modeled with Petri
nets.26,59,60 We will also investigate the state equations
of Petri nets with interval inhibitor arcs46 and date deci-
sion arcs.61
Acknowledgements
R.Z. proposed a new mathematical method to describe the
behavior of Petri nets and wrote this paper. Y.Z. and R.Z.
built state equations of the dining philosophers by applying
above suggestion. Y.Z. and L.Y. validated the equations by a
computer program.
Declaration of conflicting interests
The author(s) declared no potential conflicts of interest with
respect to the research, authorship, and/or publication of this
article.
Funding
The author(s) disclosed receipt of the following financial sup-
port for the research, authorship, and/or publication of this
article: This work was supported by the National Natural
Science Foundation of China under Grant No. 61673309 and
the Fundamental Research Funds for the Central Universities
under Grant Nos JB160401 and JBG160415.
References
1. Li ZW and Zhou MC. Two-stage method for synthesiz-
ing liveness-enforcing supervisors for flexible manufac-
turing systems using Petri nets. IEEE T Ind Inform 2006;
2: 313325.
2. Li ZW and Zhou MC. Clarifications on the definitions
of elementary siphons in Petri nets. IEEE T Syst Man Cy
A 2006; 36: 12271229.
3. Petri CA. Kommunikation mit automaten (Schriften
des IIM Nr.2). PhD Thesis, University of Bonn, Bonn,
1962.
4. Li ZW, Zhou MC and Jeng MD. A maximally permis-
sive deadlock prevention policy for FMS based on Petri
net siphon control and the theory of regions. IEEE T
Autom Sci Eng 2008; 5: 182188.
5. Li ZW, Liu GY, Hanisch M-H, et al. Deadlock preven-
tion based on structure reuse of Petri net supervisors for
flexible manufacturing systems. IEEE T Syst Man Cy A
2012; 42: 178191.
6. Murata T. Petri nets: properties, analysis, and applica-
tions. P IEEE 1989; 77: 541580.
7. Li ZW, Hu HS and Wang AR. Design of liveness-
enforcing supervisors for flexible manufacturing systems
using Petri nets. IEEE T Syst Man Cy C 2007; 37:
517526.
11
8. Li ZW, Zhou MC and Wu NQ. A survey and compari-
son of Petri net-based deadlock prevention policies for
flexible manufacturing systems. IEEE T Syst Man Cy C
2008; 38: 173188.
9. Li ZW and Zhou MC. Control of elementary and depen-
dent siphons in Petri nets and their application. IEEE T
Syst Man Cy A 2008; 38: 133148.
10. Chen YF, Li ZW and Khalaui M. Design of a maximally
permissive liveness-enforcing Petri net supervisor for flex-
ible manufacturing systems. IEEE T Autom Sci Eng 2011;
8: 374393.
11. Wang X, Li Z and Wonham WM. Dynamic multiple-
period reconfiguration of real-time scheduling based on
timed DES supervisory control. IEEE T Ind Inform 2016;
12: 101111.
12. Ye JH, Li ZW and Giua A. Decentralized supervision of
Petri nets with a coordinator. IEEE T Syst Man Cyb
2015; 45: 955966.
13. Yang F, Wu NQ, Qiao Y, et al. Scheduling of single-arm
cluster tools for an atomic layer deposition process with
residency time constraints. IEEE T Syst Man Cyb. Epub
ahead of print 29 January 2016. DOI: 10.1109/
TSMC.2015.2507140.
14. Xing KY, Hu BS and Chen HX. Deadlock avoidance
policy for Petri-net modelling of flexible manufacturing
systems with shared resources. IEEE T Automat Contr
1996; 41: 289295.
15. Uzam M. An optimal deadlock prevention policy for flex-
ible manufacturing systems using Petri net models with
resources and the theory of regions. Int J Adv Manuf Tech
2002; 19: 192208.
16. Uzam M. The use of the Petri net reduction approach for
an optimal deadlock prevention policy for flexible manu-
facturing systems. Int J Adv Manuf Tech 2004; 23:
204219.
17. Uzam M, Li ZW and Zhou MC. Identification and elimi-
nation of redundant control places in Petri net based live-
ness enforcing supervisors of FMS. Int J Adv Manuf Tech
2007; 35: 150168.
18. Fanti MP and Zhou MC. Deadlock control methods in
automated manufacturing systems. IEEE T Syst Man Cy
A 2004; 34: 522.
19. Chen YF and Li ZW. Design of a maximally permissive
liveness-enforcing supervisor with a compressed supervi-
sory structure for flexible manufacturing systems. Auto-
matica 2011; 47: 10281034.
20. Chen YF, Li ZW and Zhou MC. Optimal supervisory
control of flexible manufacturing systems by Petri nets: a
set classification approach. IEEE T Autom Sci Eng 2014;
11: 549563.
21. Xing KY, Zhou MC, Wang F, et al. Resource transition
circuits and siphons for deadlock control of automated
manufacturing systems. IEEE T Syst Man Cy A 2011; 41:
7484.
22. Wang X, Khemaissia I, Khalgui M, et al. Dynamic low-
power reconfiguration of real-time systems with periodic
and probabilistic tasks. IEEE T Autom Sci Eng 2015; 12:
258271.
23. Bai LP, Wu NQ, Li ZW, et al. Optimal one-wafer cyclic
scheduling and buffer space configuration for single-arm
12
multicluster tools with linear topology. IEEE T Syst Man
Cyb 2016; 46: 14561467.
24. Wu NQ, Chu F, Chu CB, et al. Petri net modeling and
cycle time analysis of dual-arm cluster tools with wafer
revisiting. IEEE T Syst Man Cyb 2013; 43: 196207.
25. Wu NQ, Bai LP and Zhou MC. An efficient scheduling
method for crude oil operations in refinery with crude oil
type mixing requirements. IEEE T Syst Man Cyb 2016;
46: 414426.
26. Ma ZY, Li ZW and Giua A. Design of optimal Petri net
controllers for disjunctive generalized mutual exclusion
constraints. IEEE T Automat Contr 2015; 60: 17741785.
27. Tong Y, Li Z and Giua A. On the equivalence of observa-
tion structures for Petri net generators. IEEE T Automat
Contr 2016; 61: 24482462.
28. Basile F, Chiacchio P, Tommasi G, et al. An efficient
approach for online diagnosis of discrete event systems.
IEEE T Automat Contr 2009; 54: 748759.
29. Cabasino MP, Giua A and Seatzu C. Fault detection for
discrete event systems using Petri nets with unobservable
transitions. Automatica 2010; 46: 15311539.
30. Dotoli M, Fanti MP, Mangini AM, et al. On-line fault
detection in discrete event systems by Petri nets and inte-
ger linear programming. Automatica 2009; 45: 26652672.
31. Zaytoon J and Lafortune S. Overview of fault diagnosis
methods for discrete event systems. Annu Rev Control
2013; 37: 308320.
32. Burns GL and Bidanda B. The use of hierarchical Petri
nets for the automatic generation of ladder logic pro-
grams. In: Proceedings ESD IPC conference and exposi-
tion, Detroit, Michigan, 1994, pp.169179.
33. Chamas N and Singh H. A generalized Petri net state
equation. In: Proceedings of the 32nd Midwest symposium
on circuits and systems, Champaign, IL, 1416 August
1989, vol. 1, pp.161164. New York: IEEE.
34. Lee GB and Lee JS. Generating Petri net state equation
with firing condition functions. Syst Anal Model Sim
2003; 43: 557561.
35. Baskocagil C and Kurtulan S. Generalized state equation
for Petri nets. WSEAS Trans Syst 2011; 10: 295305.
36. Popova-Zeugmann L and Pelz E. State equation for
interval-timed Petri nets. In: Proceedings of the interna-
tional workshop CS& P (ed M Szczuka), Pu1tusk, Poland,
2830 September 2011, pp.416419.
37. Murata T. State equation, controllability, and maximal
matchings of Petri nets. IEEE T Automat Contr 1977; 22:
412416.
38. Jeng MD, Jaw RW and Hung PL. Scheduling FMS with
due dates based on Petri net state equations. In: Proceed-
ings of the IEEE international conference on systems, man,
and cybernetics. Computational cybernetics and simulation,
Orlando, FL, 1215 October 1997, vol. 3, pp.27242729.
New York: IEEE.
39. Schmidt K. Narrowing Petri net state spaces using the
state equation. Fundam Inf 2001; 47: 325335.
40. Lee GB, Han ZD and Lee JS. Generalized state equation
of Petri nets with priority. Int J Intell Syst 2003; 18:
11451153.
41. Miyazawa I, Tanaka H and Sekiguchi T. Classification of
solutions of matrix equation related to parallel structure
of a Petri net. In: Proceedings of the IEEE conference on
Advances in Mechanical Engineering
emerging technologies and factory automation, Kauai, HI,
1821 November 1996, vol. 2, pp.446452. New York:
IEEE.
42. Wimmel H and Wolf K. Applying CEGAR to the Petri
net state equation. Log Meth Comput Sci 2012; 8: 115.
43. Werner M and Muhl G. A state equation for Petri nets
with delaying places. In: Proceedings of the13th annual
IEEE international symposium and workshop on engineer-
ing of computer based systems, Potsdam, 2730 March
2006. New York: IEEE.
44. Marsan MA, Conte G and Balbo G. A class of generalized
stochastic Petri nets for the performance evaluation of multi-
processor systems. ACM T Comput Syst 1984; 2: 93122.
45. Uzam M, Li ZW, Gelen G, et al. A divide-and-conquer-
method for the synthesis of liveness enforcing supervisors
for flexible manufacturing systems. J Intell Manuf 2016;
27: 11111129.
46. Chen YF and Li ZW. New Petri net structure and its
application to optimal supervisory control: interval inhi-
bitor arcs. IEEE T Syst Man Cyb 2014; 44: 13841400.
47. Chen YF, Li ZW, Barkaoui K, et al. On the enforcement
of a class of nonlinear constraints on Petri nets. Automa-
tica 2015; 55: 116124.
48. Wu WM, Su HY, Hu JB, et al. Petri net controller synth-
esis for discrete event systems using weighted inhibitor
arc. In: Proceedings of the 2001 IEEE international confer-
ence on robotics & automation, Seoul, South Korea, 2126
May 2001, vol. 4, pp.35823587. New York: IEEE.
49. Lorenz R, Mauser S and Bergenthum R. Testing the
executability of scenarios in general inhibitor nets. In:
Proceedings of the seventh international conference on
application of concurrency to system design, Bratislava,
1013 July 2007, pp.167176. New York: IEEE.
50. Wu WM, Su H and Chu J. Supervisory control of discrete
event systems using enabling arc Petri nets. In: Proceed-
ings of the 2002 IEEE international conference on robotics
and automation, Washington, DC, 1115 May 2002, vol.
2, pp.19131918. New York: IEEE.
51. Lee GB and Lee JS. The state equation of Petri net for
the LD program. In: Proceedings of the IEEE interna-
tional conference on systems, man, and cybernetics, Nash-
ville, TN, 811 October 2000, vol. 4, pp.30513056. New
York: IEEE.
52. Peterson JL. Petri nets. ACM Comput Surv 1977; 9:
223252.
53. Uzam M. Petri-net-based supervisory control of discrete
event systems and their ladder logic diagram implementa-
tions. PhD Thesis, University of Salford, Salford, 1998.
54. Hack M. Petri net language. Computation Structures
Group Member 124, Project MAC. Massachusetts Insti-
tute of Technology, Cambridge, MA, 1975.
55. Reinhardt K. Reachability in Petri nets with inhibitor arcs.
Electron Notes Theor Comput Sci 2008; 233: 239264.
56. Dijkstra EW. Hierarchical ordering of sequential pro-
cesses. Acta Inform 1971; 1: 115138.
57. Reisig W. The decent philosophers: an exercise in concur-
rent behavior, vol. 80. Berlin: Institute of informatics,
Humboldt-Universitat zu Berlin, 2007, pp.273281.
58. Cooprider LW. Petri nets and the representation of stan-
dard synchronizations. Technical report, Carnegie
Zhu et al. 13

Mellon University, Pittsburgh, PA, Computer Science
Department, January, 1976.
59. Zhang JF, Khalgui M, Li ZW, et al. Reconfigurable coor-
dination of distributed discrete event control systems.
IEEE T Contr Syst T 2015; 23: 323330.
60. Li ZW and Zhao M. On controllability of dependent
siphons for deadlock prevention in generalized Petri nets.
IEEE T Syst Man Cy A 2008; 38: 369384.
61. Chen YF, Li ZW, Barkaoui K, et al. Compact supervi-
sory control of discrete event systems by Petri nets with
data inhibitor arcs. IEEE T Syst Man Cyb 2016; 47:
364379.
62. Daniel L and Michael O. On the advantages of free
choice: asymmetric and fully distributed solution to the
dining philosophers problem. In: Proceedings of the 8th
ACM SIGPLAN-SIGACT symposium on principles of
programming languages, Williamsburg, VA, 2628 Janu-
ary 1981, pp.133138. New York: ACM.
63. Wu ZH and Murata T. A Petri net model of a starvation-
free solution to the dining philosophers problem. In: Pro-
ceedings of IEEE workshop on languages for automation,
Chicago, IL, 79 November 1983. New York: IEEE.
64. Liu GJ and Wu ZH. An improved Petri net model of a
starvation-free solution to the dining philosophers prob-
lem. J Syst Simul 2007; 19: 2629.
65. Liu HC, You JX, Li ZW, et al. Fuzzy Petri nets for
knowledge representation and reasoning: a literature
review. Eng Appl Artif Intel 2017; 60: 4556.
66. Wu NQ and Zhou MC. Modeling, analysis and control
of dual-arm cluster tools with residency time constraint
and activity time variation based on Petri nets. IEEE T
Autom Sci Eng 2012; 9: 446454.
67. Wu NQ and Zhou MC. Schedulability analysis and opti-
mal scheduling of dual-arm cluster tools with residency
time constraint and activity time variation. IEEE T
Autom Sci Eng 2012; 9: 203209.

Appendix 1
2 3
1 0 0 0 0 0 0 0 0 0 1 1 0 0 0
60 1 0 0 0 0 0 0 0 0 0 1 1 0 07
6 7
60 0 1 0 0 0 0 0 0 0 0 0 1 1 07
6 7
60 0 0 1 0 0 0 0 0 0 0 0 0 1 17
6 7
60 0 0 0 1 0 0 0 0 0 1 0 0 0 17
I(P, T ) = 6
60
7
6 0 0 0 0 1 0 0 0 0 0 0 0 0 077
60 0 0 0 0 0 1 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 1 0 0 0 0 0 0 07
6 7
40 0 0 0 0 0 0 0 1 0 0 0 0 0 05
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
2 3
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0
60 0 0 0 0 0 1 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 1 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 1 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 1 0 0 0 0 07
O(T , P) = 6
61
7
6 0 0 0 0 0 0 0 0 0 1 1 0 0 077
60 1 0 0 0 0 0 0 0 0 0 1 1 0 07
6 7
60 0 1 0 0 0 0 0 0 0 0 0 1 1 07
6 7
40 0 0 1 0 0 0 0 0 0 0 0 0 1 15
0 0 0 0 1 0 0 0 0 0 1 0 0 0 1

Appendix 2
2 3
1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0
60 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 07
6 7
60 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 07
6 7
60 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 07
6 7
60 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 07
6 7
60 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
I(P, T ) = 6
60 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 077
60 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
40 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 05
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
14 Advances in Mechanical Engineering

2 3
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 7
6 7
6 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 7
6 7
6 7
6 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 7
6 7
O(T , P) = 6
6 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 7
7
6 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 7
6 7
6 7
6 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 7
6 7
4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0
2 3
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 17
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
E(P, T ) = 6
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 077
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 05
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 3
1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0
60 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 07
6 7
6 7
60 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 07
6 7
60 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 07
6 7
60 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 17
6 7
6 7
60 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
S P, T 6 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 07
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
6 7
40 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 05
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
Zhu et al. 15

Appendix 3
2 3
1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0
6 7
60 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 07
6 7
60 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 07
6 7
6 7
60 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 07
6 7
60 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 07
6 7
6 7
60 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
60 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
60 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 07
I(P, T ) = 6
60
7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 077
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 17
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
4 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
2 3
0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
6 7
60 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
60 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 07
6 7
6 7
61 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 07
6 7
60 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 07
6 7
6 7
60 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 07
6 7
60 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 07
6 7
6 7
60 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 07
O(T , P) = 6
60
7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 177
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 07
6 7
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 07
6 7
60 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 07
4 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2
16 Advances in Mechanical Engineering

2 3
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 17
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
E(P, T ) = 6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 07
4 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 3
1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0
6 7
6 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 07
6 7
6 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 07
6 7
6 7
6 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 07
6 7
6 7
6 0 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 17
6 7
6 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 07
6 7
S(P, T ) = 6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 17
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 07
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 07
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 07
4 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
Zhu et al. 17

2 3
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
D(P, T ) = 6
6
7
7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 7
6 7
6 7
6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 7
6 7
4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2