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

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.

[1]  Marian Gheorghe,et al.  Finite state based testing of P systems , 2008, Natural Computing.

[2]  Sheng Yu,et al.  Minimal cover-automata for finite languages , 2001, Theor. Comput. Sci..

[3]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[4]  Rodica Ceterchi,et al.  Dynamic P Systems , 2002, WMC-CdeA.

[5]  Rodica Ceterchi,et al.  Sorting Omega Networks Simulated with P Systems: Optimal Data Layouts , 2008 .

[6]  Rudolf Freund,et al.  A Formal Framework for Static (Tissue) P Systems , 2007, Workshop on Membrane Computing.

[7]  Rodica Ceterchi,et al.  Implementing Sorting Networks with Spiking Neural P Systems , 2008, Fundam. Informaticae.

[8]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[9]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..

[10]  Marian Gheorghe,et al.  3-Col problem modelling using simple kernel P systems , 2013, Int. J. Comput. Math..

[11]  Joshua J. Arulanandham Implementing Bead-Sort with P Systems , 2002, UMC.

[12]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[13]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

[14]  Marian Gheorghe,et al.  On Testing P Systems , 2008, Workshop on Membrane Computing.

[15]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[16]  Florentin Ipate Bounded sequence testing from deterministic finite state machines , 2010, Theor. Comput. Sci..

[17]  Marian Gheorghe,et al.  An Integrated Model Checking Toolset for Kernel P Systems , 2015, Int. Conf. on Membrane Computing.

[18]  Artiom Alhazov,et al.  Static Sorting P Systems , 2006, Applications of Membrane Computing.

[19]  Marian Gheorghe,et al.  Research Frontiers of membrane Computing: Open Problems and Research Topics , 2013, Int. J. Found. Comput. Sci..

[20]  Sheng Yu,et al.  Minimal cover-automata for finite languages , 1998, Theor. Comput. Sci..

[21]  Heiko Körner,et al.  On minimizing cover automata for finite languages in O(n log n) time , 2002, CIAA'02.

[22]  Rudolf Freund,et al.  A formalization of membrane systems with dynamically evolving structures , 2013, Int. J. Comput. Math..

[23]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[24]  Rodica Ceterchi,et al.  Simulating the Bitonic Sort Using P Systems , 2007, Workshop on Membrane Computing.