A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
As a recently proposed membrane computing model, cP systems are capable of solving computational hard and distributed problems. Although several membrane system variants were formally verified in previous research, none of their approaches was applicable to cP systems. To formally verify the safety and liveness properties of cP systems, we solve a famous NP-Complete problem-the subset sum problem-in cP systems and use the PAT3 and ProB model checkers to verify the cP solution. Our cP solutiondoi:10.1007/s41965-020-00036-0 fatcat:sioznotld5fmrpxxpyqzptrzea