论文信息 - Domination in Signed Petri Net

Domination in Signed Petri Net

In this paper, domination in Signed Petri net(SPN) has been introduced.We identify some of the Petri net structures where a dominating set can exist.Applications of producer consumer problem, searching of food by bees and finding similarity in research papers are given to understand the areas where the proposed theory can be used.

Payal | Sangita Kansal

[1] Bohdan Zelinka,et al. Signed Total Domination Nnumber of a Graph , 2001 .

[2] Kurt Jensen,et al. Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

[3] Preeti Gupta,et al. Domination in Graph with Application , 2013 .

[4] K. A. Germina,et al. Double domination in signed graphs , 2016 .

[5] Frank Harary,et al. Double Domination in Graphs , 2000, Ars Comb..

[6] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.