Back to Search
Start Over
FORMAL VERIFICATION OF P SYSTEMS USING SPIN.
- Source :
- International Journal of Foundations of Computer Science; Jan2011, Vol. 22 Issue 1, p133-142, 10p
- Publication Year :
- 2011
-
Abstract
- This paper presents an approach to P system verification using the Spin model checker. It proposes a P system implementation in PROMELA, the modeling language accepted by SPIN. It also provides the theoretical background for transforming the temporal logic properties expressed for the P system into properties of the executable implementation. Furthermore, a comparison between P systems verification using SPIN and NUSMV is realized. The results obtained show that the PROMELA implementation is more adequate, especially for verifying more complex models, such as P systems that model ecosystems. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 22
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 57512899
- Full Text :
- https://doi.org/10.1142/S0129054111007897