International Journal of Mathematics Trends and Technology
Volume 68 | Issue 4 | Year 2022 | Article Id. IJMTT-V68I4P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V68I4P502
| Received | Revised | Accepted |
|---|---|---|
| 04 Mar 2022 | 05 Apr 2022 | 16 Apr 2022 |
Multi-Strings Token Petri Net was introduced earlier. Context-Free Multi-Strings Token Petri Nets will be closed under union and concatenation.
[1] James Peterson, Petrinet theory and modeling of systems, USA: Prentice Hall, 1997.
[2] T. Muratma, Perti nets: properties, analysis and applications, Proceedings of IEEE, 77 (4) (1989) 54 1-580.
[3] G. Rozenberg, editor. Advances in Petri Nets 1987. Springer Science & Business Media; 1987 Jun 22.
[4] Hsu-Chun Yen, Introduction to Petri Net Theory, Recent Advances in Formal Languages and Applications 25 (2006) 343-373.
[5] J. Esparza, Decidability and complexity of Petri net problems—an introduction. In Advanced Course on Petri Nets, Springer, Berlin, Heidelberg, (1996) 374-428.
[6] W. J. Thong and M. A. Ameedeen, A survey of Petri net tools, Advanced computer and communication engineering technology. Springer, Cham, (2015) 537-551.
[7] P. T. An and P. V. Thao, On capacity of labeled Petri net languages, Vietnam Journal of Mathematics 27 (1999)231-240.
[8] M. Jantzen and G. Zetzsche, Labeled Step Sequences in Petri Nets,In International Conference on Applications and Theory of Petri Nets, Springer, Berlin, Heidelberg, (2008) 270-287.
[9] X. Yin and S. Lafortune, On the Decidability and Complexity of Diagnosability for Labeled Petri Nets, IEEE Transactions on Automatic Control, 62 (2017) 5931-5938.
[10] M. Hack. Petri net languages. Technical report, Massachusetts Institute of Technology,1976.
[11] M. Jantzen, Language theory of petri nets,InAdvanced Course on Petri Nets,LNCS, Springer, Berlin, Heidelberg, (1986) 397-412. Shirley Gloria. D. K & D. K. Sheena Christy / IJMTT, 68(4), 7-11, 2022 11
[12] S. Lafortune and H. Yoo, Some results on Petri net languages. IEEE Transactions on Automatic Control, 35(1990)482-485.
[13] H. G. Baker, Petri nets and languages. Massachusetts Institute of Technology, Project MAC, 1972.
[14] P. T. An, A complexity characteristic of Petri net languages, Acta Math. Vietnam. 24 (1999) 157-167.
[15] M. Jantzen, On the hierarchy of Petri net languages, RAIRO. Informatique théorique., 13 (1979) 19-30.
[16] E. Javier, Decidability and complexity of Petri net problems—an introduction, Advanced Course on Petri Nets. Springer, Berlin, Heidelberg, (1966).
[17] Beulah Immanuel, K. Rangarajan, and K.G.Subramanian, String-token Petri nets, In: Proceedings of the European Conference on Artificial Intelligence, One Day Workshop on Symbolic Networks at Valencia, In: Spain, 2004.
[18] S.Devi and D.K.Shirley Gloria, Context-Free Languages of String Token Petri Nets, In: International Journal of Pure and Applied Mathematics 113 (2017)96–104.
[19] D.K.Shirley Gloria, Beulah Immanuel, and K.Rangarajan, Parallel Context-Free String-Token Petri Nets, In: International Journal of Pure and Applied Mathematics 59 (2010)275 – 286.
[20] D.K.Shirley Gloria and D. K. Sheena Christy, "Context-Free Multi-Strings Token Petri Nets", International Conference on Instrumentation, MEMS Biosensing Technology-2022, SRM Institute of Science and Technology. (Submitted)
[21] Peter linz, An Introduction to Formal Languages and Automata, 5th edition, Jones & Bartlett Learning, LLC (2012)
Shirley Gloria. D. K and D. K. Sheena Christy, "Few Closure Properties of Context-Free Multi-Strings Token Petri Net," International Journal of Mathematics Trends and Technology (IJMTT), vol. 68, no. 4, pp. 8-11, 2022. Crossref, https://doi.org/10.14445/22315373/IJMTT-V68I4P502
PDF 
Abstract 
Keywords 
References 
Citation