Towards Automated Verification of P Systems Using Spin

Raluca Lefticaru, Cristina Tudose, Florentin Ipate
2011 International Journal of Natural Computing Research  
This paper presents an approach to P systems verification using the Spin model checker. A tool which implements the proposed approach has been developed and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing high level descriptions of frequently asked questions, formulated in natural language. These properties are
more » ... roperties are automatically translated into LTL specifications for the Promela model and the Spin model checker is run against them. In case a counterexample is received, the Spin trace is decoded and expressed as a P system computation. The tool has been tested on a number of examples and the results obtained are presented in the paper.
doi:10.4018/jncr.2011070101 fatcat:btccfalu2zcajnbakvp65g527i