Formal verification of cP systems using Coq

DOI10.1007/s41965-021-00080-4zbMath1490.68100OpenAlexW3193491671MaRDI QIDQ2152300

Jing Sun, Radu Nicolescu, Yezhou Liu

Publication date: 7 July 2022

Published in: Journal of Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41965-021-00080-4

zbMATH Keywords

formal verificationmembrane computingCoqtheorem proverP-systemscP-systems

Mathematics Subject Classification ID

Formalization of mathematics in connection with theorem provers (68V20) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

Programmable and parallel water computing

Uses Software

• Coq
• Rodin
• ProB
• CompCert
• kPWorkbench

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modelling and verification of weighted spiking neural systems
• A sublinear Sudoku solution in cP systems and its formal verification
• Test generation from P systems using model checking
• Tissue P systems.
• Computing with membranes
• An introduction to \(\mathrm{cP}\) systems
• Formal verification of cP systems using PAT3 and ProB
• Solving a PSPACE-complete problem with cP systems
• Spiking neural P systems: matrix representation and formal verification
• Kernel P systems: from modelling to verification and testing
• 3-Col problem modelling using simple kernel P systems
• FORMAL VERIFICATION OF P SYSTEMS USING SPIN
• A Machine-Checked Proof of the Odd Order Theorem
• The Hamiltonian Cycle and Travelling Salesman Problems in cP Systems
• Programming P Systems with Complex Objects
• Fundamentals of Computation Theory

This page was built for publication: Formal verification of cP systems using Coq