1 Introduction
The foundations of theory of domination can be traced back to the chess problem of finding the minimum number of queens required such that all the squares are either occupied or can be attacked by a queenJaenisch (1862).The applications of theory of domination includes communication network problems, facility location problem, routings, etc.Sas ; Gupta (2013) .The domination in graphs and signed graphs have been well studied by various authors in different forms viz. Roman domination, double domination, total domination, signed domination, signed total domination etc.Harary and Haynes (2000); Haynes et al. (1998a); Acharya (2013); Ashraf and Germina (2015); Palakkutty et al. (2016); Blidia et al. (2006); Sampathkumar (1991); Zelinka (2001).
In Kansal and Payal , the authors introduced the concept of Signed Petri net(SPN) by utilizing the properties of signed graph and Petri net.SPNs are capable of modeling a large variety of systems and is prefered over a Petri net due to the presence of two types of tokens in it, positive and negative, which are distinguishable. Other advantages of using SPN over previously defined extensions of PN are the ability to assign sign to vertices of an SPN which is further utilized to introduce the concept of a balanced SPN as defined in Kansal and Payal .Further, in comparison to a signed graph, SPN is advantageous since a single SPN can be used to represent various signed graphs by simply varying the marking of SPN due to firing of a sequence of transitions.Thus, we need to analyse one SPN in order to infer about all possible signed graph structures that can be formed for a fixed number of vertices.
As SPN is a bipartite graph, it can be used to develop the theory of domination for dynamic systems as such a theory is not prevalent for Petri nets.
2 Basic Definitions
2.1 Petri Net (PN)
A Petri net Jensen (1987) is a 5tuple ,where

P is the finite, nonempty set of places.

T is the finite, nonempty set of transitions.

.

where is the set of nonnegative integers, are called negative and positive incidence functions respectively.

such that ,and
such that 
is the initial marking which gives the initial distribution of tokens in places.
The arc set of the Petri net is defined as:
2.2 Signed Petri Net
Definition 1.
Signed Petri Net (SPN)
A Signed Petri Net Kansal and Payal is defined as a 3tuple ,where

is a Petri net structure.

, where is the arc set of .An arc is called a positive or negative arc respectively according to the sign or assigned to it using the function .

is the initial marking of SPN where

gives the initial distribution of positive tokens in the places,called positive marking of SPN.

gives the initial distribution of negative tokens in the places,called negative marking of SPN.

Graphically, positive and negative arcs in an SPN are represented by solid and dotted lines respectively.A positive token is represented by a filled circle and a negative token by an open circle.
An SPN is said to be negative if all of its arcs are negative in sign.
Remark 1.
is called an SPN structure where is a PN structure and .
2.2.1 Execution Rules for Signed Petri Net
Similar to a Petri net, the execution of an SPN depends on the distribution of tokens in its places.The execution takes place by firing of a transition.A transition may fire if it is enabled.
A transition in an SPN is enabled at a marking if
An enabled transition may fire at provided such that:
After firing,it yields a new marking given by the rule:
if exist 
if exist 
We say that is reachable from and write .We restrict the movement of positive(negative) tokens to positive(negative) arcs only.
A marking is reachable from if there exists a firing sequence that transforms to and is written . A firing or occurence sequence is a sequence of transitions such that
Note that a transition can occur more than once in the firing sequence .
Let us look at the execution of an SPN with the help of an example.
In figure 1, and both are enabled at . Firing of yields a new marking and firing of yields a new marking .
In figure 1, is enabled,while is not. can fire to give a new marking
.
Definition 2.
Reachability Set of Signed Petri net
The Reachability Set of an SPN is the set of all markings of reachable from the initial marking .
2.3 Assignment of sign to vertices of an SPN
The vertices in an SPN can also be assigned sign.Transitions are assigned sign by product of sign of arcs (incoming and outgoing) incident on it.In Figure 1(a) and 1(b), all transitions are negative in sign.
Places can be assigned sign in one of the two ways:

With respect to marking – Sign is assigned to a place by taking product of sign of tokens in that place in the given marking.A place without token is considered to be positive.In Figure 1(a), places are positive in sign while is negatively signed w.r.t. the marking .In Figure 1(b), all the places are positively signed w.r.t. the marking .
Remark– Assigning sign to places with respect to arcs doesn’t utilize the most important characteristic(dynamic behaviour) of PN which is a marking.Hence, assigning sign to places with respect to marking has been used throughout the paper.
An example is given which uses the concept of place sign to determine whether a product is approved or disapproved by a company.A company has to make a decision on a certain product by voting of two board members.This situation is represented in figure 2 by modeling it with an SPN.
In the figure, and represent the board members .The transitions and will fire if positive tokens exist in places and while and transitions fire if and have negative tokens.A positive token is generated in places representing board members( and ) if they approve the product and else if they dispprove of it , a negative token is generated.A decision on the product is reached if either both and disapproves or both approves the product.On the other hand,if one member approves the product while other rejects it,no decision is made.We can determine the decision made by the company on the basis of the sign of the place in the final marking(when place gets a token).This is shown in table 1.
Transition firings  Sign of place  Decision made 

+  Yes  
  No  
  No  
+  Yes 
Thus,based on the sign of the place ,we can infer the following:

The decision made about the product(The company reaches a final decison if the sign of place is positive in marking with ,else no decision is made regarding product).

Whether and have same opinions or varied ones(Both the members have same opinion regarding product if the sign of place is positive,else they have varied opinion).
If initially the places and in figure 2 have one positive and negative token respectively, then this situation corresponds to second row in table 1.Hence,the product will not be approved by the company.
3 Domination Theory
In this section, we assume an ordinary SPN (without multiple arcs) unless stated otherwise.
Definition 3.
Dominating Set
A set in an SPN is called a Dominating set with respect to a marking if either all the vertices of are in or
where are sign of vertices with respect to marking .
Remark 2.
It may be noted that sign of a transition remains same irrespective of marking of the SPN while sign of a place may vary if the marking of SPN changes.
Definition 4.
Dominating Set with respect to a set of markings()
A set in an SPN is called a Dominating set with respect to a set of markings if is a dominating set with respect to all the markings .(Clearly,)
Definition 5.
Dependent(or connected) Dominating Set
A dominating set with respect to a set of markings in an SPN is called a dependent Dominating set if the markings of are all the nodes of some subtree of the reachability tree of .
Definition 6.
Minimal Dominating Set
A dominating set is called Minimal if no proper subset of it is a dominating set or it is a dominating set with minimum number of vertices.
Remark 3.
For application purposes we would like to find minimal dependent dominating set over a maximal set of markings ,i.e. We try to find a maximal set of markings, over which is a minimal dominating set.
Theorem 1.
For an SPN structure in which all the transitions are positively signed and each place has incident(input/output) arcs of one kind only, we can find a marking w.r.t. which is a dominating set where is a set of source vertices.
Proof.
If , then is a dominating set by definition.
If , then we have to find a marking such that is a dominating set w.r.t. . For any , (Since, is a source vertex).
Then, we find a marking such that
(1) 
where and are sign of vertices w.r.t. .
Let . Now, two cases arise:
Hence, for all ,
All the remaining places can have any number of positive and negative tokens without any restrictions.
∎
Theorem 2.
If an SPN structure with no source/sink vertices and in which any place has only one type of incident arcs then, we can find a marking such that and are dominating sets w.r.t. , provided all the transitions are of same sign.
Proof.
Since all the transitions are of same sign,two cases arise:

Transitions are positively signed.
We find a marking w.r.t. which and are dominating sets.
is a dominating set.
Let ,therefore, (since there are no source/sink vertices). We need to find a marking such that ;(2) 
is a dominating set.
Let ,therefore, (since there are no source/sink vertices). We need to find a marking such that ;(3)


Transitions are negatively signed.
By following the same procedure as in the case when transitions are positively signed, we find that for all ,
Thus, we get a marking w.r.t. which and are dominating sets.
∎
Remark 4.
The above theorem may be used in case of a disaster to check which transitions representing events in the system will dominate and hence may be used for preparedness against any disaster.
Remark 5.
Theorems 1 and 2 given above show that:

We can get a dominating set if we begin with the specified initial marking as mentioned in the proof.

sets in a PN represent conditions and events respectively of the system modeled.So,we can check whether conditions or events dominate in the given system w.r.t. a given marking.

If we know the structure of an SPN and marking , then we can check whether domination can occur by checking if w.r.t. which there exists a dominating set.So, in order to avoid or force domination we can restrict (or force) SPN to avoid (or reach) such a marking.
4 Applications of Domination
We discuss applications of domination in SPN that can be utilized in various areas.
4.1 Producer Consumer Problem
Consider, a standard Producer Consumer Problem with two producers producing a same product (assuming quality,price and other conditions are same),we need to check whether one of the producer can dominate the market over the other.This can happen due to availability of product is greater for one producer as compared to other or because one product is well known due to its better marketing, etc. Consider an SPN model for the problem given in figure 3.
Now,in order to check if producer 2 dominates the market ,we need to find a set of vertices which is a dependent dominating set over a maximal set of markings . A dependent dominating set is considered because one producer is said to dominate over the other if such a domination exists over a period of time, not for just an instant.
Choose .Find if there exists a set of markings (maximal) with marking such that and must be a dominating set w.r.t. . Similarly, to check if producer 1 dominates the market we need to check domination of set w.r.t. a set of markings where .
4.2 Search of food by bees
Bees (Scout bees) go out in search of food.The one which find the food will return to the hive and celebrate.This scout bee can be considered to dominate other scout bees.This problem can be modeled using an SPN and then it can be identified which scout bee will dominate the beehive.Consider the figure 4 where place represents the beehive while represent possible food locations where scout bees and respectively search for food.The transitions represent events of food search while represent events of food search completion.The positive tokens are used to represent bees and negative ones to represent food.
According to the initial marking of SPN, location has food while location does not.Therefore, bee must dominate.This can be verified by checking that the set is a dominating set w.r.t.the initial marking rather than set .In the later case, bee will dominate the beehive.
The model can be extended if more than two bees search for food.
4.3 Finding papers with similarity to a given paper using softwares like Turnitin
Consider a paper which need to be checked for similarity using a software.This paper is compared with web content that is publicly available, books, papers in journals, articles and other content which is present in a software database.Let the paper to be checked be represented by a place and the rest of the content be represented by places .To check for similarity, an SPN model is formed by connecting place to all other places via transitions and by using negative arcs as in figure 5.
While comparing paper with another article represented by place (say),, a matching algorithm is used to find a set of strings within submitted paper that matches with the papers maintained in its database.If a similarity exists, a negative token is generated in place which can be used to fire corresponding transition .In this way, the submitted paper is checked for similarity with all the content present in the database.After the comparisons are completed, we get a new marking for the SPN in which all the articles that have some similarity with the submitted paper get a negative token in the place representing it.All such places will form a list of articles that are similar to the paper submitted which is to be tested for similarity.
Now, in order to find the list of all articles which have some similarity with the submitted paper,the concept of domination can be used instead of finding all the places having a negative token. Begin with set .Check whether set is a dominating set w.r.t. the final marking(say ) obtained after the matching algorithm is complete.If yes,then all the papers have some similarity with the submitted paper.If not, we find such that is a dominating set w.r.t..Then ,the set will form the set of all the articles which have similarity with the submitted paper.
References
 (1) Applications of dominating set of graph in computer networks. International Journal of Engineering Sciences and Research Technology, page 170– 173 year =.
 Acharya (2013) B. D. Acharya. Domination and absorbance in signed graphs and digraphs, i: Foundations. Journal of Combinatorial Mathematics and Combinatorial Computing, pages 5–20, 2013.
 Ashraf and Germina (2015) P. K. Ashraf and K. A. Germina. On minimal dominating sets for signed graphs. Advances and Applications in Discrete Mathematics, 15:101–112, 2015.
 Blidia et al. (2006) M. Blidia, M. Chellali, T. W. Haynes, and M. Henning. Independent and double domination in trees. Utilitas Mathematica, 70:159–173, 2006.
 Gupta (2013) P. Gupta. Domination in graph with application. Indian Journal of Research,Paripex, 2(3):115 – 117, 2013. ISSN 22501991.
 Harary and Haynes (2000) F. Harary and T. Haynes. Double domination in graphs. Ars Combinatoria, 55:201–213, 2000.
 Haynes et al. (1998a) T. Haynes, S. T. Hedetneimi, and P. J. Slater. Fundamentals of domination in graphs. New York, NY: Marcel Dekker, 1998a.
 Jaenisch (1862) C. d. Jaenisch. Trait des Applications de l’Analyse Mathematique au Jeu des Echecs. Petrograd. 1862.
 Jensen (1987) K. Jensen. Coloured petri nets. LNCS,Springer, Heidelberg, 254:248–299, 1987.
 (10) S. Kansal and Payal. An introduction to signed petri net. Communicated.
 Palakkutty et al. (2016) A. Palakkutty, A. Germina, and L. Lishan. Double domination in signed graphs. Cogent Mathematics, 3:1186135, 2016.
 Sampathkumar (1991) E. Sampathkumar. On some new domination parameters of a graph – a survey. In Proceedings of a Symposium on Graph Theory and Combinatorics, Kochi, Kerala,India, pages 17–19, 1991.
 Zelinka (2001) B. Zelinka. Signed total domination number of a graph. Czechoslovak Mathematical Journal, 51(2):225–229, 2001.
Comments
There are no comments yet.