Skip to main content

Partial Array Token Petri Net and P System

  • Conference paper
  • First Online:
Membrane Computing (CMC 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12687))

Included in the following conference series:

Abstract

The innovative model of partial array languages generated by basic puzzle partial array grammars is available in the literature. Here we define Partial array Token Petri Net Structure (PATPNS) to generate partial array languages. Further we introduce Partial Array Token Petri Net P System (PATPNPS) to generate partial array languages and compared with basic puzzle partial array grammars for generative power. PATPNS is also compared with local and recognizable partial array languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theor. Comput. Sci. 218(1), 135–141 (1999)

    Article  MathSciNet  Google Scholar 

  2. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 215–267. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_4

    Chapter  Google Scholar 

  3. Lalitha, D.: Rectangular array languages generated by a Colored Petri Net. In: IEEE International Conference on Electrical Computer and Communication Technologies, pp. 1–5 (2015)

    Google Scholar 

  4. D., L.: Rectangular array languages generated by a Petri net. In: Sethi, I.K. (ed.) Computational Vision and Robotics. AISC, vol. 332, pp. 17–27. Springer, New Delhi (2015). https://doi.org/10.1007/978-81-322-2196-8_3

    Chapter  Google Scholar 

  5. Lalitha, D., Rangarajan, K., Thomas, D.G.: Rectangular arrays and Petri nets. In: Barneva, R.P., Brimkov, V.E., Aggarwal, J.K. (eds.) IWCIA 2012. LNCS, vol. 7655, pp. 166–180. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-34732-0_13

    Chapter  Google Scholar 

  6. Mary Metilda, M.I., Lalitha, D.: Kolam generated by color Petri nets. In: Tuba, M., Akashe, S., Joshi, A. (eds.) Information and Communication Technology for Sustainable Development. AISC, vol. 933, pp. 675–681. Springer, Singapore (2020). https://doi.org/10.1007/978-981-13-7166-0_68

    Chapter  Google Scholar 

  7. Mary Metilda, M.I., Lalitha, D.: Petri nets for pasting tiles. In: Solanki, V.K., Hoang, M.K., Lu, Z.J., Pattnaik, P.K. (eds.) Intelligent Computing in Engineering. AISC, vol. 1125, pp. 701–708. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-2780-7_76

    Chapter  Google Scholar 

  8. Nivat, M., Saoudi, A., Subramanian, K.G., Siromoney, R., Dare, V.R.: Puzzle grammar and context-free array grammars. Int. J. Pattern Recogn. Artif. Intell. 05(05), 663–676 (1991)

    Article  Google Scholar 

  9. Paun, Gh.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)

    Article  MathSciNet  Google Scholar 

  10. Peterson, J.L.: Petri Net Theory and Modeling of Systems. Prentice Hall Inc., Englewood Cliffs (1981)

    MATH  Google Scholar 

  11. Sasikala, K., Kalyani, T., Thomas, D.G.: Partial array grammars and partial array-rewriting \(P\) systems. Math. Eng. Sci. Aerosp. 11(1), 227–236 (2020)

    Google Scholar 

  12. Subramanian, K.G., Saravanan, R., Geethalakshmi, M., Helen Chandra, P., Margenstern, M.: \(P\) systems with array object and array rewriting rules. Prog. Nat. Sci. 17(4), 479–485 (2007)

    Article  MathSciNet  Google Scholar 

  13. Sweety, F., Sasikala, K., Kalyani, T., Thomas, D.G.: Partial array-rewriting \(P\) systems and basic puzzle partial array grammar. In: AIP Conference Proceedings, vol. 2277, p. 030003 (2020)

    Google Scholar 

  14. Sweety, F., Thomas, D.G., Dare, V.R., Kalyani, T.: Recoginizability of partial array languages. J. Comb. Math. Comb. Comput. 69, 237–249 (2009)

    MATH  Google Scholar 

  15. Vijaya Chitra, S., Sasikala, K.: Squares in partial arrays. In: AIP Conference Proceedings, vol. 2112, pp. 20–34 (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sasikala, K., Sweety, F., Kalyani, T., Thomas, D.G. (2021). Partial Array Token Petri Net and P System. In: Freund, R., Ishdorj, TO., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2020. Lecture Notes in Computer Science(), vol 12687. Springer, Cham. https://doi.org/10.1007/978-3-030-77102-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-77102-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-77101-0

  • Online ISBN: 978-3-030-77102-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics