Advertisement

Natural Computing

, 8:833 | Cite as

Finite state based testing of P systems

  • Florentin Ipate
  • Marian Gheorghe
Article

Abstract

In this paper, we propose an approach to P system testing based on finite state machine conformance techniques. Of the many variants of P systems that have been defined, we consider cell-like P systems which use non-cooperative transformation and communication rules. We show that a (minimal) deterministic finite cover automaton (DFCA) (a finite automaton that accepts all words in a given finite language, but can also accept words that are longer than any word in the language) provides the right approximation for the computation of a P system. Furthermore, we provide a procedure for generating test sets directly from the P system specification (without explicitly constructing the minimal DFCA model).

Keywords

Membrane computing P systems Conformance testing Test generation Finite automata 

Notes

Acknowledgments

The authors would like to thank the anonymous referees for their very helpful comments that allowed the improvement of this paper.

References

  1. Andrei O, Ciobanu G, Lucanu D (2007) A rewriting logic framework for operational semantics of membrane systems. Theoretical Comput Sci 373(3):163–181MATHCrossRefMathSciNetGoogle Scholar
  2. Balanescu T, Gheorghe M, Ipate F (2003) Formal black box testing for partially specified deterministic finite state machines. Found Comp Decision Syst 28(1):17–28MathSciNetGoogle Scholar
  3. Câmpeanu C, Santean N, Yu S (1998) Minimal cover-automata for finite languages. In: Workshop on Implementing Automata. Lecture notes in computer science, vol 1660. Springer, Berlin, pp 43–56Google Scholar
  4. Câmpeanu C, Santean N, Yu S (2001) Minimal cover-automata for finite languages. Theoretical Comput Sci 267(1–2):3–16MATHCrossRefGoogle Scholar
  5. Câmpeanu C, Păun A, Yu S (2002) An efficient algorithm for constructing minimal cover automata for finite languages. Int J Found Comp Sci 13(1):83–97MATHCrossRefGoogle Scholar
  6. Câmpeanu C, Păun A, Smith JR (2006) Incremental construction of minimal deterministic finite cover automata. Theoretical Comput Sci 363(2):135–148MATHCrossRefGoogle Scholar
  7. Chow TS (1978) Testing software design modeled by finite-state machines. IEEE Trans Softw Eng 4(3):178–187CrossRefGoogle Scholar
  8. Ciobanu G, Păun Gh, Pérez-Jiménez MJ (eds) (2006) Applications of membrane computing. Springer, BerlinGoogle Scholar
  9. García P, Jose Ruiz (2004) A note on the minimal cover-automata for finite languages. Bull EATCS 83:193–194MATHGoogle Scholar
  10. Gheorghe M, Ipate F (2008) On testing P systems. In: Proceedings of WMC, pp 173–188Google Scholar
  11. Holcombe H, Ipate F (1998) Correct systems—building business process solutions. Springer, BerlinGoogle Scholar
  12. Hopcroft JE, Motwani R, Ullman JD (2006) Introduction to automata theory, languages, and computation (3rd edition). Addison-Wesley LongmanGoogle Scholar
  13. Ipate F (2006) Bounded sequence testing from non-deterministic finite state machines. In: Proceedings of TesCom 2006, pp 55–70Google Scholar
  14. Ipate F (2008) Bounded sequence testing from deterministic finite state machines (submitted)Google Scholar
  15. Körner H (2002) On minimizing cover automata for finite languages in O(n log n) time. In: CIAA 2002. Lecture notes in computer science, vol 2608. Springer, Berlin, pp 117–127Google Scholar
  16. Körner H (2003) A time and space efficient algorithm for minimizing cover automata for finite languages. Int J Found Comp Sci 14(6):1071–1086Google Scholar
  17. Lee D, Yannakakis M (1996) Principles and methods of testing finite state machines—a survey. In: Proceedings of the IEEE 1996, vol 84, pp 1090–1126Google Scholar
  18. Nilsson R, Offutt J, Mellin J (2006) Test case generation for mutation-based testing of timeliness. Electr Notes Theor Comput Sci 164(4):97–114CrossRefGoogle Scholar
  19. Păun A, Santean N, Yu S (2000) An O(n2) algorithm for constructing minimal cover automata for finite languages. In: CIAA 2000. Lecture notes in computer science, vol 2088. Springer, Berlin, pp 243–251Google Scholar
  20. Păun Gh (2000) Computing with membranes. J Comp System Sci 61(1):108–143MATHCrossRefGoogle Scholar
  21. Păun Gh (2002) Membrane computing. An introduction. Springer, BerlinMATHGoogle Scholar
  22. The P Systems Web Site (2008) http://ppage.psystems.eu

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.Department of Computer ScienceThe University of PitestiPitestiRomania
  2. 2.Department of Computer ScienceThe University of SheffieldSheffieldUK

Personalised recommendations