Journal of Computer and System Sciences
Minimal cover-automata for finite languages
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Incremental construction of minimal deterministic finite cover automata
Theoretical Computer Science - Implementation and application of automata
A rewriting logic framework for operational semantics of membrane systems
Theoretical Computer Science
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
On minimizing cover automata for finite languages in O(n log n) time
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Bounded sequence testing from non-deterministic finite state machines
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Testing Non-deterministic Stream X-machine Models and P systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Testing based on P systems - an overview
CMC'10 Proceedings of the 11th international conference on Membrane computing
An empirical evaluation of P system testing techniques
Natural Computing: an international journal
| Hi-index | 0.00 |
In this paper, we propose an approach to P system testing based on finite state machine conformance techniques. Of the many variants of P systems that have been defined, we consider cell-like P systems which use non-cooperative transformation and communication rules. We show that a (minimal) deterministic finite cover automaton (DFCA) (a finite automaton that accepts all words in a given finite language, but can also accept words that are longer than any word in the language) provides the right approximation for the computation of a P system. Furthermore, we provide a procedure for generating test sets directly from the P system specification (without explicitly constructing the minimal DFCA model).