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.