Journal of Computer and System Sciences
Minimal cover-automata for finite languages
Theoretical Computer Science
Membrane Computing: An Introduction
Membrane Computing: An Introduction
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Test Criteria for Context-Free Grammars
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Applications of Membrane Computing (Natural Computing Series)
Applications of Membrane Computing (Natural Computing Series)
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
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
Structural operational semantics of p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Testing based on P systems - an overview
CMC'10 Proceedings of the 11th international conference on Membrane computing
An integrated approach to P systems formal verification
CMC'10 Proceedings of the 11th international conference on Membrane computing
An empirical evaluation of P system testing techniques
Natural Computing: an international journal
Formal verification and testing based on p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.00 |
This paper presents a basic framework to define testing strategies for some classes of P systems. Techniques based on grammars and finite state machines are developed and some testing criteria are identified and illustrated through simple examples.