Group Associated Petri Nets in Bio Computing
A Petri net can be represented as a particular kind of bipartite graph consisting of two kinds of nodes called places and transitions. Directed arcs are used to connect places to transitions (output of places) and to connect transitions to places (input of places). The study of structural properties and behavioral properties for the bounded conflict free Petri net has been made utilizing siphons and traps .
KeywordsBipartite Graph Nitrogen Cycle Input Transition Behavioral Property Christian College
- 2.Thirusangu, K., Rajeswari, R., Balasangu, K.: Bounded Conflict Free Petri Nets Relative to (Zn, A). International Journal of Combinatorial Graph Theory and Applications (IJCGTA) 1(2), 99–108 (2008)Google Scholar