Dynamic Fuzzy Knowledge Representation

via Adaptive Fuzzy Higher Order Petri Nets

M. Amin and D. Shebl
Abstract Knowledge in expert system is vague and updat ed or modified frequently, expert systems are fuzzy and dynamic
systems. Suitable models for them should be adaptable, i.e., the models must have ability to adjust themselves according to the
changes of the systems. However, fuzzy Petri nets (FPN's) and fuzzy higher order Petri nets (FHOPN's) as a modeling
formalisms are not adaptable according to the changes of the weights. This is mainly due to the fixed weights. In this paper, we
propose the formal description of adaptive fuzzy higher order Petri net (AFHOPN) that takes into account the changes of the
weights of the arcs in the fuzzy reasoning process. AFHOPN has the learning ability, but it does not need to transfer i nto the
neural networks. We show how AFHOPN can be used for representing the fuzzy rules of a dynamic rule-based system. Then,
we develop a fuzzy reasoning algorithm and an algorithm for updating the weights. Finally, we give the algebraic forms of the
state equation and the stability analysis of the proposed model.
Index Terms Knowledge representation, Higher order Petri nets , Fuzzy production rules, Fuzzy reasoning.

1 INTRODUCTION
nowledge representation is the method used to en-
code knowledge in an expert systems knowledge-
base [5]. Knowledge representation is an active re-
search area in artificial intelligence (AI). Many me-
thods have been developed for knowledge representa-
tion, such as production rules, semantic nets, frames [5],
and Petri nets (PN's) [15].
PN's theory have been widely used as a graphical
and mathematical modeling tool of large discrete systems
working in concurrent, asynchronous, distributed, paral-
lel, nondeterministic, and/or stochastic [13], [16]. PN's
can be combined with different techniques and theories
such as fuzzy sets [18], neural networks (NN's) [1], and
object-oriented programming. These modified PN's are
widely used in manufacturing systems [11], robots [2],
knowledge based systems [3], [10], and process control
[9],[17]. In order to deal with fuzzy information, Fuzzy
Petri Net (FPN's) introduced in [3].
Higher-Order Petri Nets (HOPN's) are introduced as a
general class of PN's by extending the concept of higher-
order synaptic weights in artificial neural networks to an
arc in PN's due to T. Chow et al. [4]. The major difference
between HOPN's and PN's is the definition of the input
arc. In PN's the arc links only one place to transition, in
HOPN's the input arc links one or more input places to
transition. Quite recently, Fuzzy higher order Petri nets
(FHOPN's) have been introduced for managing uncer-
tainty in expert systems [6].
Since the knowledge in expert systems is updated or
modified frequently, expert systems may be regarded as
dynamic systems. suitable models for them should be
adaptable. In other words, the models must have ability
to adjust themselves according to the changes of the sys-
tems. Some adjustable FPN's are proposed. An algorithm
to adjust thresholds is introduced in [12], but weights'
adjustments were realized by test deign. A generalized
FPN's with two knowledge representation parameters,
input weight and output weight, for multilevel fuzzy rea-
soning is introduced in [7]. A weakness of the model oc-
curs when knowledge system is updated, since the two
parameters are assumed fixed in the whole analysis
process. In [14], an adjustable FPN model is proposed
which can transform some simple FPN into neural net-
works, thus parameters of the corresponding neural net-
works can be trained, however it is only suitable for
OR/AND logic neurons [8]. So, we introduce adaptive
fuzzy higher order Petri net (AFHOPN) that has also the
learning ability of NN's, but it does not need to trans-
formed into NN's. Just as other FPN, FHOPN, and AF-
HOPN's used for knowledge representation and reason-
ing. But AFHOPN has one important advantage: it is
suitable for vague and dynamic knowledge and based on
the transition firing rules, a modification back propaga-
tion learning algorithm is developed to assure the con-
vergence of the weights.
The paper is organized as follows: In section 2, we in-
troduce the formal description of the AFHOPN proposed
model. Section 3 gives the fuzzy knowledge representa-
tion for AFHOPN. Section 4 gives the fuzzy reasoning
algorithm for computing fuzzy beliefs, and the algorithm
for updating the weights. Section 5 gives the algebraic
equations of the proposed model, the stability analysis
Finally, in section 6, we draw the conclusions.

M. Amin is with the Mathematics and Computer Science Department,
Faculty of Science, Menoufiya University (Post Number 32511,Shebin El-
komMenoufiya, Egypt

D. Shebl is with the Mathematics and Computer Science Department,
Faculty of Science, Menoufiya University (Post Number 32511,Shebin El-
komMenoufiya, Egypt.


K
2011 Journal of Computing Press, NY, USA, ISSN 2151-9617
http://sites.google.com/site/journalofcomputing/
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 78
2 THE PROPOSED MODEL ( AFHOPN)
In this section, we briefly review and present prelimi-
nary concepts of the proposed model( AFHOPN's).
Definition 1 (Fuzzy Higher-Order Petri Net) [6]. A Fuzzy
Higher-Order Petri Net can be defined as a 9-tuple:
FHOPN = ( P, T, D, I, O, cf, th, , ), where P ={ P
1
, P
2
,,
P
n
} is a finite set of places, 'P' = n > 0; T={t
1
, t
2
,, t
m
} is a
finite set of transitions, 'T' = m > 0 ; D={d
1
, d
2
,, d
n
} is a
finite set of propositions, 'D'= 'P', P T D= ; I:T
i
n
i
P
1 =

is the input function representing a mapping from

transitions to someor all elements in bags of their input
places, and
n i
n
i
P P P P =
=
...
2 1
1
; O:TP
is the output function representing a mapping from transi-
tions to bags of their output places; cf:T[0,1] is an associa-
tion function represents the certainty factor of the transitions;
th:T[0,1] is an association function represents the threshold
value of the transitions; :P [0,1] is an association function
represents the token truth value in place p
i
and denoted by
(p
i
) [0,1],
i
represents the fuzzy belief of place p
i
i.e.
i

= (p
i
); :PD is an association function represents a bijec-
tive mapping from places to proposition, If (p
i
) = y
i
, y
i

[0,1] and (p
i
) = d
i
, then the degree of truth of proposition di
is y
i
.
Definition 2. The hold set of the k
th
-order arc
) (
} ) ( {
j
k i r
I is
defined as the set of k places {P
r(1)
, P
r(2)
,, P
r(k)
} that are
connected on it. This set of places is denoted by
) (
} ) ( {
j
k i r
H ,
where,
) (
} ) ( {
j
k i r
H ={P
r(1)
, P
r(2)
,, P
r(k)
} P t I
j
) ( , I(t
j
) is the
set of all input places of transition tj.
Definition 3. An Adaptive Fuzzy Higher-Order Petri
Net can be defined as a 11 tuple : AFHOPN = ( P, T, D , I,
O, W
I
, W
O
, cf, th, , ) where P, T, D , I, O, cf, th, ,
are defined as in definition 1. Function W
I
:IN is an in-
put weight function, which assign to each k
th
-order arc,
k-dimensional vector whose components represent the
occurrence of places in this arc's hold set, where N
represents the set of vectors of real values (between zero
and one) (i.e N [0,1]), W
O
: O V is an output weight
function which assign to each output arc, where V [0,1].
We denote
) (
} ) ( {
j
k i r
I as the k
th
-order input arc of transi tion
t
j
from its hold set
) (
} ) ( {
j
k i r
H ={P
r(1)
, P
r(2)
,, P
r(k)
}, i.e.,
) (
} ) ( {
j
k i r
H
, where k = 1, 2, , n ; j = 1, 2, , m ; n ='P '; m =
'T', the corresponding weight vector of input arc
) (
} ) ( {
j
k i r
I is
) (
} ) ( {
j
k i r
W = [N
r(1)
, N
r(2)
, , N
r(k)
], where N
r(i)
is the occur-
rence of place Pr(i) in
) (
} ) ( {
j
k i r
H , and the output weight
function W
O
from the transition t
j
to the output place P
l
represented by V
l
(t
j
) or v
jl
. The transition with k input
arcs has k thresholds. The threshold that is assigned to
transition for each input arc represents a lower bound on
the degree of propositions that the hold set of the arc
should possess in order to fire the transition. Accordingly,
we use
k i r j
th
} ) ( {
to denote the threshold of transition
k i r j
t
} ) ( {
when it fired by the input arc
) (
} ) ( {
j
k i r
I .
3 FUZZY KNOWLEDGE REPRESENTATION ANDAFHOPN
One knowledge structure commonly used in the de-
sign of an expert system is a rule. A rule is a knowledge
structure that relates some known information to other
information that can be concluded or inferred to be
known. The rules structure logically connects one or
more antecedents contained in the IF part, to one or more
consequents contained in the THEN part. Fuzzy produc-
tion rule (FPR) is a rule that describes the fuzzy relation.
These can be identified to three different types [3]. Here,
we show that each type of FPR can be modeled by AF-
HOPN with the aggregation function . In order to give
the definition of enabled and firing of the transition, we
introduce the extended fuzzy load of the input arc.
Definition 4 (extended fuzzy load ). Let the transition t
k

has the n
th
-order input arc
) (
} ) ( {
k
n i r
I with hold set
) (
} ) ( {
k
n i r
H ={P
r(1)
, P
r(2)
,, P
r(n)
}the extended fuzzy load
) (
} ) ( {
k
n i r

is computed as the value of fuzzy belief of place

P
r(i)
in its hold set multiplied by its corresponding weight
vector(
) (
} ) ( {
k
n i r
W ) of
) (
} ) ( {
k
n i r
I , where
) (
} ) ( {
k
n i r
W = [N
r(1)
, N
r(2)
, , N
r(n)
], i.e
) (
} ) ( {
k
n i r

=[
r(1)
,
r(2)
, ,
r(n)
] [N
r(1)
, N
r(2)
, , N
r(n)
]
=[
r(1)
. N
r(1)
,
r(2)
. N
r(2)
,,
r(n)
. N
r(n)
] where,
r(i)
is the
fuzzy belief of place P
r(i)
, N
r(i)
is the occurrence of P
r(i)

(P
r(i)

) (
} ) ( {
k
n i r
H ) , and

is the array multiplication ele-

ment by element .
Definition 5 (Enabled). A transition t
k
is enabled if

) (
} ) ( {
k
n i r
I s.t min(
) (
) 1 (
k
r

,
) (
) 2 (
k
r

,,
) (
) (
k
n r

)
n
i r k
th
)} ( {
.
Definition 6 (Firing rule). An enabled transition
n
i r k
t
)} ( {
may or may not fire. If the transition
n
i r k
t
)} ( {

is fired, then tokens are removed from the hold set
) (
} ) ( {
k
n i r
H ={P
r(1)
, P
r(2)
,, P
r(n)
} and deposited to each of its
output places. The fuzzy belief of the output given by:
(P
j
)=v
j
(t
k
).cf
'
(t
k
) , where cf
'
(t
k
)= . cf (t
k
).
The value of the function is dependent on the three
types of FPR.
TYPE 1: A simple FPR
IF d
i
THEN d
j
; with cf =u
k
,
i k
th

=
k
,
) (k
i
W =N
i
, and
W
O
=v
j
(t
k
). The simple FPR can be modeled as shown in
Fig.1.(a). The transition t
k
has only one first-order input
arc, and its hold set
) (k
i
H ={p
i
}, if
) (k
i

k

, then the
transition
i k
t

fire as in Fig.1.(b) and the value of
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 79
=
i
.N
i
=
) (k
i

.









TYPE 2: A Composite Conjunctive Rule
IF d
r(1)
AND d
r(2)
AND AND d
r(n)
THEN d
j
; with cf =
u
k
,
n
i r k
th
)} ( {
=
k
,
) (
} ) ( {
k
n i r
W = [N
r(1)
, N
r(2)
, , N
r(n)
],, and
W
O
= v
j
(t
k
). The consequence d
j
can not result until the
propositions d
r(1)
, d
r(2)
,, and d
r(n)
are presented with
suitable truth values. If one proposition d
r(i)
does not exist
(true) in the left side of rule, then the consequence d
j
not
result at the right side of rule, where the transition in
AFHOPN fires only by one input arc. All propositions
d
r(1)
, d
r(2)
,, and d
r(n)
must be linked on one n
th
-order arc
as shown in Fig. 2.(a). In this case, the transition t
k
has
one n
th
-order arc
) (
} ) ( {
k
n i r
I , and its hold set
) (
} ) ( {
k
n i r
H ={P
r(1)
,
P
r(2)
,, P
r(n)
}. If min (
) (
) 1 (
k
r
,
) (
) 2 (
k
r
,,
) (
) (
k
n r
)

k
, then the
transition
n
i r k
t
)} ( {
can fire and tokens removed from the
hold set to the output place transition as shown in Fig.
2.(b). The value of given as follows:
= min (
r(1)
. N
r(1)
,
r(2)
. N
r(2)
,,
r(n)
. N
r(n)
)
= min(
) (
) 1 (
k
r

,
) (
) 2 (
k
r

,,
) (
) (
k
n r

).














TYPE 3: A Composite Disjunctive Rule
IF d
r(1)
OR d
r(2)
OR OR d
r(n)
THEN d
j
with cf = u
k
and
thresholds
) 1 ( r k
th

=
1
,
) 2 ( r k
th

=
2
, ,
) (n r k
th

=
n
,
W
I
=[N
r(1)
, N
r(2)
, , N
r(n)
] , and W
O
= v
j
(t
k
), where
) (i r k
th

, i =1, 2, , n is associated with transition t
k
for
the input arc
) (
) (
k
i r
I that has hold set
) (
) (
k
i r
H ={p
r(i)
}. For
this rule, there are two cases:
Case 1. When all premises d
r(i)
are a simple proposition
and the consequence d
j
may result by any one of premis-
es, if the proposition d
r(i)
is presented with suitable fuzzy
truth value
r(i)
, then the proposition d
j
can be concluded
and its fuzzy truth value
j
can be aggregated, where the
rule has n propositions in premises and each proposition
can produce the proposition d
j
in the consequences. In
Fig. 3.(a), we note that the transition has n first-order in-
put arcs, and if the transition fired by one arc only the
value of can be computed as in Type 1 of FPR. On the
other hand, if the transition fired by ( s

n) arcs, then we
can compute as:
= max (
) (
) 1 (
k
r

,
) (
) 2 (
k
r

,,
) (
) (
k
s r

), s =1, 2, , n.








Case 2. When one or more premises is composite conjunc-
tive premise, as shown as in Fig. 4. , if a transition fired by
one of its first-order arc only, the value can be com-
puted as in TYPE 1 of FPR. If the transition fired by one of
its q
th
-order arc only, then the value of can be computed
as in type 2 of FPR. But if the transition fired by s

n
arcs (first or q
th
-order), then the value of can be com-
puted as :
= max (
) (
) 1 (
k
r

, , min (
) (
) 1 (
k
i r

,
) (
) (
k
iq r

) , ,
) (
) (
k
n r

).










4 FUZZY REASONING ALGORITHM AND THE
UPDATING WEIGHTS ALGORITHM
Here, we develop the fuzzy reasoning algorithm for
computing fuzzy beliefs at places and introduce an algo-
rithm for updating the input and output weights.

Algorithm A: Fuzzy Reasoning Algorithm
Input: the truth values of a set of antecedent propositions.
Output: the truth values of a set of consequences proposi-
tions (goal places).
Step 1 Build the set of user input places P
I
.
Step 2 Build the set of initially enabled transitions T
initial
.
d
j

d
i
] [
i
N
v
j
(t
k
)

i

d
i
] [
i
N
v
j
(t
k
)

j
i

k
k
u

(a) Before firing of
i k
t

(b) After firing of
i k
t


Fig.1. AFHOPN represents TYPE 1 of FPR

k
k
u

p
r(n)

p
r(n)

n i r k k
th
} ) ( {
,

u
v
j
(t
k
)
d
r(1)

[N
r(1)

N
r(2)



N
r(n)
]

j

t
k
d
j

p
j

p
r(1)

r(1)

r(n)

r(2)

d
r(2)

d
r(n)

p
r(2)

v
j
(t
k
)

t
k
d
j

p
r(1)

r(1)

r(n)

r(2)

d
r(2)

d
r(n)

p
r(2)

[N
r(1)

N
r(2)



N
r(n)
]
d
r(1)

n i r k k
th
} ) ( {
,

u










(a) Before firing of
n
i r k
t
)} ( {
(b) After firing of
n
i r k
t
)} ( {

Fig. 2. AFHOPN represents TYPE 2 of FPR.

d
r(n)

r(1)

t
k
p
j

) (
,
i r k k
th

u
v
j
(t
k
)
t
k

r(1)

p
r(1)

d
r(2)

r(2)

p
r(2)

r(n)

d
r(n)

) (
,
i r k k
th

u
[N
r(1)


N
r(2)




N
r(n)
]
v
j
(t
k
)

j

[N
r(1)


N
r(2)




N
r(n)
]

r(n)

p
j












(a) Before firing of
) (i r k
t

(b) After firing of
) (i r k
t


Fig. 3. AFHOPN represents TYPE 3 of FPR.


t
k
d
j

p
j

j

p
r(1)

r(1)

r(n)

d
r(n)

p
r(n)

) (
,
i r k k
th

u
p
r(i1)

r(i1)

d
r(i1)

r(i2)

r(iq)

p
r(i2)

d
r(i2)

d
r(iq)

d
r(i)
[N
r(1)


N
{r(ij})q




N
r(n)
]










Fig. 4. FHOPN represents case 2 in TYPE 3 of FPR. Dashed
lines means it may be corresponds the premise d
r(i)
.



JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 80
do
{ Step 3 Find current enabled transitions T
current
(R)
according to definition 5.
Step 4 Calculate new truth values of a set
Consequences propositions produced by fired
transitions according to definition 6.
Step 5 Make token transmission. Assume P is one of
the output places of a fired t:
5.1 If a place has only one input transition; then add
a token to P with the truth value which is produced
by its input transition.
5.2 If a place has one input transition with n (n>1)
input arcs, and it fired by s (sn) of its input arcs,
then add to P with the maximum truth value pro
duced by the transition w.r.t. all s input arcs.
5.3 If a place has m(m>1) input transitions (of type
that illustrated in step 5.1 or 5.2) and k(km) of its
input transitions fired, then select the transition,
which will give the maximum output and add a
token to output place P with the truth value
produced by this transition.
Step 6 Let T = T T
current
.}
Step 7 while( T
current
= ).
After applying the fuzzy reasoning algorithm, the
truth values of a set of antecedence and consequence are
changed. So, the parameters (weights) must be adjusted
according to the new truth values of the input and the
output places. This lead us to introduce an algorithm for
updating the input and the output weights.
The Widrow-Holf Learning law (Least Mean Square)
can applied as

) (
} ) ( {
k
n i r
W (x+1) =
) (
} ) ( {
k
n i r
W (x)+(
) (
} ) ( {
k
n i r

-(P
j
))-(P
i
)
(1)
where
) (
} ) ( {
k
n i r

is denotes the extended fuzzy load of

transition t
k
,
) (
} ) ( {
k
n i r
W
(x) is corresponding the input
weight vector of input arc
) (
} ) ( {
k
n i r
I
in a step x, and
) (
} ) ( {
k
n i r
W (x+1) is the input weight vector of input arc
) (
} ) ( {
k
n i r
I in a step (x+1).
Algorithm B: Updating Input and Output Weights
Input: the truth values of a set of antecedent proposi-
tions and the truth values of a set of consequences propo-
sitions.
Output: input (
) (
} ) ( {
k
n i r
W )and output (W
O
)weights
Step 1 Build the set of user input places P
I
.
Step 2 Build the set of initially enabled transitions Tini-
tial .
do
{ Step 3 calculate the input weights as above (1).
Step 4 calculate the output weights
W
O
= (cf', (P
j
))
according to the types of firing rules. }
Step 5 while( T
current
= )

Example 1. We assume that the degree of truth input
(starting) propositions are given by the expert or they are
identified by sensors in finite time units. We want to de-
termine the degrees of truth of output (goal) proposition.
Consider the AFHOPN that is represented in Fig. 5, for
this description and the following rules given from an
expert.
R1: If P
1
and P
2
Then P
5
with cf =0.52, th
) 1 (
2 , 1
=0.1,
(P
1
)=0.8, (P
2
)=0.55.
R2: If P
1
and P
2
and P
3
and P
4
Then P
5
with
cf =0.52,
th
) 1 (
4 , 3 , 2 , 1
= 0.06, (P
3
)=0.354, (P
4
)=0.56 .
t
1
has two input arcs, one arc is
) 1 (
2 , 1
I which connect both
P
1
and P
2
proposition and the other is
) 1 (
4 , 3 , 2 , 1
I which con-
nect the propositions P
1
, P
2
, P
3
, and P
4
. (P
1
) =0.8, (P
2
)
=0.55, (P
3
) =0.35
4
, and (P
4
) =0.56, the corresponding
weight vector of input arc
I
) 1 (
2 , 1
is
) 1 (
2 , 1
W =[0.6, 0.4], where
the first value (0.6) of
) 1 (
2 , 1
W represents the occurrence of
P
1
(P
1

) 1 (
2 , 1
H ), the value 0.4 represents the occurrence of
P
2
(P
2

) 1 (
2 , 1
H ) , the corresponding weight vector of input
arc
) 1 (
4 , 3 , 2 , 1
I is
) 1 (
4 , 3 , 2 , 1
W =[0.35, 0.25, 0.2, 0.2], where the val-
ue (0.35) represents the occurrence of P
1
(P
1

) 1 (
4 , 3 , 2 , 1
H ),
the value 0.25 represents the occurrence of P
2
(P
2

) 1 (
4 , 3 , 2 , 1
H ) and so on . .
) 1 (
2 , 1
=[0.48 , 0.22]
) 1 (
4 , 3 , 2 , 1
=[0.28
, 0.1375, 0.0708, 0.112] , where min
) 1 (
2 , 1
>
) 1 (
2 , 1
th , then the
transition
2 , 1 1
t fired , and
1
can computed as follows:

1
= min (
) 1 (
2 , 1
) = min([0.48 , 0.22] ) = 0.22. at the same
time min(
) 1 (
4 , 3 , 2 , 1
)>
) 1 (
4 , 3 , 2 , 1
th , also the transition
4 , 3 , 2 , 1 1
t
fired, and
2
can computed as follows:



0.8
0.55
0.354
0.56
0.8
0.52





t
1
P1 P2 P3 P4
[0.35 0.25 0.2 0.2 ]
[0.6 0.4 ]
P
5



















Fig. 5. An AFHOPN
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 81

2 = min [
) 1 (
4 , 3 , 2 , 1
] = min [0.28 , 0.1375, 0.0708, 0.112] ) =
0.0708 , where t
1
has two input arc
) 1 (
2 , 1
I and
) 1 (
4 , 3 , 2 , 1
I we
apply case 2 in type 3 of FPR to calculate (P
5
).
=max (
1
,
2
)= max(0.22, 0.0708) = 0.22, after that we can
calculate cf' = . cf , where, cf = 0.52 , cf'= (0.22) . (0.52) =
0.1144, where v
15
=0.8, represents the weight of the output
arc from t
1
to output place P
5
. (P
5
) = v
15
. cf'
= (0.8). (0.1144) = 0.09152 .
5 ALGEBRAIC EQUATIONS OF AFHOPN
In this section we recall and present some basic notions
(especially concerning the matrix algebra), for details
concerning classical linear algebra we refer to [15].
Let A = [a
ij
] be a matrix of the size mn.
Lukasiewicz S-norm for the n-dimensional space
is a function defined as follows:
S:[0,1]
n
[0,1], where S(a
1
, a
2
,, a
n
)
= min(a
1
+ a
2
++a
n
, 1) for a
i
[0,1], i =1, , n.
Let B = [b
jk
] be a matrix of the size np. Then
A B (Normalized multiplication with S-norm)
is the mp matrix C = [c
ik
] whose (i, k)-
th
element
is defined by the formula:
c
ik
= S(a
i1
b
1k
, , a
in
b
nk
).
Let a
1
, , a
n
[0,1]. Then the non-zero minimum
is a function defined as follows:

nzmin(a
1
, ,a
n
) =

where x is a ceiling function.

5.1 Algebraic Equations
We propose an algebraic equation of AFHOPN, it
enables us to represent a net in the form a tuple of ade-
quate matrices. Let AFHOPN=( P, T, D , I, O, W
I
, W
O
, cf,
th, , ), and we can redefine the above definition of AF-
HOPN as 8-tuble: (W
I
, W
O
, D, cf, th, , OP
in
, OP
out
). The
algebraic equations for AFHOPN that has m places and n
transitions, we find that: at descriptive view, there are
two vectors W
I
and W
O
to describe the corresponding
weight vector (
) (
} ) ( {
k
n i r
W ) of input arc
) (
} ) ( {
k
n i r
I and output
weight from transition tR
k
R to place PR
j
R, respectively where

) (
} ) ( {
k
n i r
W = [NR
r(1)
R, NR
r(2)
R, , NR
r(n)
R],
NR
r(i)
R is the occurrence of place PR
r(i)
R, OPR
I
R :is a row vector
containing input operators:
OPR
I
R = [ OPR
I
R(tR
1
R), OPR
I
R(tR
2
R), , OPR
I
R(tR
n
R)]
OPR
O
R : is a row vector containing output operators:
OPR
O
R = [ OPR
O
R(tR
1
R), OPR
O
R(tR
2
R), , OPR
O
R(tR
n
R) ].
OPR
I
R and OPR
O
R defined according to the three types of FPR.
(PR
i
R) is a column vector containing initial fuzzy truth
values of places . cf is a row vector containing certainty
factor values:
cf= [cf (tR
1
R), cf (tR
2
R), , cf (tR
n
R)
th is row vector containing threshold values,
th= [th (tR
1
R), th(tR
2
R), , th(tR
n
R) ]
R is a row vector which represent the
transition state. Let R=[rR
j
R] be a binary row vector of size m
representing the firing sequence

R=[rR
j
R]=


Theorem 1. The new truth value of output places is
given by:
(PR
i+1
R) = (PR
i
R) ((PR
i
R)

( WR
I
R RP
T
P))+ ( WR
O
RP
T
P

( RP
T
P

(
OPR
I
R

( WR
I
R

(PR
i
R) )P
T
P)

cfP
T
P).

Proof. By definition 4,
) (
} ) ( {
k
n i r

=[R
r(1),
R R
r(2)
R, ,R
r(n)
R ]

) (
} ) ( {
k
n i r
W
= [R
r(1)
R, R
r(2)
R, ,R
r(n)
R ]

[NR
r(1)
R, NR
r(2)
R , , NR
r(n)
R]
= [R
r(1)
R. NR
r(1)
R , R
r(2)
R. NR
r(2)
R ,, R
r(n)
R. NR
r(n)
R ]
by definition 5, the transition tk is enabled if min
(r(1). Nr(1), r(2). Nr(2) ,,r(n). Nr(n))
n
i r k
th
)} ( {
.
Consequently, (PR
i
R)

WR
I
R th. Let the transition
n
i r k
t
)} ( {

is fired ((PR
i
R)

( WR
I
R RP
T
P)), according to definition 6, the
tokens are removed from the hold set
) (
} ) ( {
k
n i r
H ={PR
r(1)
R, PR
r(2)
R,, PR
r(n)
R}
and deposited to its output places. Thus, The fuzzy belief
of the output place
) ( ) ( ) (
'
k k j j
t cf t v P =
where,
) ( ) (
'
k k
t cf t cf =

Consequently, The fuzzy belief of the output place de-
termine by ( WR
O
RP
T
P

( RP
T
P

( OPR
I
R

( WR
I
R

(PR
i
R))P
T
P)

cfP
T
P),
where the symbol

denotes a joint operation of the ith-

input operator of a vector OPR
I
R with the ith- row of vector
obtained from an expression (WR
I
R

(PR
i
R))P
T
P. Finally, the
new truth value of output places considered the summa-
tion of the above parts and defined as:
(PR
i+1
R) = (PR
i
R) ((PR
i
R)

( WR
I
R RP
T
P))+( WR
O
RP
T
P

( RP
T
P

(
OPR
I
R

( WR
I
R

(PR
i
R))P
T
P)

cfP
T
P) where,
(PR
i+1
R) denote the vector of firing sequence in step (k+1).

Example 2. Consider the AFHOPN that is represented in
Fig. 5. The possible sequence of transition firing
=
2 , 1 1
t
4 , 3 , 2 , 1 1
t . It is note that the occurrence of transi-
tion tR
1
R in the sequence is two, but it fires each time by
different arc. In the first time it fire by the
) 1 (
2 , 1
I (i.e. place
PR
1
R and PR
2
R are affected only by firing tR
1
R). In the second
time it fires by the arc
) 1 (
4 , 3 , 2 , 1
I (i.e. place PR
1
R, PR
2
R, PR
3
R, and PR
4
R
are affected by firing tR
1
R ), then the sequence is decom-
posed into 2 subsequences as follows:
1

=
2 , 1 1
t ,
0 for a
1
== a
n
= 0
min(1+a
1
- a
1
,,1+a
n
- a
n
) Otherwise

1 If a transition tk firing sequence

0 Otherwise

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 82
2

=
4 , 3 , 2 , 1 1
t .


2 , 1 1
W =

0
0
0
4 . 0
6 . 0
,
4 , 3 , 2 , 1 1
W

0
2 . 0
2 . 0
25 . 0
35 . 0
,
W
O
=

8 . 0
0
0
0
0
, (P
i
)=

0
56 . 0
354 . 0
55 . 0
8 . 0

cf =[0.52 ] , OPR
I
R=[nzmin] , and R =[1 ]
at
1

=
2 , 1 1
t fires: The First part of the equation
= (PR
i
R) ((PR
i
R)R
k
R ( WR
I
R RP
T
P))
= (

0
56 . 0
354 . 0
55 . 0
8 . 0
-

0
56 . 0
354 . 0
55 . 0
8 . 0

0
0
0
4 . 0
6 . 0
[1])
= (

0
56 . 0
354 . 0
55 . 0
8 . 0
-

0
56 . 0
354 . 0
55 . 0
8 . 0

0
0
0
4 . 0
6 . 0
)
= (

0
56 . 0
354 . 0
55 . 0
8 . 0
-

0
0
0
22 . 0
48 . 0
=

0
56 . 0
354 . 0
33 . 0
32 . 0
)
The second part :
( WR
O
RP
T
P ( RP
T
P ( OPR
I
R ( WR
I
R (PR
i
R))P
T
P) CfP
T
P))P
T

=([0 0 0 0 0.8] [1] (nzmin)

0
0
0
4 . 0
6 . 0

0
56 . 0
354 . 0
55 . 0
8 . 0
[0.52] )
(WR
O
RP
T
P ( RP
T
P (OPR
I
R ( WR
I
R (PR
i
R))P
T
P) CfP
T
P))P
T
P =

09152 . 0
0
0
0
0

(PR
i
R)
1
=

09152 . 0
56 . 0
354 . 0
33 . 0
32 . 0

At
2
=
4 , 3 , 2 , 1 1
t fires : The First part of the equation =
(PR
i
R) ((PR
i
R)R
k
R ( WR
I
R RP
T
P))
=(

0
56 . 0
354 . 0
55 . 0
8 . 0
-

0
56 . 0
354 . 0
55 . 0
8 . 0

0
2 . 0
2 . 0
25 . 0
35 . 0
[1 ] ) =

0
448 . 0
183 . 0
4125 . 0
52 . 0

The second part: ( WR
O
RP
T
P ( RP
T
P ( OPR
I
R ( WR
I
R TrR
k
R)P
T
P)
CfP
T
P))P
T

([0 0 0 0 0.8] [1] (nzmin)

0
2 . 0
2 . 0
25 . 0
35 . 0

0
56 . 0
354 . 0
55 . 0
8 . 0

[0.52])=

0465 . 0
0
0
0
0
(PR
i
R)
2
=

0465 . 0
448 . 0
183 . 0
4125 . 0
52 . 0

Then (PR
i+1
R) = OPR
O
R (
1
,
2
)
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 83
= max (

09152 . 0
56 . 0
354 . 0
33 . 0
32 . 0
,

0465 . 0
448 . 0
183 . 0
4125 . 0
52 . 0
) =

09152 . 0
56 . 0
354 . 0
4125 . 0
52 . 0

(P
i+1
) =

09152 . 0
56 . 0
354 . 0
4125 . 0
52 . 0


5.2 Stability Analysis
Theorem 2. For each place P
i
, (P
i
) fires by t
k
in
(P
i+1
) = (P
i
) ((P
i
)

( W
I
R
T
))+ ( W
O
T

( R
T

(
OP
I

( W
I

(P
i
) )
T
)

cf
T
) always converges [0,1].
Proof. Since (P
i
) for all i, W
I
, W
O
are bounded in [0,1],
by theorem 1, the expression ( W
O
T

( R
T

( OP
I

( W
I


(P
i
))
T
) cf
T
) involve OP
I
which contain the operator
OR(max) or AND (min) and the operator

. Namely, the
operator

indicates vectors multiplication element by

element. Consequently, the result of this part of equation
is a vector contain the value of the fuzzy belief of the out-
put place bounded in [0,1] and due to the output weight
vector, the all remaining values equal to zero. The result
of the expression ((P
i
) ( W
I
R
T
)) is a vector contain n
values, the fuzzy belief of the output place is equal to ze-
ro, since the corresponding value in he input weight vec-
tor is equal to zero and the remaining values bounded in
[0,1]. Furthermore, (P
i+1
) (P
i
). Thus, (P
i+1
) can never
increase with respect to (P
i
). Consequently, (P
i+1
) being
bounded in [0,1] after some finite number of iterations.
6 CONCLUSION
This paper proposed a formal description of an adap-
tive fuzzy higher order Petri net (AFHOPN) that takes
into account the changes of the dynamic systems and
also has the learning ability similar to neural networks.
We developed fuzzy reasoning algorithm and an algo-
rithm for updating the weights and give the algebraic
forms of the state equation of the proposed model.
REFERENCES
[1] S. I. Ahson, " Petri net models of fuzzy neural networks," IEEE
Trans. Syst., Man Cybern. 25, pp.926-932, 1995.
[2] A, Buck, M. Hanna, and R. Smith, "Fuzzy Petri Nets to control
vision system and robot behavior under uncertain situations with-
in a FMS cell," Proc. Of the 3
rd
IEEE Conference on Fuzzy Systems;
IEEE World Congress on Computational intelligence, pp.1889- 1894,
1994.
[3] S. Chen, J. Ke, and J. Chang, " Knowledge representation using
fuzzy Petri nets," IEEE Trans. Knowl. Data Eng. Vol.2, no.3, pp.311-
319, 1990.
[4]
T. W. S. Chow and J.Y.Li, " Higher-order Petri net models based on
artificial neural networks ," Artificial Intelligence, vol .29, no.1,
pp.289-300, 1997.
[5] J. Durkin, "Eepert Systems, Design and Development," Prentic Hall,
New York, 1994.

[6] M. W. Hassan, "Fuzzy Higher-order Petri Nets and Its Applications to
Manage Uncertainty in Expert Systems," Ph.D. Thesis, Dept. of Ma-
thematics and computer science, Faculty of Science, Menoufia
university , Egypt, 2007.
[7]
M. Ha, Y. Li, and X. Wang, "Fuzzy Knowledge representation and
reasoning using a generalized fuzzy Petri nets a similarity meas-
ure,". Soft Comp. 11: 323-327, 2007.
[8] K. Hirota and W. Pedrycz, "OR/AND neuron in modeling fuzzy
set connectives," IEEE Trans. Fuzzy Syst., vol. 2, no.2, pp. 151-161,
1994.
[9] Z. Kasirolvalad, M. R. Jahed Motlagh, and M. A. Shadman, " An
intelligent modeling system to improve the machining process
quality in CNC machine tools using adaptive fuzzy Petri nets," Int
J Adv Manuf Technol, vol.29, pp.1050-1061, 2006.
[10] X. Li, W. Y, and F. Lara-Rosano," Dynamic knowledge inference
and learning under adaptive fuzzy Petri net framework," IEEE
Trans. Syst., Man Cybern-Part C: Appl Rev, vol.30, no.4, pp. 442-450,
2000.
[11] Z. W. Li, M.C.Zhou, and N.Q.Wu, " A survey and comparison of
Petri net-based deadlock preventation policies for flexible manu-
facturing systems", IEEE Trans. Syst. , Man, Cybern.C, Appl. Rev.,
pp.137-188, Mar, 2008.
[12] C. G. Looney, "Fuzzy Petri nets and applications,": fuzzy reasoning
information, decision and control systems, Kluwer Acadimic,
pp.511-527. 1994.
[13]
T. Murata, " Petri Nets: Properties, Analysis and Applications,"
Proc. IEEE, vol. 77, pp.541-580, April. 1989.
[14]
W. Pedrycz an F. Gomide, " A generalized fuzzy Petri net model,"
IEEE Trans. Fuzzy Syst., vol.2, pp.295 - 301, Nov. 1994.
[15] J. L. Peterson," Petri Net Theory and Modeling of Systems," Engle-
wood Cliffs, NJ: Prentice-Hall, 1981.
[16] Z. Suraj, B. Fryc, Z. Mantusiewicz and K. Pancerz, " A Petri net
system an overview ," Fundamenta Informatica, vol. 71, pp. 101-
120, 2006.
[17] R. Tang, G. K. Pang, and S. S. Woo, " A continuous fuzzy Petri net
tool for intelligent process monitoring and control, ". IEEE Transac-
tion on control system technology, 3, pp. 318-329, 1995.
[18] D. S. Yeung, E. C. C. Tsang," Fuzzy knowledge representation and
reasoning using Petri nets," Expert System Application, vol.7, pp.
281-290, 1994.


Mohammed Amin was graduated in mathematics in 1983 at Menou-
fiya University. He studied computer science from 1986 to 1989 at
Ain Shams University in Cairo and received the M.Sc. degree in 1990
and the Ph.D degree in computer science in 1997 at the University of
Gdansk, Poland. He is associate professor of computer science at the
faculty of science, Menoufiya University, and research visitor to the
faculty of Philosophy and sciences of the Silesian University, Opava,
Czech Republic. His research area in formal languages and their
application in compiler design. Cooperating/distributed systems,
web information retrieval, Petri nets and its applications, and finite
automata and cryptograph.

Doaa A. Shebl received B.Sc. Degree in Mathematics and Computer
science from, Faculty of Science, Menoufiya University, Egypt, in
2001 and M.Sc. in computer science from, Faculty of Science, Meno-
fiya University, Egypt, in 2006. She was E-content Developer in Ben-
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 84
ha E-learning Center, Benha Univerisity, Egypt from 2007 to 2009.
Now, she is studying Ph.D. in Faculty of Science, Menofya Universi-
ty, Egypt in the field of Petri nets and its applications.

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 7, JULY 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 85