Testing based on identifiable P Systems using cover automata and X-machines

Abstract

This paper represents a significant advance on the issue of testing for implementations specified by P systems with transformation and communicating rules. Using the X-machine framework and the concept of cover automaton, it devises a testing approach for such systems, that, under well defined conditions, it ensures that the implementation conforms to the specification. It also investigates the issue of identifiability for P systems, that is an essential prerequisite for testing implementations based on such specifications and establishes a fundamental set of properties for identifiable P systems.

Search-based testing in membrane computing

“…So far, P system-based testing has been considered in the context of linking P system models with other computational models benefiting from testing approaches. Cell-like P system testing has been derived from testing methods based on finite state machines [16], stream X-machines [17], mutation testing [18], model checking-based testing [19] and testing identifiable kP systems using X-machines [20,21].…”