Testing Non-deterministic Stream X-machine Models and P systems | Zendy

Florentin Ipate | Zendy; Marian Gheorghe | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Testing Non-deterministic Stream X-machine Models and P systems

Author(s) -

Florentin Ipate,

Marian Gheorghe

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.107

Subject(s) - correctness , computer science , equivalence (formal languages) , computation , set (abstract data type) , algorithm , conformance testing , tree (set theory) , relation (database) , function (biology) , equivalence relation , theoretical computer science , programming language , mathematics , data mining , discrete mathematics , mathematical analysis , evolutionary biology , biology , standardization , operating system

Under certain well defined conditions, the stream X-machine testing method can produce a test set that is guaranteed to determine the correctness of an implementation. The testing method has originally assumed that an implementation of each processing function or relation is proven to be correct before the actual testing can take place. Such a limitation has been removed in a subsequent paper, but only for deterministic X-machines. This paper extends this result to non-deterministic stream X-machines and considers a conformance relationship between a specification and an implementation, rather than mere equivalence. Furthermore, it shows how this method can be applied to test a P system by building a suitable stream X-machine from the derivation tree associated with a partial computation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research