Formal verification of cP systems using Coq

P systems are widely used to solve computationally hard problems. In this study, we formally verify cP systems (P systems with complex objects) in the Coq proof assistant, and provide a corresponding open source library. To help transform cP notation into Gallina, we propose two sets of modelling gu...

Full description

Saved in:
Bibliographic Details
Published inJournal of membrane computing Vol. 3; no. 3; pp. 205 - 220
Main Authors Liu, Yezhou, Nicolescu, Radu, Sun, Jing
Format Journal Article
LanguageEnglish
Published Singapore Springer Singapore 01.09.2021
Subjects
Artificial Intelligence
Computation by Abstract Devices
Computational Biology/Bioinformatics
Computer Science
Optimization
Regular Paper
Theory of Computation
Membrane computing
P systems
Coq
cP systems
Formal verification
Theorem prover
Online AccessGet full text

Cover

More Information
Summary:P systems are widely used to solve computationally hard problems. In this study, we formally verify cP systems (P systems with complex objects) in the Coq proof assistant, and provide a corresponding open source library. To help transform cP notation into Gallina, we propose two sets of modelling guidelines. Comparing to existing P system formal verification studies, our approach shows many advantages and has great potential. To the best of our knowledge, this is the first study to formally verify membrane computing models using an interactive theorem prover.
ISSN:2523-8906
2523-8914
DOI:10.1007/s41965-021-00080-4