Loading...
Testing Based on Identifiable P Systems Using Cover Automata and X-Machines
Gheorghe, Marian Ipate, F. Konur, Savas
Gheorghe, Marian
Ipate, F.
Konur, Savas
Publication Date
2016-12-01
End of Embargo
Supervisor
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/)
Peer-Reviewed
Yes
Open Access status
Accepted for publication
2016-08-11
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
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.
Version
Accepted manuscript
Citation
Gheorghe M, Ipate F and Konur S (2016) Testing Based on Identifiable P Systems Using Cover Automata and X-Machines. Information Science. 372: 565-578.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Article