Formal verification of cP systems using PAT3 and ProB

DOI10.1007/S41965-020-00036-0MaRDI QIDQ1982961zbMATH OpenOpenAlexFDO

Authors 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

model checkingformal verificationP-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)

Recommendations

• Formal verification of cP systems using Coq
• Model Checking Kernel P Systems
• An integrated approach to P systems formal verification
• An integrated model checking toolset for kernel P systems
• An introduction to cP systems

Cites work

• scientific article; zbMATH DE number 1583879 (Why is no real title available?)
• scientific article; zbMATH DE number 1735632 (Why is no real title available?)
• 3-Col problem modelling using simple kernel P systems
• A Logarithmic Bound for Solving Subset Sum with P Systems
• A simulation algorithm for multienvironment probabilistic P systems: a formal verification
• Actor-like cP systems
• An introduction to cP systems
• Computing with membranes
• FORMAL VERIFICATION OF P SYSTEMS USING SPIN
• Kernel P systems: from modelling to verification and testing
• Membrane Computing
• Membrane Computing
• Modelling and verification of weighted spiking neural systems
• Most common words -- a cP systems solution
• On the decidability of model-checking for P systems
• P systems based computing polynomials: design and formal verification
• Programming P Systems with Complex Objects
• Solving Numerical NP-Complete Problems with Spiking Neural P Systems
• Solving the subset-problem by P systems with active membrans
• Spiking neural P systems
• Test generation from P systems using model checking
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• Tissue P systems.
• Unconventional Computation
• Verification of membrane systems with delays via Petri nets with delays

Cited in

(15)

• 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
• An integrated approach to P systems formal verification
• scientific article; zbMATH DE number 6719346 (Why is no real title available?)
• Programmable and parallel water computing
• Verification of \(\mathrm{EB}^3\) specifications using CADP
• An introduction to cP systems
• Towards automated deduction in cP systems
• Solving a PSPACE-complete problem with cP systems
• FORMAL VERIFICATION OF P SYSTEMS USING SPIN
• Formal verification of P systems with active membranes through model checking
• 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
• scientific article; zbMATH DE number 177271 (Why is no real title available?)

Describes a project that uses

Uses Software

• P-Lingua
• PAT
• ProB

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)