Formal verification of P systems using Spin. (English) Zbl 1213.68273
Summary: 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.
MSC:
| 68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |
| 68Q05 | Models of computation (Turing machines, etc.) (MSC2010) |
| 68Q60 | Specification and verification (program logics, model checking, etc.) |
References:
| [1] | Ben-Ari M., Principles of the SPIN Model Checker (2008) · Zbl 1142.68044 |
| [2] | DOI: 10.1007/s100090050046 · Zbl 1059.68582 · doi:10.1007/s100090050046 |
| [3] | Ciobanu G., Natural Computing Series, in: Applications of Membrane Computing (2006) |
| [4] | Clarke E. M., Model checking (1999) |
| [5] | Dang Z., J. Automata, Lang. Combinatorics 11 pp 279– |
| [6] | DOI: 10.1016/j.jlap.2010.03.007 · Zbl 1208.68146 · doi:10.1016/j.jlap.2010.03.007 |
| [7] | DOI: 10.1006/jcss.1999.1693 · Zbl 0956.68055 · doi:10.1006/jcss.1999.1693 |
| [8] | DOI: 10.1007/978-3-642-56196-2 · doi:10.1007/978-3-642-56196-2 |
| [9] | DOI: 10.1007/978-3-642-11467-0 · Zbl 1179.68004 · doi:10.1007/978-3-642-11467-0 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
