We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Existence and Uniqueness of a Minimum Crisp Boolean Petri Net

by Gajendra Pratap Singh, Sangita Kansal, Mukti Acharya
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
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, Mukti Acharya . Existence and Uniqueness of a Minimum Crisp Boolean Petri Net. International Journal of Computer Applications. 73, 20 ( July 2013), 35-41. DOI=10.5120/13013-0316

@article{ 10.5120/13013-0316,
author = { Gajendra Pratap Singh, Sangita Kansal, Mukti Acharya },
title = { Existence and Uniqueness of a Minimum Crisp Boolean Petri Net },
journal = { International Journal of Computer Applications },
issue_date = { July 2013 },
volume = { 73 },
number = { 20 },
month = { July },
year = { 2013 },
issn = { 0975-8887 },
pages = { 35-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume73/number20/13013-0316/ },
doi = { 10.5120/13013-0316 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:40:54.410839+05:30
%A Gajendra Pratap Singh
%A Sangita Kansal
%A Mukti Acharya
%T Existence and Uniqueness of a Minimum Crisp Boolean Petri Net
%J International Journal of Computer Applications
%@ 0975-8887
%V 73
%N 20
%P 35-41
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
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
  1. Petri, C. A. , Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn 1962.
  2. 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.
  3. 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.
  4. Peterson, J. L. , Petri net Theory and the Modeling of Systems, Englewood Cliffs, NJ: Prentice-Hall, Inc. , 1981.
  5. Harary, F. , Graph theory, Addison-Wesley, Massachusettes, Reading, 1969.
  6. Jensen, K. , Coloured Petri nets, Lecture notes in Computer Science, Springer-Verlag, Berlin, 254, 1986, 248-299.
  7. Reisig, W. , Petri nets, Springer-Verleg, New York, 1985.
  8. Murata, T. , Petri nets: Properties, analysis and applications, Proc. IEEE, 77(4), 1989, 541-580.
  9. 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.
  10. Singh, G. P. , Some advances in the theory of Petri nets, Ph. D. Thesis, submitted to the University of Delhi, Delhi, December 5, 2012.
Index Terms

Computer Science
Information Sciences

Keywords

1-safe Petri net reachability tree binary n-vector marking vector