Skip to main content
SpringerLink
Log in

Kernel P Systems Modelling, Testing and Verification - Sorting Case Study

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

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

Included in the following conference series:

Abstract

A kernel P system (kP system, for short) integrates in a coherent and elegant manner many of the P system features most successfully used for modelling various applications and, consequently, it provides a framework for analyzing these models. In this paper, we illustrate the modelling capacity of kernel P systems by providing a number of kP system models for sorting algorithms. Furthermore, the problem of testing systems modelled as kP systems is also discussed and a test generation method based on automata is proposed. We also demonstrate how formal verification can be used to validate that the given models work as desired.

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

Access this chapter

Log in via an institution
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. Alhazov, A., Sburlan, D.: Static sorting algorithms for P systems. In: Alhazov, A., et al. (eds.) Pre-Proceedings of 4\(^{th}\) Workshop on Membrane Computing, GRLMC report 28/03, Tarragona, pp. 17–40 (2003)

    Google Scholar 

  2. Alhazov, A., Sburlan, D.: Static Sorting P Systems. In: [16], pp. 215–252 (2006)

    Google Scholar 

  3. Arulanandham, J.J.: Implementing bead-sort with P systems. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 115–125. Springer, Heidelberg (2002). doi:10.1007/3-540-45833-6_10

    Chapter  Google Scholar 

  4. Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. In: Champarnaud, J.-M., Ziadi, D., Maurel, D. (eds.) WIA 1998. LNCS, vol. 1660, pp. 43–56. Springer, Heidelberg (1999). doi:10.1007/3-540-48057-9_4

    Chapter  Google Scholar 

  5. Câmpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1–2), 3–16 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ceterchi, R., Martín-Vide, C.: P systems with communication for static sorting. In: Cavaliere, M., et al. (eds.) Pre-proceedings of 1\(^{st}\) Brainstorming Week on Membrane Computing, Technical report no 26, pp. 101–117. Rovira i Virgili University, Tarragona (2003)

    Google Scholar 

  7. Ceterchi, R., Martín-Vide, C.: Dynamic P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 146–186. Springer, Heidelberg (2003). doi:10.1007/3-540-36490-0_11

    Chapter  Google Scholar 

  8. Ceterchi, R., Pérez-Jiménez, M.J., Tomescu, A.I.: Simulating the bitonic sort using P systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 172–192. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77312-2_11

    Chapter  Google Scholar 

  9. Ceterchi, R., Pérez-Jiménez, M.J., Tomescu, A.I.: Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts. In: Diaz-Pernil, D., et al. (eds.) Proceedings of 6\(^{th}\) Brainstorming Week on Membrane Computing, RGNC report 01/08, Fénix Editora, pp. 79–92 (2008)

    Google Scholar 

  10. Ceterchi, R., Tomescu, A.I.: Implementing sorting networks with spiking neural P systems. Fundamenta Informaticae 87(1), 35–48 (2008)

    MathSciNet  MATH  Google Scholar 

  11. Ceterchi, R., Sburlan, D.: Membrane Computing and Computer Science, Chap. 22 of [30], pp. 553–583 (2010)

    Google Scholar 

  12. Chow, T.S.: Testing Software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178–187 (1978)

    Article  MATH  Google Scholar 

  13. Freund, R., Pérez-Hurtado, I., Riscos-Núñez, A., Verlan, S.: A formalization of membrane systems with dynamically evolving structures. Int. J. Comput. Math. 90(4), 801–815 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  14. Freund, R., Verlan, S.: A formal framework for static (tissue) P systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 271–284. Springer, Heidelberg (2007). doi:10.1007/978-3-540-77312-2_17

    Chapter  Google Scholar 

  15. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2 version 2: an opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002). doi:10.1007/3-540-45657-0_29

    Chapter  Google Scholar 

  16. Gheorghe, M., Ipate, F.: On testing P systems. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 204–216. Springer, Heidelberg (2009). doi:10.1007/978-3-540-95885-7_15

    Chapter  Google Scholar 

  17. Gheorghe, M., Ipate, F., Dragomir, C.: Kernel P systems. In: Martínez-del-Amor, M.A., et al. (eds.) Proceedings of 10\(^{th}\) Brainstorming Week on Membrane Computing, pp. 153–170. Fénix Editora, Universidad de Sevilla (2012)

    Google Scholar 

  18. Gheorghe, M., Ipate, F., Dragomir, C., Mierlă, L., Valencia-Cabrera, L., García-Quismondo, M., Pérez-Jiménez, M.J.: Kernel P systems - version 1. In: Valencia-Cabrera, L., et al. (eds.) Proceedings of 11th Brainstorming Week on Membrane Computing, pp. 97–124. Fénix Editora, Universidad de Sevilla (2013)

    Google Scholar 

  19. Gheorghe, M., Ipate, F., Lefticaru, R., Pérez-Jiménez, M.J., Ţurcanu, A., Valencia-Cabrera, L., García-Quismondo, M., Mierlă, L.: 3-COL problem modelling using simple kernel P systems. Int. J. Comput. Math. 90(4), 816–830 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  20. Gheorghe, M., Păun, Gh, Pérez-Jiménez, M.J., Rozenberg, G.: Research frontiers of membrane computing: open problems and research topics. Int. J. Found. Comput. Sci. 24, 547–624 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gheorghe, M., Konur, S., Ipate, F., Mierla, L., Bakir, M.E., Stannett, M.: An integrated model checking toolset for kernel P systems. In: Rozenberg, G., Salomaa, A., Sempere, J.M., Zandron, C. (eds.) CMC 2015. LNCS, vol. 9504, pp. 153–170. Springer, Cham (2015). doi:10.1007/978-3-319-28475-0_11

    Chapter  Google Scholar 

  22. Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5), 275–295 (1997)

    Article  Google Scholar 

  23. Ipate, F.: Bounded sequence testing from deterministic finite state machines. Theor. Comput. Sci. 411(16–18), 1770–1784 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Ipate, F., Gheorghe, M.: Finite state based testing of P systems. Nat. Comput. 8(4), 833–846 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  25. Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. 3, 2nd edn. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998). ISBN: 0-201-89685-0

    MATH  Google Scholar 

  26. Körner, H.: On minimizing cover automata for finite languages in O(n log n) time. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 117–127. Springer, Heidelberg (2003). doi:10.1007/3-540-44977-9_11

    Chapter  Google Scholar 

  27. Păun, Gh: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  28. Păun, Gh: Membrane Computing - An Introduction. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  29. Păun, Gh, Rozenberg, G., Salomaa, A. (eds.): The Oxford Handbook of Membrane Computing. Oxford University Press, New York (2010)

    MATH  Google Scholar 

  30. Sburlan, D.: A static sorting algorithm for P systems with mobile catalysts. Analele Ştiinţifice Universitatea Ovidius Constanţa 11(1), 195–205 (2003)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are indebted to the anonymous reviewers for carefully reading and providing comments allowing us to improve the content and presentation of the paper. MG and SK acknowledge the support provided for synthetic biology research by EPSRC ROADBLOCK (project number: EP/I031812/1). The work of FI and MG was supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI (project number: PN-II-ID-PCE-2011-3-0688).

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, University of Bradford, Bradford, BD7 1DP, UK

    Marian Gheorghe & Savas Konur

  2. Department of Computer Science, University of Bucharest, Str. Academiei nr. 14, 010014, Bucharest, Romania

    Rodica Ceterchi & Florentin Ipate

  3. Department of Computer Science, University of Piteşti, Str Targul din Vale, nr 1, 110040, Argeş, Romania

    Florentin Ipate

Authors
  1. Marian Gheorghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rodica Ceterchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Florentin Ipate
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Savas Konur
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marian Gheorghe .

Editor information

Editors and Affiliations

  1. University of Milano-Bicocca , Milan, Italy

    Alberto Leporati

  2. Leiden University , Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Center for Computer Science , Turku, Finland

    Arto Salomaa

  4. University of Milan-Bicocca , Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gheorghe, M., Ceterchi, R., Ipate, F., Konur, S. (2017). Kernel P Systems Modelling, Testing and Verification - Sorting Case Study. In: Leporati, A., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2016. Lecture Notes in Computer Science(), vol 10105. Springer, Cham. https://doi.org/10.1007/978-3-319-54072-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54072-6_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-54071-9

  • Online ISBN: 978-3-319-54072-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation