cPV - Simulation and Verification for Membrane Computing

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As a newly proposed computational paradigm of membrane computing, cP systems are used to solve several NP-complete and PSPACE-complete problems in linear or sub-linear time theoretically. Most cP systems proposed in previous studies lack of automated verification support. In this paper, we present cPV, the first software implementation for cP system simulation and verification. cPV offers multiple features, which include modelling, simulation, automated verification of properties such as absence of deadlock, confluence, termination, determinism, and goal reachability. As an extensible framework, modules in cPV are loosely coupled, where new verification algorithms, reduction techniques, and property specifications can be easily extended. To evaluate cPV, we constructed two benchmark datasets that cover several important aspects of cP systems. The experimental results demonstrated effective automatic verification support to the membrane computing problem domain.

Cite

CITATION STYLE

APA

Liu, Y., Sun, J., Nicolescu, R., & Wang, H. (2022). cPV - Simulation and Verification for Membrane Computing. In IEEE International Conference on Software Quality, Reliability and Security, QRS (Vol. 2022-December, pp. 606–615). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/QRS57517.2022.00067

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free