Skip to main content

On Testing P Systems

  • Conference paper
Membrane Computing (WMC 2008)

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

Included in the following conference series:

Abstract

This paper presents a basic framework to define testing strategies for some classes of P systems. Techniques based on grammars and finite state machines are developed and some testing criteria are identified and illustrated through simple examples.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrei, O., Ciobanu, G., Lucanu, D.: Structural operational semantics of P systems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 31–48. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Andrei, O., Ciobanu, G., Lucanu, D.: A rewriting logic framework for operational semantics of membrane systems. Theoretical Computer Sci. 373, 163–181 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Câmpeanu, C., Păun, A., Smith, J.R.: Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Sci. 363, 135–148 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Câmpeanu, C., Păun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Intern. J. Foundation of Computer Sci. 13, 83–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. In: Champarnaud, J.-M., Maurel, D., Ziadi, D. (eds.) WIA 1998. LNCS, vol. 1660, pp. 43–56. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theoretical Computer Sci. 267, 3–16 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds.): Applications of Membrane Computing. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  8. García, P., Ruiz, J.: A note on the minimal cover-automata for finite languages. Bulletin of the EATCS 83, 193–194 (2004)

    MathSciNet  MATH  Google Scholar 

  9. Gold, M.E.: Complexity of automaton identification from given data. Information and Control 37, 302–320 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  10. Holcombe, M., Ipate, F.: Correct Systems – Building Business Process Solutions. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Körner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Intern. J. Foundation of Computer Sci. 14, 1071–1086 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lämmel, R.: Grammar testing. In: Hussmann, H. (ed.) FASE 2001. LNCS, vol. 2029, pp. 201–216. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Li, H., Jin, M., Liu, C., Gao, Z.: Test criteria for context-free grammars. COMPSAC 1, 300–305 (2004)

    Google Scholar 

  15. Oncina, J., García, P.: Inferring regular languages in polynomial update time. In: de la Blanca, N.P., Sanfeliu, A., Vidal, E. (eds.) Pattern Recognition and Image Qnalysis, pp. 49–61. World Scientific, Singapore (1992)

    Chapter  Google Scholar 

  16. Păun, A., Sântean, N., Yu, S.: An O(n\(^{\mbox{2}}\)) algorithm for constructing minimal cover automata for finite languages. In: Yu, S., Păun, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 243–251. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Păun, G.: Computing with membranes. J. Computer and System Sci. 61, 108–143 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  19. The P Systems Web Site, http://ppage.psystems.eu

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gheorghe, M., Ipate, F. (2009). On Testing P Systems. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2008. Lecture Notes in Computer Science, vol 5391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95885-7_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95885-7_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95884-0

  • Online ISBN: 978-3-540-95885-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics