Ph.D (Mathematics)
PETRI NETS, GRAPH THEORY, OPERATIONAL RESEARCH, ANALYTICAL HIERACHYCAL PROCESS
More than 6 YEARS (GUEST AND ADHOC) teaching experience at the colleges of University of Delhi, Delhi, India
Senior Research Fellowship
DST full travel grant for the presentation of research papers.
1. 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, ISSN 1346-0447.
2. Kansal, S., Singh, G.P. and Acharya, M., A disconnected 1-safe Petri net whose reachability tree is homomorphic to a complete boolean lattice, Proceeding of International Conference on Process Automation Control and Computing, IEEE Xplore, 2011, 1-5, ISBN: 978-1-61284-762-7.
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, ISSN 1346-0447.
4. Kansal, S., Acharya, M. and Singh, G.P., Uniqueness of minimal 1-safe Petri net generating every binary n-vectors as its marking vectors exactly once, Scientiae Mathematicae Japonicae, 74(2 & 3), 2011, 117-120, ISSN 1346-0447.
5. Singh, G.P., Kansal, S. and Acharya, M., Embedding an arbitrary 1-safe Petri net in a Boolean Petri net, Int. J. of Comp. Appli., Foundation of Computer Science, New York, USA, 70(6), May, 2013, 7-9, ISBN: 973-93-80874-96-7.
1. Kansal, S., Acharya, M. and Singh, G.P., Boolean Petri nets. In: Petri nets --- Manufacturing and Computer Science (Ed.: PawelPawlewski), 381-406; Chapter 17. In-Tech Global Publisher, 2012, ISBN 978-953-51-0700-2.
2. Singh, G.P., Kansal, S. and Acharya, M., Construction of a crisp Boolean Petri net from a 1-safe Petri net, Int. J. of Comp. Appli., Foundation of Computer Science, New York, USA, 73(17), July, 2013, 1-4, ISBN: 973-93-80876-17-5.
3. Singh, G.P., Basic properties of Petri nets, SRMS Journals of Mathematical Sciences, published by Department of Mathematics, Shri Ram MurtiSmarak College of Engg. & Tech., Bareilly-243202, U.P., India, 1(1), 2015, 54-71, ISBN: 2394-725X. (Invited talk publication).
NILL