Skip to main content
SpringerLink
Log in
Book cover

International Conference on Membrane Computing

CMC 2018: Membrane Computing pp 142–159Cite as

Testing Identifiable Kernel P Systems Using an X-Machine Approach

  • Conference paper
  • First Online:

  • 319 Accesses

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

Abstract

This paper presents a testing approach for kernel P systems (kP systems), based on the X-machine testing method and the concept of cover automaton. The testing methodology ensures that the implementation conforms the specifications, under certain conditions, such as the identifiability concept in the context of kernel P systems.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Notes

  1. 1.

    The minimisation preserves the controlability requirements as the set \(L_{A_Z} \cap \varPhi [l]\) remains unchanged.

  2. 2.

    Notation: for rules r and \(r'\), \(r r'\) denotes the application of rules r and \(r'\) in one single step, whereas \(r \ r'\) (separated by space) denotes the application of rule r in one step followed by the application of rule \(r'\) in the following step; the second notation is also used for multisets of rules.

References

  1. Agrigoroaiei, O., Ciobanu, G.: Flattening the transition P systems with dissolution. In: Gheorghe, M., Hinze, T., Păun, G., Rozenberg, G., Salomaa, A. (eds.) CMC 2010. LNCS, vol. 6501, pp. 53–64. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-18123-8_7

    Chapter  MATH  Google Scholar 

  2. 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). https://doi.org/10.1007/3-540-48057-9_4

    Chapter  MATH  Google Scholar 

  3. Câmpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1–2), 3–16 (2001). https://doi.org/10.1016/S0304-3975(00)00292-9

    Article  MathSciNet  MATH  Google Scholar 

  4. Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178–187 (1978). https://doi.org/10.1109/TSE.1978.231496

    Article  MATH  Google Scholar 

  5. Dragomir, C., Ipate, F., Konur, S., Lefticaru, R., Mierla, L.: Model checking kernel P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 151–172. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54239-8_12

    Chapter  Google Scholar 

  6. Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Cambridge (1974)

    MATH  Google Scholar 

  7. Freund, R., Leporati, A., Mauri, G., Porreca, A.E., Verlan, S., Zandron, C.: Flattening in (tissue) P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 173–188. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54239-8_13

    Chapter  Google Scholar 

  8. Gheorghe, M., Ipate, F.: Identifiable kernel P systems (2018, submitted)

    Chapter  Google Scholar 

  9. Gheorghe, M., et al.: Kernel P systems - Version I. In: Eleventh Brainstorming Week on Membrane Computing (11BWMC), pp. 97–124 (2013). http://www.gcn.us.es/files/11bwmc/097_gheorghe_ipate.pdf

  10. Gheorghe, M., Ipate, F., Konur, S.: Testing based on identifiable P systems using cover automata and X-machines. Inf. Sci. 372, 565–578 (2016). https://doi.org/10.1016/j.ins.2016.08.028

    Article  Google Scholar 

  11. Gheorghe, M., et al.: 3-Col problem modelling using simple kernel P systems. Int. J. Comput. Math. 90(4), 816–830 (2013). https://doi.org/10.1080/00207160.2012.743712

    Article  MathSciNet  MATH  Google Scholar 

  12. Ipate, F.: Bounded sequence testing from deterministic finite state machines. Theor. Comput. Sci. 411(16–18), 1770–1784 (2010). https://doi.org/10.1016/j.tcs.2010.01.030

    Article  MathSciNet  MATH  Google Scholar 

  13. Ipate, F., Gheorghe, M.: Finite state based testing of P systems. Nat. Comput. 8(4), 833 (2009). https://doi.org/10.1007/s11047-008-9099-3

    Article  MathSciNet  MATH  Google Scholar 

  14. Ipate, F., Gheorghe, M.: Testing non-deterministic stream X-machine models and P systems. Electron. Notes Theor. Comput. Sci. 227, 113–126 (2009). https://doi.org/10.1016/j.entcs.2008.12.107

    Article  MATH  Google Scholar 

  15. Ipate, F., Gheorghe, M., Lefticaru, R.: Test generation from P systems using model checking. J. Log. Algebr. Program. 79(6), 350–362 (2010). https://doi.org/10.1016/j.jlap.2010.03.007

    Article  MathSciNet  MATH  Google Scholar 

  16. Körner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Int. J. Found. Comput. Sci. 14(06), 1071–1086 (2003)

    Article  MathSciNet  Google Scholar 

  17. Lefticaru, R., Gheorghe, M., Ipate, F.: An empirical evaluation of P system testing techniques. Nat. Comput. 10(1), 151–165 (2011). https://doi.org/10.1007/s11047-010-9188-y

    Article  MathSciNet  MATH  Google Scholar 

  18. Păun, G.: Computing with membranes. Technical report, Turku Centre for Computer Science (1998). http://tucs.fi/publications/view/?pub_id=tPaun98a

  19. Păun, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000). https://doi.org/10.1006/jcss.1999.1693

    Article  MathSciNet  MATH  Google Scholar 

  20. The P systems website. http://ppage.psystems.eu. Accessed 12 May 2018

  21. Verlan, S.: Using the formal framework for P systems. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 56–79. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54239-8_6

    Chapter  Google Scholar 

Download references

Acknowledgements

This work is supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-III-P4-ID-PCE-2016-0210.

Author information

Authors and Affiliations

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

    Marian Gheorghe & Raluca Lefticaru

  2. Department of Computer Science, Faculty of Mathematics and Computer Science and ICUB, University of Bucharest, Str. Academiei nr. 14, 010014, Bucharest, Romania

    Florentin Ipate, Raluca Lefticaru & Ana Turlea

Authors
  1. Marian Gheorghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Florentin Ipate
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raluca Lefticaru
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ana Turlea
    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. Friedrich Schiller University Jena, Jena, Germany

    Thomas Hinze

  2. Leiden Centre of Advanced Computer Science (LIACS), Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Center for Computer Science (TUCS), Turku, Finland

    Arto Salomaa

  4. Informatics, Systems and Communication, University of Milano-Bicocca, Milan, Italy

    Claudio Zandron

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gheorghe, M., Ipate, F., Lefticaru, R., Turlea, A. (2019). Testing Identifiable Kernel P Systems Using an X-Machine Approach. In: Hinze, T., Rozenberg, G., Salomaa, A., Zandron, C. (eds) Membrane Computing. CMC 2018. Lecture Notes in Computer Science(), vol 11399. Springer, Cham. https://doi.org/10.1007/978-3-030-12797-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12797-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12796-1

  • Online ISBN: 978-3-030-12797-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation