A Testing Framework for P Systems

Testing equivalence was originally defined by De Nicola and Hennessy in a process algebraic setting (CCS) with the aim of defining an equivalence relation between processes being less discriminating 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 techniques 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 compositional and comes with other observational equivalences already defined and studied.

[1]  Marian Gheorghe,et al.  P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines) , 2002, Fundam. Informaticae.

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

[3]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[4]  Marian Gheorghe,et al.  Testing Non-deterministic Stream X-machine Models and P systems , 2008, MeCBIC.

[5]  Gheorghe Paun,et al.  A guide to membrane computing , 2002, Theor. Comput. Sci..

[6]  Artiom Alhazov,et al.  Membrane Computing , 2013, Lecture Notes in Computer Science.

[7]  Marian Gheorghe,et al.  Test generation from P systems using model checking , 2010, J. Log. Algebraic Methods Program..

[8]  Rance Cleaveland,et al.  Divergence and Fair Testing , 1995, ICALP.

[9]  Oscar H. Ibarra,et al.  On the Decidability of Model-Checking for P Systems , 2006, J. Autom. Lang. Comb..

[10]  Florentin Ipate,et al.  Formal Verification of P Systems Using Spin , 2011, Int. J. Found. Comput. Sci..

[11]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[12]  Carlos Martín-Vide,et al.  Membrane systems with promoters/inhibitors , 2002, Acta Informatica.

[13]  Gheorghe Paun,et al.  Applications of Membrane Computing (Natural Computing Series) , 2005 .

[14]  Koen Martens,et al.  Lost sex : the evolutionary biology of parthenogenesis , 2009 .

[15]  Paolo Milazzo,et al.  A Notion of Biological Diagnosability Inspired by the Notion of Opacity in Systems Security , 2010, Fundam. Informaticae.

[16]  Paolo Milazzo,et al.  Spatial P systems , 2010, Natural Computing.

[17]  Vincenzo Manca,et al.  Encoding-Decoding Transitional Systems for Classes of P Systems , 2005, Workshop on Membrane Computing.

[18]  Rocco De Nicola,et al.  Basic Observables for Processes , 1997, ICALP.

[19]  Marian Gheorghe,et al.  Testing Based on P Systems - An Overview , 2010, Int. Conf. on Membrane Computing.

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

[21]  Gabriel Ciobanu,et al.  A rewriting logic framework for operational semantics of membrane systems , 2007, Theor. Comput. Sci..

[22]  Paolo Milazzo,et al.  Compositional semantics and behavioral equivalences for P Systems , 2008, Theor. Comput. Sci..

[23]  Didier Lime,et al.  Hybrid Modelling and Dynamical Analysis of Gene Regulatory Networks with Delays , 2007, Complexus.

[24]  Paolo Milazzo,et al.  A P Systems Flat Form Preserving Step-by-step Behaviour , 2008, Fundam. Informaticae.