Name
Abstract | ||
|---|---|---|
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. 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 testing machinery able to formalize several features, which are proper of membranes and, as a consequence, worth being highlighted as basic observables for P Systems. The new testing semantics framework inherits from the original one the ability to define qualitative system properties. Moreover, it results to be suitable also to express quantitative aspects, a feature which turns out to be very useful for the biological domain and, at the same time, puts in evidence an expected high expressive power of the framework itself. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | process algebra,automata theory,p system,formal language,membrane computing,equivalence relation |
Field | DocType | Volume |
Discrete mathematics,Equivalence relation,Programming language,Computer science,Algorithm,Input/output,Equivalence (measure theory),Porting,Bisimulation,Black box,Membrane computing,Process calculus | Journal | abs/1108.3424 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Barbuti | 1 | 866 | 81.03 |
| Diletta Romana Cacciagrano | 2 | 16 | 3.22 |
| Andrea Maggiolo-Schettini | 3 | 789 | 89.11 |
| Paolo Milazzo | 4 | 0 | 0.34 |
| Luca Tesei | 5 | 177 | 22.01 |