Yes / Kernel P systems have been introduced as a unifying formalism allowing to specify, simulate and analyse various problems. Several applications of this
model have been considered and a powerful tool built in order to support their development and analysis. Testing represents an important aspect of any system analysis and correctness. In this paper we introduce for the first time a bounded test generation approach for kernel P systems by considering bounded input sequences. A learning algorithm for kernel P systems is based on learning X-machine models that are equivalent to these systems for sequences of steps up to a certain limit, ℓ. The Lℓ learning algorithm is used.
The testing approach is then devised from the inferred X-machines. The method is applied to a case study illustrating the key parts of the approach. / This research was supported by the European Regional Development Fund, Competitiveness Operational Program 2014-2020 through project IDBC (code SMIS 2014+: 121512). Raluca Lefticaru, Savas Konur and Marian Gheorghe have been partially supported by the Royal Society grant IES╲R3╲213176, 2022-2024. The work of Savas Konur is also supported by EPSRC (EP/R043787/1).
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/19460 |
| Date | 02 June 2023 |
| Creators | Ipate, F., Niculescu, I., Lefticaru, Raluca, Konur, Savas, Gheorghe, Marian |
| Publisher | Elsevier |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Article, Published version |
| Rights | © 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)., CC-BY |
Page generated in 0.0016 seconds