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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Andrei, O., Ciobanu, G., Lucanu, D.: A rewriting logic framework for operational semantics of membrane systems. Theoretical Computer Sci. 373, 163–181 (2007)
Câmpeanu, C., Păun, A., Smith, J.R.: Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Sci. 363, 135–148 (2006)
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)
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)
Câmpeanu, C., Sântean, N., Yu, S.: Minimal cover-automata for finite languages. Theoretical Computer Sci. 267, 3–16 (2002)
Ciobanu, G., Păun, G., Pérez-Jiménez, M.J. (eds.): Applications of Membrane Computing. Springer, Heidelberg (2006)
García, P., Ruiz, J.: A note on the minimal cover-automata for finite languages. Bulletin of the EATCS 83, 193–194 (2004)
Gold, M.E.: Complexity of automaton identification from given data. Information and Control 37, 302–320 (1978)
Holcombe, M., Ipate, F.: Correct Systems – Building Business Process Solutions. Springer, Heidelberg (1998)
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)
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)
Lämmel, R.: Grammar testing. In: Hussmann, H. (ed.) FASE 2001. LNCS, vol. 2029, pp. 201–216. Springer, Heidelberg (2001)
Li, H., Jin, M., Liu, C., Gao, Z.: Test criteria for context-free grammars. COMPSAC 1, 300–305 (2004)
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)
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)
Păun, G.: Computing with membranes. J. Computer and System Sci. 61, 108–143 (2000)
Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)
The P Systems Web Site, http://ppage.psystems.eu
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)