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 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

On the Problem of Characterizing Boolean Petri Nets

by Sangita Kansal, Gajendra Pratap Singh, Mukti Acharya
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 128 - Number 2
Year of Publication: 2015
Authors: Sangita Kansal, Gajendra Pratap Singh, Mukti Acharya
10.5120/ijca2015906441

Sangita Kansal, Gajendra Pratap Singh, Mukti Acharya . On the Problem of Characterizing Boolean Petri Nets. International Journal of Computer Applications. 128, 2 ( October 2015), 1-4. DOI=10.5120/ijca2015906441

@article{ 10.5120/ijca2015906441,
author = { Sangita Kansal, Gajendra Pratap Singh, Mukti Acharya },
title = { On the Problem of Characterizing Boolean Petri Nets },
journal = { International Journal of Computer Applications },
issue_date = { October 2015 },
volume = { 128 },
number = { 2 },
month = { October },
year = { 2015 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume128/number2/22842-2015906441/ },
doi = { 10.5120/ijca2015906441 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:20:00.971820+05:30
%A Sangita Kansal
%A Gajendra Pratap Singh
%A Mukti Acharya
%T On the Problem of Characterizing Boolean Petri Nets
%J International Journal of Computer Applications
%@ 0975-8887
%V 128
%N 2
%P 1-4
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Petri nets are used for describing, designing and studying discrete event-driven systems that are characterized as being concurrent, asynchronous, distributed, parallel, and/or nondeterministic. As a graphical tool, Petri net can be used for planning and designing a system with given objectives, more effectively than flowcharts and block diagrams. As a mathematical tool, it enables one to set up state equations and algebraic equations and other mathematical models which govern the behavior of systems. The aim of this paper is to present some basic results and necessary and sufficient condition for a 1-safe Petri net that generates all the binary n- vectors as marking vectors, we shall call such Petri nets as Boolean Petri nets.

References
  1. Acharya, B.D. 2001. Set-indexers of a graph and set-graceful graphs, Bull. Allahabad Math. Soc., India, 16, 1-23.
  2. Araki, T., Kasami, T. 1977. Some Decision Problems Related to the Reachability Problem for Petri Nets, Theoretical Computer Science 3(1), 85104
  3. Jensen, K. 1986. Coloured Petri nets, Lecture notes in Computer Science, Vol. 254, Springer-Verlag, Berlin, 248-299.
  4. Kansal, S., Acharya, M. and Singh, G.P. 2012. Boolean Petri nets. In: Petri nets — Manufacturing and Computer Science( Ed.: Pawel Pawlewski), 381-406; Chapter 17. In-Tech Global Publisher, ISBN 978-953-51-0700-2.
  5. Kansal, S., Singh, G.P., Acharya, M. 2010. On Petri nets generating all the binary n-vectors, Scientiae Mathematicae Japonicae, 71(2), 209-216:e-2010, 113-120.
  6. Kansal, S., Singh, G.P., Acharya, M. 2011. 1-Safe Petri nets generating every binary n-vector exactly once, Scientiae Mathematicae Japonicae, 74,(1), 29-36, e-2011, 127-134.
  7. Narendra, K.S., Balakrishnan, J. 1994. Adaptive control using multiple models and switching. Technical report, Yale University.
  8. Nawel, G., Claude, D., Malika, I. 2009. Colored stochastic Petri nets for modelling and analysis of multiclass retrial systems, Elsevier, 49(7-8), 14361448.
  9. Petri, C.A., 1962. Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn.
  10. Pait, F.M, Morse, A.S. 1994. A cyclic switching strategy for parameter-adaptive control. IEEE Transactions on Automatic Control, 39(6), 11721183.
  11. Peterson, J. L., 1981. Petri net Theory and the Modeling of Systems, Englewood Cliffs, NJ: Prentice-Hall, Inc.
  12. Reisig,W., 1985. Petri nets, Springer-Verleg, New York, 1985.
  13. Tomihisa, K., Satoru, Kawai. 1989. An algorithm for drawing general undirected graphs, Information Processing Letters, Elsevier, 31(1), 7-15.
Index Terms

Computer Science
Information Sciences

Keywords

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

Powered by PhDFocusTM