Academic
Publications
Generalized communicating P systems

Generalized communicating P systems,10.1016/j.tcs.2008.04.008,Theoretical Computer Science,Sergey Verlan,Francesco Bernardini,Marian Gheorghe,Maurice

Generalized communicating P systems   (Citations: 7)
BibTex | RIS | RefWorks Download
This paper considers a generalization of various communication models based on the P system paradigm where two objects synchronously move across components. More precisely, the model uses blocks of four cells such that pairs of objects from two input cells travel together to target output cells. It is shown that the model introduced, based on interactions between blocks, is complete, being able to generate all recursively enumerable sets of natural numbers. It is also proven that completeness is achievable by using a minimal interaction between blocks, i.e. every pair of cells is the input or output for at most one block. It is also shown that the concepts introduced in this paper to define the model may be simulated by more particular communication primitives, including symport, antiport and uniport rules. This enables us to automatically translate a system using interaction rules in any of minimal symport, minimal antiport or conditional uniport P systems.
Journal: Theoretical Computer Science - TCS , vol. 404, no. 1-2, pp. 170-184, 2008
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Generalized communicating P systems (Verlan et al. 2008) allow two objects to synchronously move across cells...

    Linmin YangYonget al. Automata and processes on multisets of communicating objects

    • ...The notion of a generalized communicating P system was introduced in [14], with the aim of providing a common generalization of various purely communicating models in the framework of P systems...
    • ...In [14,4] it was proved that eight of the possible nine restricted variants (with respect to the form of rules) are able to generate any recursively enumerable set of numbers; in the ninth case only finite sets of singletons can be obtained...
    • ...Next we recall the basic definitions concerning generalized communicating P systems [14]...
    • ...In [14,4] and it was shown that NOt P∗(anti1) ⊂ NFIN ,...
    • ...M , we define sets of rules, called (primitive) blocks, as it was done in [14,13,4] and then we show how a set of rules simulating the application of an increment instruction or that of a decrement instruction can be constructed from these blocks...

    Erzsébet Csuhaj-Varjúet al. On Generalized Communicating P Systems with One Symbol

    • ...In this subsection we consider P systems with minimal interaction which are a restricted variant of generalized communicating P systems [12]...

    Sergey Verlan. Look-Ahead Evolution for P Systems

    • ...They are motivated by the observation made in [24] that basic forms of coupled transport like symport/antiport can be expressed in terms of two cells synchronizing on certain inputs in order to produce some outputs...
    • ...Moreover, as pointed out in [24], interaction rules of NC’s can express forms of cooperative communication other than symport/antiport or conditional uniport, and the computational power of these forms of communication is not yet fully understood...

    Francesco Bernardiniet al. Networks of Cells and Petri Nets

Sort by: