(IJCNS) International Journal of Computer and Network Security, 19
Vol. 2, No. 5, May 2010
Travelling Salesman’s Problem: A Petri net
Approach
Sunita Kumawat 1 , G.N.Purohit 2
1, 2
Department of Mathematics and statistics, Centre of Mathematical Sciences (CMS),
Banasthali University,Banasthali (Rajasthan)-304022, India.
email: 1 sunita_1586@yahoo.co.in, 2gn_purohitjaipur@yahoo.co.in
Abstract: In this paper, we consider the Travelling salesman’s
problem (TSP). Where TSP is modelled as a TSP-graph, in
which each edge is treated as a parallel combination of
oppositely directed edges. We model TSP-graph as a Petri Net-
graph, where Petri Net- graph is an underlying graph of TSP-
graph. Then solve TSP by defining suitable binary operation on
elements of columns in sign incidence matrix representation of
Petri Net-graph. In Petri Net-graph, we find a set of places
which is both Siphon and Trap with minimum sum of
capacities, whose set of input transitions equals to the set of
output transitions, and both of them are equal to the set of all
transitions in Petri Net. Then edges in TSP-graph corresponding
to these places in Petri Net-graph will form a shortest route for
the salesman to return the point of origin, after traversing all
the cities exactly ones. For the solution of TSP, we describe a
new algorithm, based on siphon-trap and bounded-ness property
of the Petri Nets.
2000 Mathematics Subject Classification: 68R10, 90C35,
94C15.
Keywords: Travelling Salesman’s Problem, Weighted Directed
Graph, Spanning Cycle, Petri Net, Siphon and Trap.
1. Introduction
The Travelling Salesman’s Problem (TSP) is one of the
most intensely studied problems in computational
mathematics [5]. Mathematical problems related to the
TSP were treated in the early nineteenth century by W.R
Hamilton and British mathematician T. P. Kirkman.
Although there are many algorithms given for the
solution of TSP [6, 7, 8, 13, 14], yet no effective solution is
known for the general case for the TSP. In this paper, we
address the same problem with a different approach, using
Petri Net model. Here we present a new algorithm to
solving a TSP using the siphon-trap and bounded-ness
property of the places in the One-one Petri Net model of
given TSP-graph. For the TSP we find a set of places in
Petri Net, which is both Siphon and Trap [1, 3], with
minimum sum of capacities, having the property that set
of input transitions equals to the set of output transitions,
and both of them are equal to the set of all transitions
given in the Net. Then edges in TSP-graph corresponding
to these places form a shortest route for the salesman.
In Petri Net theory, Petri Net is a formal tool which is
particularly well suited for discrete event systems. Its
application has emerged from the initial seminal PhD
thesis of C. A. Petri, so C.A. Petri is considered as the
originator of Petri Net applications [10, 11]. The
computational algorithmic aspects of graph theory are
emphasized in the study of the Petri Nets. The most
interesting connections between graph theory and Petri
Nets have been brought out by T. Murata [9].
This paper is organized as follows: Section 2 provides
the necessary preliminaries, Section 3 formulates the
problem, Section 4 describes the algorithm for TSP with
illustrative example and Section 5 briefly concludes this
paper.
2 . An Overview Of Petri Net Approach
This section of the paper provides the necessary
preliminaries for the readers who are not familiar with
Petri nets.
As Petri Nets are also called place-transition net (PT-
Net), it is a particular kind of directed graphs together
with an initial state called the initial marking. In general
a Petri Net is an underlying graph of any directed graph,
which is in essence a directed bipartite graph with two
types of nodes called places and transitions. The arcs are
either from places to transitions (output of places) or from
transitions to places (input of places). In the Petri Net
graph a place is denoted by a circle, a transition by a box
or a bar and an arc by a directed line. A Petri Net is a PT-
Net with tokens assigned to its places denoted by black
dots, and the token distribution over its places is done
initially by a marking function denoted by M0. A token is
interpreted as a command given to a condition (place) for
the firing of an event (transition). An event can happen,
when its all input conditions are fulfilled, See Fig.1.
Figure 1.
There are many subclasses of Petri Nets such as One-one
Petri Nets, free choice Petri Nets, colored and stochastic
Petri Nets etc. Here we introduce only One-one Petri Net, as
it is an ordinary Petri Net such that each place P has exactly
one input transition and one output transition having weight
one on each edge, but we ignore these weights generally in
the model representation of the Net PN. One-one Petri Net
is also called as Marked Graph [4]. In our paper standard
notation PN is treated as One-one Petri Net. More detailed
and formal description of Petri Nets is given in [2, 9, 10,
20 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010

15]. We include here some basic definitions, which are goes through every city exactly once is a feasible tour
relevant to this paper. with a given cost, if it is smaller than the other minimum
Definition 2.1: A place-transition net (PT-Net) is a cost tour.
quadruplet PN = 〈P, T, F, W〉, where P is the set of places, T 3.1 Modelling TSP as a Graph (TSP-graph):
is the set of transitions, such that P ∪ T≠∅ and P ∩ T=∅, A pair G = {V, E}, where V= {v1,v2,v3,…,vn} is the set of
F⊆ (P x T) ∪ (T x P) is the set of arcs and W: F à{1, 2 ...}
vertices and E = {e1,e2,…,em} is the set of edges such that
is the weight function. PN is said to be an ordinary PT-Net
each edge ei having some weights wi∈W, where W:Eà R+
if and only if W: Fà {1}.
A marking is a function M0: Pà {0, 1, 2 ...}, which is the weight function and wi =w(ei) is the weight
distributes the tokens to the places initially. Here M0 (p) is associated with edge ei . Further when the edges vi vj and
the number of tokens in the place p at initial marking M0, it vj vi are considered different then G={V,E} is called a
is a non- negative integer less then or equal to the capacity weighted directed graph. In weighted directed graph, a
of the place. Capacity of the place is defined as the directed cycle is a closed sequence of directed edges
capability of holding the maximum no. of tokens at any without repetition of vertices except terminals and it said
reachable marking M from M0. A marking M is said to to be Spanning if it contains all the vertices of the graph.
reachable to M0 if there exist a firing sequence σ = {t1, t2… If any edge from the sequence is deleted then cycle
tn} such that M can be obtained from M0 as firing of
becomes open. Thus solving a TSP amounts to finding a
transitions t1, t2,…, tn. A Petri Net structure PN = 〈P, T, F,
minimum weight spanning cycle.
W〉 without any specific initial marking is denoted by PN
As an illustration we consider a weighted graph on
and Petri Net with the given initial marking is denoted by 〈
four vertices denoting the four cities A, B, C, D, where
PN, M0〉. *x and x* are the set of input transitions (or
places) and the set of output transitions (or places) each city has a direct link with the other three. The
respectively, as x∈ P (or T). Here | *x | and | x* | stands for numbers (weights) associated with the edges denotes the
number of the input transitions (or places) and the output physical distance between the cities, See Fig. 2. We
transitions (or places) respectively. Thus a One-one Petri construct a directed weighted graph (TSP-graph) of the
Net is an ordinary PT-Net such that ∀ p ∈ P: |*p|=|p*| =1, same graph in Fig. 3.
i.e., the number of the input transitions for p ∈ P equals to A
the number of the output transitions and both of them are
298 128
equal to one.
For a PT-Net, a path is a sequence of nodes ρ = 〈 x1, x2… 163
xn 〉 where (xi, xi+1) ∈F for i = 1, 2… n-1. ρ is said to be D 206
elementary if and only if it does not contain the same node B
137
more than once and a cycle is a sequence of places 〈 p1 , p2 , 98
…pn 〉 such that there exist t1, t2,…, tn ∈ T : 〈 p1, t1, p2,
t2,…., pn , tn 〉 forms an elementary path and (tn, p1) ∈F. C
Definition 2.2: For a PT-Net 〈PN, M0〉, a place p is said to Figure 2. Network of cities
be k-bounded (or bounded by k) where k∈ R+, if and only if
M0 (p) < k., denotes the capacity of the place in the Net. V1
e1 e2 e8
(PN, M0〉 is said to be k-bounded if and only if every place is
k-bounded. e11 e9 e7
Definition 2.3: A non-empty subset of places S is called a V4 e12 e10
Siphon if *p⊆ p* ∀ p∈S denoted also *S⊆ S*; i.e., every e3 e4 V2
transition having an output place in S has an input place in e6
S. Likewise a non-empty subset of places Q is called a Trap
if p*⊆ *p ∀ p∈Q denoted also Q* ⊆ *Q; i.e., every V3 e5
transition having an input place in Q has an output place in
Q. Figure 3. TSP- Graph

3. Problem Formulation: Travelling Salesman’s

Distance between two cities in Fig.3 can be represented in
Problem (TSP) terms of adjacency matrix as depicted below:

For a given network of cities and the cost of travel V1 V2 V3 V4

between each pair of them, the Travelling Salesman’s
Problem or TSP for short, is to find the shortest route for V1 --- 128 163 298
the salesman, visiting to all of the cities exactly ones and V2 128 --- 98 206
returning to the starting point. In the standard version of V3 163 98 --- 137
TSP, the travel costs or distances are symmetric in the V4 298 206 137 ---
sense that travelling from city X to city Y costs just as
much as travelling from Y to X. Any round-trip tour that
 (IJCNS) International Journal of Computer and Network Security, 21
Vol. 2, No. 5, May 2010

3.2 Modelling TSP-graph as a Petri Net
A Petri Net PN is modelled from TSP-graph given in Fig.
3 as follows: edges es are transformed into places ps and
vertices vk are transformed into transitions tk so that the
place ps has an input from a transition ti, and an output to
a transition tj, if es is an directed edge vi vj in graph, then
weights (distance between two cities) of es’s are replaced
by capacities ks of corresponding places ps and number of
tokens for places ps‘s is the value of k s  .
Fig. 4 in Appendix (1), shows the One-one Petri Net
model say PN, of the TSP-graph, having the set of
transitions T= {t1 t2, t3, t4} and the set of places is P = {p1,
p2,…,p12 } corresponding to the set of vertices{v1,v2,v3,v4}
and the set of edges {e1,e2,…,e12} respectively in the
given TSP-graph. For the sake of clarity, we observe that
t1 is the input transitions for the places p2, p7, p10 and the
output transition for the places p1, p8, and p9. Similarly p1 is
the input place for the transition t1 and output place for
the transition t4. Using this same procedure, we find a set
of the places in Net which is both siphon and trap with
minimum sum of capacities, whose set of the input
transitions equals to the set of output transitions and both
of them are equal to the set of all transitions in the Net
PN.
4. Description of algorithm for Travelling
Salesman’s Problem
As in above we model the TSP-graph as a Petri Net-
graph. Now here we present an algorithm for solving the
Travelling Salesman’s Problem. For the description of the
algorithm for TSP; we introduce some new notations as
follows:
In a Petri Net PN with n-transitions and m-places, the
sign incidence matrix I = [aij] is the
n x m matrix, whose entries are defined as,
aij = + if place j is an output place of transition i.
aij = - if place j is an input place of transition i.
aij = ± if place j is both input and output places of
transition i, (i.e., transition i and place j form a self loop)
aij = 0 otherwise.
For the Travelling salesman’s problem, we choose a
subset of k places X = {p1, p2…pk} in sign incidence matrix
I of PN, which is both siphon and trap and also *X= X* =
T, i.e., set of the input transitions of X is equals to the set
of output transitions of X, and both of them equal to the
set of all transition in T. This equality holds only if the
addition under the operation ⊕, of the k column vectors
say C1, C2, C3,…, Ck i.e., C1 ⊕ C2⊕ C3⊕…..⊕ Ck contains
only ± entries everywhere, where Cj , j = 1, 2... k, denotes
the column vector corresponding to the place pj in I.
Now let C1 ⊕ C2⊕ C3⊕…..⊕ Ck will be a column vector
denoted by γ = [γi] where γi denotes the
i
th
element of the column vector γ, have as elements from
set U. Then from the definition of I under the operation⊕,
we interprets about γi as. γi = 0 means no place in X is
an input or output place of transition i.
γi = - means some place in X is an input place of
transition i.γi = + means some place in X is an output place
of transition i.
γi = ± means some place in X is an input place as well as
output place for transition i.
From the above it can be seen that every transition
having an output place in X has an input place in X only
if γi ≠ +, and likewise every transition having an input
place in X has an output place in X only if γi ≠-. So X is
both siphon and trap if and only if γ has either 0 or ±
entries. And if γ has only ± entries everywhere, then the
places corresponding to columns C1, C2, C3,…, Ck in C1 ⊕
C2⊕ C3⊕…..⊕ Ck forms a set of places, which is both
siphon and trap, whose input transitions equals to the
output transitions and both of them are equal to the set of
all transitions T, with having some capacities. We select
only those set of places X such that *X = X* = T, having
minimum sum of capacities among all. Algorithm
discussed below, gives us a siphon–trap set of places X
with minimum sum of capacities, having the property *X
= X* = T, whose corresponding edges in TSP-graph will
form a shortest route for the salesman.
ALGORITHM:
Input Sign incidence matrix I of order n x m.

As an illustration, the Sign incidence matrix I of PN is: Step 1 Select Cj, the first column in the sign incidence
p1 p2 p3 p4 p5 p6 p7 p8 p9 p10 p11 p12 matrix I having ‘+’ entry whose corresponding place and
capacity is denoted as PLACEj and CAPACITYj
t1 - + 0 0 0 0 + - - + 0 0 Set recursion level r to 1
Set Vjr = Cj
t2 0 0 0 0 + - - + 0 0 + -
Set PLACEjr = PLACEj;
t3 0 0 + - - + 0 0 + - 0 0
Set CAPACITYjr =CAPACITYj;
t4 + - - + 0 0 0 0 0 0 - + Set X =∅, W=∅, Sum =0 and K =∅.
Hare we introduce a commutative binary operation, Step 2 If Vjr has a ‘±’ entry at the ith row then PLACEjr is a
denoted by ⊕ on the set U= (0, +, - ,±). self loop with transition i, Go to Step 5.
⊕ defined as following: + ⊕ - = ± (i.e., ‘+’ entry is said
Step 3 If Vjr has a ‘+’ entry in the kth row find a column Cs
to be neutralized by adding a ‘–‘entry to get a ‘±’ entry).
which contains a ‘–‘entry at kth row.
a⊕a=a ∀ a∈U
±⊕a=± ∀ a∈ (i) If no such column Cs exists then go to Step 5.
0⊕ a=a ∀ a∈U
22 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010

(ii) If such Cs exists, add it to Vjr to obtain Vj(r+1) = Vjr ⊕ Cs, −  0  − 

containing a ‘±’ entry at kth row. Then 0  +  + 
V12(3) = V11 ⊕ C11 =   ⊕   =  ;
PLACEj(r+1) = PLACEjr ∪ PLACEs 0  0  0 
     
+
  −  ± 
CAPACITYj(r+1) = CAPACITYjr ∪ CAPACITYs
     
(iii) Repeat this step for all neutralizing columns Cs. This
gives a new set of Vj(r+1)’s, PLACEj(r+1)‘s and ( 3)
PLACE 12 = {pl, p11}; CAPACITY 12 = {137,298}
( 3)

CAPACITYj(r+1)
V12( 2) has ‘+’ entry at 3rd row. The neutralizing columns
Step 4 Increase r by 1, Repeat Step 3 until there are no ‘+’entries
are C4, C5 and C10.
in each Vjr = C1 ⊕ C2⊕ C3⊕…..⊕ Cjr.
−  0  − 
Step 5 Any Vjr with all entries as ‘±’ represents both siphon 0  0  0 
⊕ C4 = ⊕
(1) ( 2)
V 13 =V 12     =  ;
and trap such that their input transitions equal to the output +  −  ± 
transitions and both of them equal to the set of all      
transitions T. ±  +  ± 
     
X = X ∪ PLACEjr
K= K ∪ CAPACITYjr PLACE 13
(1)
= {pl,p3, p4};
(1)
CAPACITY 13 =
W=Sum + Sumw K, where Sumw K is the sum of the {137,206,206}
capacities in the set K, Store it any other set and compare it
to minimum weight set at each iteration. −  0  − 
0  +  + 
Step 6 Delete Cj V13( 2) = V12( 2) ⊕ C5 =   ⊕   =  ;
+  −  ± 
     
j = j + 1 Go to Step 1. ±  0  ± 
Output: Set X has places both siphon and trap such that      
their input transitions equal to the output transitions and ( 2) ( 2)
PLACE 13 ={pl, p3, p5}; CAPACITY 13 = {137,
both of them equal to the set of all transitions T with
206,128}
minimum sum of capacities. Whose corresponding edges
set in TSP-graph, forms a shortest route for the salesman. −  +  ± 
0  0  0 
⊕ C10 = ⊕
(3) ( 2)
As an illustration consider the graph in Fig 2. V 13 =V 12     =  ;
+  −  ± 
Step 1 Select first column having ‘+’ entry. Here is C1,      
then ±  0  ± 
     
− 
  ( 3) ( 3)
V11 =  0  ; PLACE11 = {pl}; PLACE 13 = {pl, p3, p10}; CAPACITY 13 = {137, 206, 98}
0 
  V12(3) has ‘+’ entry at 2nd row. The neutralizing column is
+ 
  C6, C7 and C12.
CAPACITY11 = {137} −  0  − 
+  −  ± 
⊕ C6 = ⊕
( 4) ( 3)
Steps 2, 3 and 4, V11 has a ‘+’ entry at 4th row. The V 13 =V 12     =  ;
neutralizing columns are C2, C3 and C11. 0  +  + 
     
−  +  ±  ±  0  ± 
0  0         
= V11 ⊕ C2 = ⊕
(1)
V 12     = 0  ;
0  0  0  ( 4)
PLACE 13 = {pl, p11, p6}; CAPACITY 13 = {137,298,128}
( 4)
     
+  −  ± 
      −  +  ± 
+  −  ± 
⊕ C7 = ⊕
(5) ( 3)
(1) (1) V 13 =V 12     =  ;
PLACE 12 = {pl , p2}; CAPACITY 12 ={137,137 } 0  0  0 
     
−  0  −  ±  0  ± 
0           
= V11 ⊕ C3 =   ⊕  0  =  0  ;
( 2)
V 12
0  +  +  ( 5) ( 5)
      PLACE 13 = {pl , p11, p7}; CAPACITY 13 = {137,298,163}
+
  −  ± 
      −  0  − 
+  −  ± 
⊕ C12 = ⊕
( 6) ( 3)
( 2) ( 2) V 13 =V
12     =  ;
PLACE 12 = {pl, p3}; CAPACITY 12 = {137,206} 0  0  0 
     
±  +  ± 
     
( 6) ( 6)
PLACE 13 = {pl, p11, p12}; CAPACITY 13 = {137,298,298}
 (IJCNS) International Journal of Computer and Network Security, 23
Vol. 2, No. 5, May 2010

V13(1) and V13( 6) has no ‘+’ entry , also all the entries are not PLACE 14 form both siphon and trap whose input
( 6)

‘±’ only, but those sets which have all entries ‘±’ or ‘0’ transitions equal to the output transitions and both of
(1)
are both siphon and trap ( as V , V and V )
(3) (5)equal to the set of all transitions.
12 13 13
Step 5 the subsets of places, which are both siphon and
V13( 2) has ‘+’ entry at 2rd row. The neutralizing columns are trap, whose input transitions equal the output transitions
C6, C7, and C12. and both of them equal to the set of all transitions are{pl,
p3, p5, p7}and {pl,, p6, p11, p10}with capacities sum 634 and
−  0  − 
+  −  ±  661 as choosing column first C1.
V14 = V13 ⊕ C6 =   ⊕   =   ;
(1) ( 2)

±  +  ± 
Step 6 now delete C1 from sign incidence matrix, choose
      next column and repeat all the steps again in similar way,
±  0  ± 
      we get another different sets of places {p2, p4, p6, p8},{p2, p9,
p5, p12}, {p3, p8, p10, p12} and{p4, p11, p7, p9} as choosing
PLACE 14 = {pl, p3, p5, p6}; CAPACITY 14 = {137,206,128,128}columns C2 , C3 and C4 respectively having sum of the
(1) (1)

capacities 634, 661, 765 and 765. The set of places which
−  +  ± 
have minimum sum of capacities 634 is either {pl, p3, p5, p7}
V14( 2) = V13( 2) ⊕ C7 =  +  ⊕  −  =  ±  ; or {p2, p4, p6, p8}. The edges set {el, e3, e5, e7} or {e2, e4, e6, e8}
±  0  ± 
      are corresponding to places set {pl, p3, p5, p7} and {p2, p4, p6,
±  0  ±  p8} respectively, will form a shortest spanning cycle in
     
underlying graph of Petri Net-graph, which give an
PLACE 14 = {pl, p3, p5, p7}; CAPACITY 14 = {137,206,128,163}optimal route for the salesman in TSP-graph.
( 2) ( 2)
The finding of this can be applied to a company’s logistic
−  0  −  problem of delivering petrol or similar to different petrol
V14(3) = V13( 2) ⊕ C12 =  +  ⊕  −  =  ±  ; sub-stations. This delivery system is formulated as the Petri
±  0  ±  Net model, which involves finding an optimal route for
      visiting stations and returning to point of origin, where the
±
  +
    ±
      inter-station distance is symmetric and known. As a
standard problem, we defined it simply as the time spent or
( 3) ( 3)
PLACE 14 ={pl, p3, p5, p12}; CAPACITY 13 ={137,206,128,298}distance traveled by salesman visiting n cities (or nodes)
cyclically, where vehicle visits each station just once and
V13( 4) has ‘+’ entry at 3rd row. The neutralizing columns are returns the starting station. This real world application is a
deceptive simple combinatorial problem and our approach is
C4, C5, and C10.
to develop solutions of such type of distribution problems,
−  0  −  based on concept of the Petri nets.
V14( 4) = V13( 4) ⊕ C4 =  ±  ⊕  0  =  ±  ;
+  −  ±  5. Conclusion
     
±  +  ± In this paper, while solving the travelling salesman
     
problem, we have exploited the potentials of siphons and
( 4) ( 4) traps. Our analysis is based on the notion of sign
PLACE 14 ={pl, p6, p11, p4}; CAPACITY 14 ={137,298,128,206}incidence matrix; this helps us to relate Petri Net theory
−  0  −  to graph theory. The complexity of the TSP is part of a
±  +  ±  deep question in mathematics, as TSP is a NP- complete
V14 = V13 ⊕ C5 =   ⊕   =   ;
(5) ( 4)

+  −  ±  problem. Here we have developed an algorithm using Petri

     
±  0  ± 
net model, which can be executed by computer for any finite
     
     
number of nodes.

( 5) ( 5)
PLACE 14 ={pl, p6, p11, p5}; CAPACITY 14 = {137,298,128,128}Acknowledgement
I would like to thank my supervisor Prof.G.N. Purohit for
−  +  ± 
V14( 6) = V13( 4) ⊕ C10 =  ±  ⊕  0  =  ±  ;
 his continuous support and valuable suggestions for this
research work. I would also like to thank my friends,
+  −  ± 
      colleagues and Centre for mathematical sciences for their
±  0  ±  guidance and feedback to drive me in the proper direction of
      the research is highly appreciable. Last but not the least I
( 6) ( 6) would like to thank my parents for their love and support.
PLACE 14 = {pl, p6, p11, p10}; CAPACITY 14 = {137, 298, 128, 98}
V14(1) , V14(3) , V14( 4) and V14(5 ) has no + entry. V14( 2) , V14( 6)
have all the entries as ‘±’, Hence PLACE 14 and
( 2)
24 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010

References Authors Profile

[1] R. Boer and T. Murata, “Generating basis siphons and Prof. G. N. Purohit, a renowned
Mathematician of the state, joined Banasthali
traps of Petri nets using sign incidence matrix”, IEEE University in April, 2001 as Professor in the
Transactions on circuits and systems-1, Vol.41, No. 4, Department of Mathematics & Statistics and
pp. 266-271,(1994). also Coordinator of Centre for mathematical
sciences in Banasthali University. He received
[2] B. Baugarten,”Petri Nets basics and application” , 2nd the B.Sc, M.Sc and P.hd degree in
ed., Berlin: spectrum akademischer Verlag, (1996). mathematics from Rajasthan University during
[3] K.S. Cheung and K.O. Chow, “Cycle-Inclusion Property 1957-1968. His research interests are in Fluid
of Augmented Marked Graph” , Information Processing Dynamics, Partial Differential Equations, Petri
net theory and wireless networks.
Letters, Vol. 94, No. 6, pp. 271-276, (2005).
[4] F. Commoner, A. W. Holt, S. Even and A. Pnueli, Sunita kumawat received the B.Sc and M.Sc
“Marked directed graph” , Journal of Computer and degree in pure mathematics. And pursuing
System Sciences- 5, pp. 511-523, (1971). her P.hd in guidance of Prof. G. N. Purohit in
[5] Narasingh Deo, “Graph theory with Applications to research area of Petri net theory, As the
Junior Research Scholar under the centre for
Engineering and Computer Science”, Prentice-Hall, mathematical sciences(CMS), governed by
India, (1984). DST-New Delhi, in Banasthali
[6] S. Hiller Frederick and J Lieberman Gerald, University(Rajasthan).
“Operations Research “, Eighth edition, Tata Mcgraw
Hill, (1990),.
[7] M. Jünger, G. Reinelt and G. Rinaldi, "The Traveling
Salesman Problem," in Ball, Magnanti,Monma and Appendix
Nemhauser (eds.) , Handbook on Operations Research
and the Management Sciences North Holland Press,
pp. 225-330, (1994).
[8] D. S. Johnson, "Local Optimization and the Traveling
Salesman Problem," Proc. 17th Colloquium on
Automata, Languages and Programming, Springer
Verlag, pp. 446-461, (1990).
[9] T. Murata, “Petri nets, properties, analysis and
application” , Proceedings of IEEE, Vol.77 (4), pp. 541-
580, (1989).
[10] J. L., Peterson, “Petri net Theory and the Modeling of
Systems” , Prentice Hall, INC, Englewood, Cliffs, and
New Jercy, (1981).
[11] C.A. Petri, "Kommunikation mit Automaten." Bonn:
lnsti-tut fur Instrumentelle Mathematik, Schriften des
MM Nr. 3, 1962. Also, English translation,
"Communication with Auto-mata." New York: Griffiss
Air Force Base.Tech. Rep.RADC-TR-65-377, vol.1,
(1966).
[12] C.A. Petri, "Fundamentals of a theory of asynchronous
information flow," in Proc. of IP Congress 62,pp. 386-
390, (1963).
[13] J.V. Potvin, "The Travelling Salesman Problem: A
Neural Network Perspective", INFORMS Journal on
Computing 5, pp. 328-348, (1993).
[14] J.V. Potvin,"Genetic Algorithms for the Traveling
Salesman Problem", Annals of Operations Research 63,
pp. 339-370, (1996).
[15] W. Reisig, “Petri Nets and introduction “,
Heidelberg: springer-verlag, (1985).