Modularity in p colonies with checking rules

Authors:
Luděk Cienciala;Lucie Ciencialová;Miroslav Langer
Affiliations:
Institute of Computer Science, Silesian University, Opava, Czech Republic;Institute of Computer Science, Silesian University, Opava, Czech Republic;Institute of Computer Science, Silesian University, Opava, Czech Republic
Venue:
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Year:
2011

Citing 7
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Computation: finite and infinite machines

Computation: finite and infinite machines
P Colonies Working in the Maximally Parallel and in the Sequential Mode

SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
The Oxford Handbook of Membrane Computing

The Oxford Handbook of Membrane Computing
On the number of agents in P colonies

WMC'07 Proceedings of the 8th international conference on Membrane computing
P colonies with a bounded number of cells and programs

WMC'06 Proceedings of the 7th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

P colony, which was introduced in [9], is an abstract computing device composed of independent agents, acting and evolving in a shared environment. In this paper we bring a new view to investigation of the behavior of the P colonies. The first part of the paper focuses on the modularity of the P colonies with checking rules. We group the agents into modules with specific function. In the second part of the paper we introduce improved results concerning the computational power of the P colonies with capacity one.