Results 1  10
of
323
LETTER Communicated by Gheorghe Paun Simple NeuralLike P Systems for Maximal Independent Set Selection
"... Membrane systems (P systems) are distributed computing models inspired by living cells where a collection of processors jointly achieves a computing task. The problem of maximal independent set (MIS) selection in a graph is to choose a set of nonadjacent nodes towhich no further nodes can be added ..."
Abstract
 Add to MetaCart
Membrane systems (P systems) are distributed computing models inspired by living cells where a collection of processors jointly achieves a computing task. The problem of maximal independent set (MIS) selection in a graph is to choose a set of nonadjacent nodes towhich no further nodes can be added. In this letter, we design a class of simple neurallike P systems to solve the MIS selection problem efficiently in a distributed way. This new class of systems possesses two features that are attractive for both distributed computing and membrane computing: first, the individual processors do not need any information about the overall size of the graph; second, they communicate using only onebit messages. 1
Computing with Membranes
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 1998
"... We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several celllike membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected se ..."
Abstract

Cited by 425 (4 self)
 Add to MetaCart
We introduce a new computability model, of a distributed parallel type, based on the notion of a membrane structure. Such a structure consists of several celllike membranes, recurrently placed inside a unique "skin" membrane. A plane representation is a Venn diagram without intersected sets and with a unique superset. In the regions delimited by the membranes there are placed objects; the obtained construct is called a supercell. These objects are assumed to evolve: each object can be transformed in other objects, can pas through a membrane, or can disolve the membrane in which it is placed. A priority relation between evolution rules can be considered. The evolution is done in parallel for all objects able to evolve. In this way, we obtain a computing device (we call it a supercell system): start with a certain number of objects in a certain membrane and let the system evolve; if it will halt (no object can further evolve), then the computation is finished, with the result given as...
Encoding Catalytic P Systems in
"... Email: versari (at) cs.unibo.it Abstract P systems are theoretical computing devices abstracted away from the biological architecture of the cell, introduced some years ago by Gheorghe P*aun and now intensely studied. In the area of concurrent systems, process calculi have recently been applied and ..."
Abstract
 Add to MetaCart
Email: versari (at) cs.unibo.it Abstract P systems are theoretical computing devices abstracted away from the biological architecture of the cell, introduced some years ago by Gheorghe P*aun and now intensely studied. In the area of concurrent systems, process calculi have recently been applied
Bond Computing Systems: a Biologically Inspired and Highlevel Dynamics Model for Pervasive Computing ⋆
"... Abstract. Targeting at modeling the highlevel dynamics of pervasive computing systems, we introduce Bond Computing Systems (BCS) consisting of objects, bonds and rules. Objects are typed but addressless representations of physical or logical (computing and communicating) entities. Bonds are typed m ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
multisets of objects. In a BCS, a configuration is specified by a multiset of bonds, called a collection. Rules specify how a collection evolves to a new one. A BCS is a variation of a P system introduced by Gheorghe Paun where, roughly, there is no maximal parallelism but with typed and unbounded number
On Two Variants of Splicing SuperCell Systems
 Workshop on Multiset Processing, Curtea de Arges
, 2000
"... . New computability models, called supercell systems or P systems, based on the evolution of objects in a membrane structure, were recently introduced. The seminal paper of Gheorghe Paun describes three ways to look at them: transition, rewriting and splicing supercell systems having different ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. New computability models, called supercell systems or P systems, based on the evolution of objects in a membrane structure, were recently introduced. The seminal paper of Gheorghe Paun describes three ways to look at them: transition, rewriting and splicing supercell systems having
Automata on Multisets of Communicating Objects
"... Abstract. Inspired by P systems initiated by Gheorghe Paun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called service au ..."
Abstract
 Add to MetaCart
Abstract. Inspired by P systems initiated by Gheorghe Paun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called service
Automata and Processes on Multisets of Communicating Objects
"... Abstract. Inspired by P systems initiated by Gheorghe Pãun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called a service ..."
Abstract
 Add to MetaCart
Abstract. Inspired by P systems initiated by Gheorghe Pãun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two objects. Our model, called a service
Paun: On the power of a biochemically inspired simple computing model: P colonies. Downloadable version at
"... Abstract. The contribution proposes and briefly investigates a class of abstract computing devices composed from as simple as possible agents acting and evolving in a shared environment. The device is of a type similar to the socalled tissue P systems known in the field of membrane computing, but w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The contribution proposes and briefly investigates a class of abstract computing devices composed from as simple as possible agents acting and evolving in a shared environment. The device is of a type similar to the socalled tissue P systems known in the field of membrane computing, but with the cell components being of a very simple form. Moreover, we suppose no direct communication among our agents, while the environment is completely uniform (only one kind of symbols is present in the beginning). Still, in this extremely weak framework we prove that our computing device is able to compute whatever a Turing machine can do which shows once again the power of cooperation, the great jump from individual competences of simple agents to the emergent competence of a society of cooperating agents.
Impact Factor of 4.260
, 2012
"... [7] C.I. Vasile, A.B. Pavel, I. Dumitrache, G. Paun. On the power of enzymatic numerical P systems. Acta ..."
Abstract
 Add to MetaCart
[7] C.I. Vasile, A.B. Pavel, I. Dumitrache, G. Paun. On the power of enzymatic numerical P systems. Acta
Results 1  10
of
323