Abstract
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 [2].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Medici, L.O., Azevedo, R.A., Smith, R.J., Lea, P.J.: The influence of nitrogen supply on antioxidant enzymes in plant roots. Funct. Plant. Biol. 31, 1–9 (2004)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thirusangu, K., Gnanaraj Thomas, D., Balamurugan, B.J. (2012). Group Associated Petri Nets in Bio Computing. In: Ramanujam, R., Ramaswamy, S. (eds) Distributed Computing and Internet Technology. ICDCIT 2012. Lecture Notes in Computer Science, vol 7154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28073-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-28073-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28072-6
Online ISBN: 978-3-642-28073-3
eBook Packages: Computer ScienceComputer Science (R0)