Add to ORKGThe aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating X-machine model is presented and a variation of temporal logic for X-machines is briefly discussed, which facilitates model checking of desired properties of the system. Finally, the benefits resulting from the transformation are discussed
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. In this paper we give a complete formalization of a new computability model of a distribut...
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and para...
Abstract. A X-machine is a general computational machine that can model non-trivial data structures ...
The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-mac...
This paper presents a new model for the specification of communicating X-machine systems (CXMS). In ...
Membrane systems are computational equivalent to Turing machines. However, their distributed and mas...
Membrane Computing (or P-System theory) is a recent area of Natural Computing, the field of computer...
Abstract. We introduce a new model of membrane computing system (or P system), called signaling P sy...
Abstract: H systems are DNA computing models, based on the operation of splicing. P systems are memb...
Multi-agent systems are highly dynamic since the agents ’ abilities and the system configuration oft...
In this paper we give a complete formalization of a new computability model of a distributed paralle...
Abstract. The X-machine formal method forms the basis for a specifi-cation/modeling language with a ...
Membrane systems, also known as P systems, constitute an innovative computational paradigm inspired ...
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. In this paper we give a complete formalization of a new computability model of a distribut...
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and para...
Abstract. A X-machine is a general computational machine that can model non-trivial data structures ...
The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-mac...
This paper presents a new model for the specification of communicating X-machine systems (CXMS). In ...
Membrane systems are computational equivalent to Turing machines. However, their distributed and mas...
Membrane Computing (or P-System theory) is a recent area of Natural Computing, the field of computer...
Abstract. We introduce a new model of membrane computing system (or P system), called signaling P sy...
Abstract: H systems are DNA computing models, based on the operation of splicing. P systems are memb...
Multi-agent systems are highly dynamic since the agents ’ abilities and the system configuration oft...
In this paper we give a complete formalization of a new computability model of a distributed paralle...
Abstract. The X-machine formal method forms the basis for a specifi-cation/modeling language with a ...
Membrane systems, also known as P systems, constitute an innovative computational paradigm inspired ...
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. In this paper we give a complete formalization of a new computability model of a distribut...