On Testing P Systems
From MaRDI portal
Recommendations
Cites work
- A rewriting logic framework for operational semantics of membrane systems
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
- An O(n^2) algorithm for constructing minimal cover automata for finite languages
- AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
- Complexity of automaton identification from given data
- Computing with membranes
- Correct systems. Building a business process solution
- Grammar testing
- Incremental construction of minimal deterministic finite cover automata
- Membrane Computing
- Minimal cover-automata for finite languages
- Minimal cover-automata for finite languages
- On minimizing cover automata for finite languages in O(n n) time
Cited in
(13)- Search-based testing in membrane computing
- Testing based on identifiable P systems using cover automata and X-machines
- Testing identifiable kernel P systems using an X-machine approach
- Kernel P systems: from modelling to verification and testing
- Finite state based testing of P systems
- A model learning based testing approach for spiking neural P systems
- Kernel P systems modelling, testing and verification -- sorting case study
- scientific article; zbMATH DE number 1890601 (Why is no real title available?)
- From P systems to software systems by design patterns
- An empirical evaluation of P system testing techniques
- scientific article; zbMATH DE number 5663588 (Why is no real title available?)
- A model learning based testing approach for kernel P systems
- Test generation from P systems using model checking
This page was built for publication: On Testing P Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191169)