Finite state based testing of P systems

摘要: In this paper, we propose an approach to P system testing based on finite state machine conformance techniques. Of the many variants of systems that have been defined, consider cell-like which use non-cooperative transformation and communication rules. We show a (minimal) deterministic cover automaton (DFCA) (a accepts all words in given language, but can also accept are longer than any word language) provides right approximation for computation system. Furthermore, provide procedure generating test sets directly from specification (without explicitly constructing minimal DFCA model).