Modularity in P Colonies with Checking Rules
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F12%3A%230004060" target="_blank" >RIV/47813059:19240/12:#0004060 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Modularity in P Colonies with Checking Rules
Original language description
P colony 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GP201%2F09%2FP075" target="_blank" >GP201/09/P075: Membrane systems and their applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
12. Název sborníku v původním jazyce Membrane Computing - 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers
ISBN
978-3-642-28023-8
ISSN
0302-9743
e-ISSN
—
Number of pages
16
Pages from-to
104-119
Publisher name
Springer Verlag
Place of publication
Berlin, Německo
Event location
2011
Event date
Aug 26, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—