Kernel P systems: from modelling to verification and testing
From MaRDI portal
Publication:2413314
DOI10.1016/j.tcs.2017.12.010zbMath1390.68309OpenAlexW2625132461MaRDI QIDQ2413314
Raluca Lefticaru, Florentin Ipate, Savas Konur, Rodica Ceterchi, Marian Gheorghe
Publication date: 10 April 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10454/11720
Related Items (7)
Formal verification of cP systems using Coq ⋮ A model learning based testing approach for kernel P systems ⋮ Weighted spiking neural P systems with polarizations and anti-spikes ⋮ Formal verification of cP systems using PAT3 and ProB ⋮ Spiking neural P systems: matrix representation and formal verification ⋮ Search-based testing in membrane computing ⋮ Translating Xd-C programs to MSVL programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded sequence testing from deterministic finite state machines
- Computing with membranes
- Membrane computing. An introduction.
- Finite state based testing of P systems
- An Integrated Model Checking Toolset for Kernel P Systems
- A P_Lingua Based Simulator for P Systems with Symport/Antiport Rules
- 3-Col problem modelling using simple kernel P systems
- Polarizationless P Systems with Active Membranes: Computational Complexity Aspects
- Recent complexity-theoretic results on P systems with active membranes
- Testing Software Design Modeled by Finite-State Machines
- On Testing P Systems
- Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- Model Checking Kernel P Systems
- Simulating the Bitonic Sort Using P Systems
- Minimal cover-automata for finite languages
This page was built for publication: Kernel P systems: from modelling to verification and testing
