Most Read Research Articles


Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79

Warning: Creating default object from empty value in /var/www/html/sandbox.ijcaonline.org/public_html/modules/mod_mostread/helper.php on line 79
Call for Paper - May 2015 Edition
IJCA solicits original research papers for the May 2015 Edition. Last date of manuscript submission is April 20, 2015. Read More

Existence and Uniqueness of a Minimum Crisp Boolean Petri Net

Print
PDF
International Journal of Computer Applications
© 2013 by IJCA Journal
Volume 73 - Number 20
Year of Publication: 2013
Authors:
Gajendra Pratap Singh
Sangita Kansal
Mukti Acharya
10.5120/13013-0316

Gajendra Pratap Singh, Sangita Kansal and Mukti Acharya. Article: Existence and Uniqueness of a Minimum Crisp Boolean Petri Net. International Journal of Computer Applications 73(20):45-41, July 2013. Full text available. BibTeX

@article{key:article,
	author = {Gajendra Pratap Singh and Sangita Kansal and Mukti Acharya},
	title = {Article: Existence and Uniqueness of a Minimum Crisp Boolean Petri Net},
	journal = {International Journal of Computer Applications},
	year = {2013},
	volume = {73},
	number = {20},
	pages = {45-41},
	month = {July},
	note = {Full text available}
}

Abstract

In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2n binary n-vectors has been found. In this paper, the existence and uniqueness of a minimum Petri net which generates all the 2n binary n-vectors exactly once has been shown. For brevity, a 1-safe Petri net that generate all the binary n-vectors as marking vectors is called a Boolean Petri net and a 1-safe Petri net that generates all the binary n-vectors exactly once is called crisp Boolean Petri net.

References

  • Petri, C. A. , Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn 1962.
  • Kansal, S. , Singh, G. P. and Acharya, M. , On Petri nets generating all the binary n-vectors, Scientiae Mathematicae Japonicae, 71(2), 2010, 209-216.
  • Kansal, S. , Singh, G. P. and Acharya, M. , 1-Safe Petri nets generating every binary n-vector exactly once, Scientiae Mathematicae Japonicae, 74(1), 2011, 29-36.
  • Peterson, J. L. , Petri net Theory and the Modeling of Systems, Englewood Cliffs, NJ: Prentice-Hall, Inc. , 1981.
  • Harary, F. , Graph theory, Addison-Wesley, Massachusettes, Reading, 1969.
  • Jensen, K. , Coloured Petri nets, Lecture notes in Computer Science, Springer-Verlag, Berlin, 254, 1986, 248-299.
  • Reisig, W. , Petri nets, Springer-Verleg, New York, 1985.
  • Murata, T. , Petri nets: Properties, analysis and applications, Proc. IEEE, 77(4), 1989, 541-580.
  • Kansal, S. , Acharya, M. and Singh, G. P. , Boolean Petri nets. In: Petri nets — Manufacturing and Computer Science (Ed. : Pawel Pawlewski), 381-406; Chapter 17. In-Tech Global Publisher, 2012, ISBN 978-953-51-0700-2.
  • Singh, G. P. , Some advances in the theory of Petri nets, Ph. D. Thesis, submitted to the University of Delhi, Delhi, December 5, 2012.