Formal verification of cP systems using PAT3 and ProB

DOI10.1007/s41965-020-00036-0zbMath1469.68046OpenAlexW3013001290MaRDI QIDQ1982961

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

zbMATH Keywords

formal verificationmodel checkingP-systemssubset sum problemcP-systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (8)

A sublinear Sudoku solution in cP systems and its formal verification ⋮ Formal verification of cP systems using Coq ⋮ Spiking neural P systems with a flat maximally parallel use of rules ⋮ Sublinear P system solutions to NP-complete problems ⋮ Towards automated deduction in cP systems ⋮ Programmable and parallel water computing ⋮ Solving a PSPACE-complete problem with cP systems ⋮ Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons

Uses Software

• ProB
• PAT
• P-Lingua

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modelling and verification of weighted spiking neural systems
• Verification of membrane systems with delays via Petri nets with delays
• Test generation from P systems using model checking
• Tissue P systems.
• Computing with membranes
• An introduction to \(\mathrm{cP}\) systems
• 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
• Solving the subset-problem by P systems with active membrans
• 3-Col problem modelling using simple kernel P systems
• A SIMULATION ALGORITHM FOR MULTIENVIRONMENT PROBABILISTIC P SYSTEMS: A FORMAL VERIFICATION
• FORMAL VERIFICATION OF P SYSTEMS USING SPIN
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• Programming P Systems with Complex Objects
• A Logarithmic Bound for Solving Subset Sum with P Systems
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Unconventional Computation
• Membrane Computing
• Membrane Computing

This page was built for publication: Formal verification of cP systems using PAT3 and ProB