Deterministic stream X-machines based on grammar systems

نویسندگان

  • Tudor Balanescu
  • Marian Gheorghe
  • Mike Holcombe
چکیده

This paper investigates the power of the stream X machines ba sed on cooperating distributed grammar systems which replaces relations by functions The case of regular rules is considered The deterministic case is introduced in order to allow the application of some already deve loped testing strategies Some conditions for getting equivalent stream X machines in the derivation mode are studied

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Stream X - machinesBased on Grammar

This paper investigates the power of the stream X-machines based on cooperating distributed grammar systems which replaces relations by functions. The case of regular rules is considered. The deterministic case is introduced in order to allow the application of some already developed testing strategies. Some conditions for getting equivalent stream X-machines in the = 1 derivation mode are stud...

متن کامل

Generalized Stream X- machines and Cooperating Distributed Grammar Systems

Stream X-machines are a general and powerful computational model. By coupling the control structure of a stream X-machine with a set of formal grammars a new machine called generalized stream X-machine with underlying distributed grammars, acting as a translator, is obtained. By introducing this new mechanism a hierarchy of computational models is provided. If the grammars are of a particular c...

متن کامل

A Subclass of Stream X machines with Underlying Distributed Grammars

The paper further investigates the properties of the stream X machines based on cooperating distributed grammar systems It is addres sed the case of regular components with various derivation modes and with derivation processes expressed by functions It is shown that in this case the translation power decreases but non context free languages still may be obtained from regular languages even for...

متن کامل

Testing conformance of a deterministic implementation against a non-deterministic stream X-machine

Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which produces a test that is guaranteed to determine correctness under certain design for test conditions. This test generation algorithm has recently b...

متن کامل

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

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, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001