The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the parallel behaviour of the regions of a P system is simulated by a sequential process involving a single X-machine. This allows the application of the X-machine testing procedures in order to prove the correctness of P systems. In the second approach, a P system is simulated by a communicating system of X-machines. Each component of such a system is an X-machine associated with a region of the given P system. The components act in parallel, as their counterparts do in a P system, and use some specific mechanism for communication and synchronisation
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
YesThis paper represents a significant advance on the issue of testing for implementations specified...
The class of parallel rewriting systems is considered in this work, and the interaction between two ...
The aim of this paper is to prove the suitability of a parallel distributed computational model, com...
The paper is about some families of rewriting P systems, where the application of evolution rules i...
We consider rewriting P systems with parallel application of evolution rules, where no conflicts on ...
This paper presents a new model for the specification of communicating X-machine systems (CXMS). In ...
Various approaches have been proposed to the problem of assembling X-machines (also known as Eilenbe...
A version of the communicating stream X-machine model is proposed, which gives a precise representat...
Abstract. A X-machine is a general computational machine that can model non-trivial data structures ...
We continue the investigation of parallel rewriting P systems without target conflicts, a class of ...
A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions...
We analyze P systems with different parallel methods for string rewriting. The notion of deadlock st...
The so-called family of finite copying parallel rewriting systems is considered in this work, includ...
Rewriting P systems with parallel application of evolution rules, as defined in Besozzi et al. [Para...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
YesThis paper represents a significant advance on the issue of testing for implementations specified...
The class of parallel rewriting systems is considered in this work, and the interaction between two ...
The aim of this paper is to prove the suitability of a parallel distributed computational model, com...
The paper is about some families of rewriting P systems, where the application of evolution rules i...
We consider rewriting P systems with parallel application of evolution rules, where no conflicts on ...
This paper presents a new model for the specification of communicating X-machine systems (CXMS). In ...
Various approaches have been proposed to the problem of assembling X-machines (also known as Eilenbe...
A version of the communicating stream X-machine model is proposed, which gives a precise representat...
Abstract. A X-machine is a general computational machine that can model non-trivial data structures ...
We continue the investigation of parallel rewriting P systems without target conflicts, a class of ...
A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions...
We analyze P systems with different parallel methods for string rewriting. The notion of deadlock st...
The so-called family of finite copying parallel rewriting systems is considered in this work, includ...
Rewriting P systems with parallel application of evolution rules, as defined in Besozzi et al. [Para...
Several abstract models of fine-grained parallelism, suited to symbolic programming languages, are s...
YesThis paper represents a significant advance on the issue of testing for implementations specified...
The class of parallel rewriting systems is considered in this work, and the interaction between two ...