Return to search

Testing Based on Identifiable P Systems Using Cover Automata and X-Machines

Yes / This paper represents a significant advance on the issue of testing for implementations specified by P systems with transformation and communicating rules. Using the X-machine framework and the concept of cover automaton, it devises a testing approach for such systems, that, under well defined conditions, it ensures that the implementation conforms to the specification. It also investigates the issue of identifiability for P systems, that is an essential prerequisite for testing implementations based on such specifications and establishes a fundamental set of properties for identifiable P systems. / Marian Gheorghe and Savas Konur acknowledge the support from EPSRC (EP/I031812/1). Marian Gheorghe’s and Florentin Ipate’s work is partially supported by CNCS-UEFISCDI (PN-II-ID-PCE-2011-3-0688).

Identiferoai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/8905
Date20 August 2016
CreatorsGheorghe, Marian, Ipate, F., Konur, Savas
Source SetsBradford Scholars
LanguageEnglish
Detected LanguageEnglish
TypeArticle, Accepted manuscript
Rights© 2016 Elsevier, Inc. Reproduced in accordance with the publisher's self-archiving policy. This manuscript version is made available under the CC-BY-NC-ND 4.0 license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Page generated in 0.0017 seconds