Finite state based testing of P systems

DOI10.1007/s11047-008-9099-3zbMath1185.68337OpenAlexW2087671306MaRDI QIDQ2655491

Florentin Ipate, Marian Gheorghe

Publication date: 25 January 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-008-9099-3

zbMATH Keywords

finite automatatest generationP systemsmembrane computingconformance testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (10)

Kernel P systems: from modelling to verification and testing ⋮ A model learning based testing approach for spiking neural P systems ⋮ A model learning based testing approach for kernel P systems ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ Search-based testing in membrane computing ⋮ RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS ⋮ An empirical evaluation of P system testing techniques ⋮ Testing Non-deterministic Stream X-machine Models and P systems ⋮ Test generation from P systems using model checking ⋮ Testing based on identifiable P systems using cover automata and X-machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental construction of minimal deterministic finite cover automata
• A rewriting logic framework for operational semantics of membrane systems
• Computing with membranes
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Bounded Sequence Testing from Non-deterministic Finite State Machines
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages

This page was built for publication: Finite state based testing of P systems