All the rights to the paper remain with the authors. A Testing Framework for P Systems

Testing equivalence was originally defined by De Nicola and Hennessy in a process algebraic set-ting (CCS) with the aim of defining an equivalence relation between processes being less discrim-inating than bisimulation and with a natural interpretation in the practice of system development. Finite characterizations of the defined preorders and relations led to the possibility of verification by comparing an implementation with a specification in a setting where systems were seen as black boxes with input and output capabilities, thus neglecting internal undetectable behaviours. In this paper, we start defining a porting of the well-established testing theory into membrane computing, in order to investigate possible benefits in terms of inherited analysis/verification tech-niques and interesting biological applications. P Algebra, a process algebra for describing P Systems, is used as a natural candidate for the porting since it enjoys the desirable property of being composi-tional and comes with other observational equivalences already defined and studied. We consider P Systems with multiple membranes, dissolution, promoters and inhibitors. Notions as observable and test are conveniently rephrased in the membrane scenario, where they lack as native notions and have a not so obvious mean. At the same time, concepts as promoters, inhibitors, membrane inclusion and dissolution are emphasized and exploited in the attempt of realizing a testin