Formal verification of cP systems using PAT3 and ProB
From MaRDI portal
Publication:1982961
DOI10.1007/S41965-020-00036-0zbMATH Open1469.68046OpenAlexW3013001290MaRDI QIDQ1982961FDOQ1982961
Yezhou Liu, Radu Nicolescu, Jing Sun
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-020-00036-0
Specification and verification (program logics, model checking, etc.) (68Q60) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing with membranes
- Tissue P systems.
- Modelling and verification of weighted spiking neural systems
- Verification of membrane systems with delays via Petri nets with delays
- Solving Numerical NP-Complete Problems with Spiking Neural P Systems
- 3-Col problem modelling using simple kernel P systems
- Membrane Computing
- Membrane Computing
- A Logarithmic Bound for Solving Subset Sum with P Systems
- An introduction to \(\mathrm{cP}\) systems
- The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
- Programming P Systems with Complex Objects
- Solving the subset-problem by P systems with active membrans
- Test generation from P systems using model checking
- Most common words -- a cP systems solution
- P systems based computing polynomials: design and formal verification
- Actor-like cP systems
- Kernel P systems: from modelling to verification and testing
- A SIMULATION ALGORITHM FOR MULTIENVIRONMENT PROBABILISTIC P SYSTEMS: A FORMAL VERIFICATION
- FORMAL VERIFICATION OF P SYSTEMS USING SPIN
- Unconventional Computation
Cited In (12)
- A sublinear Sudoku solution in cP systems and its formal verification
- Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons
- Title not available (Why is that?)
- Programmable and parallel water computing
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Towards automated deduction in cP systems
- Solving a PSPACE-complete problem with cP systems
- FORMAL VERIFICATION OF P SYSTEMS USING SPIN
- Formal verification of cP systems using Coq
- Sublinear P system solutions to NP-complete problems
- Spiking neural P systems with a flat maximally parallel use of rules
- Title not available (Why is that?)
Uses Software
This page was built for publication: Formal verification of cP systems using PAT3 and ProB
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982961)
