A grammar-theoretic treatment of multiagent systems
Cybernetics and Systems
Petri net algorithms in the theory of matrix grammars
Acta Informatica
Communications of the ACM
Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Evolution-Communication P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Cellular Automata: A Discrete Universe
Cellular Automata: A Discrete Universe
Minimizing evolution-communication P systems and automata
New Generation Computing - Membrane computing
Cell communication in tissue P systems: universality results
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Multiset-Based Self-Assembly of Graphs
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
| Hi-index | 5.23 |
We introduce a modelling framework and computational paradigm called Colonies of Synchronizing Agents (CSAs) inspired by the intracellular and intercellular mechanisms in biological tissues. The model is based on a multiset of agents in a common environment. Each agent has a local state stored in the form of a multiset of atomic objects, which is updated by global multiset rewriting rules either independently or synchronously with another agent. We first define the model then study its computational power, considering trade-offs between internal rewriting (intracellular mechanisms) and synchronization between agents (intercellular mechanisms). We also investigate dynamic properties of CSAs, including behavioural robustness (ability to generate a core behaviour despite agent loss or rule failure) and safety of synchronization (ability of an agent to synchronize with some other agent whenever needed).