A multiset-based model of synchronizing agents: Computability and robustness

DOI10.1016/j.tcs.2007.11.009zbMath1133.68019OpenAlexW1996842887MaRDI QIDQ2474434

Radu Mardare, Sean Sedwards, Matteo Cavaliere

Publication date: 6 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.009

zbMATH Keywords

robustnessrewritingdistributed computingamorphousmultisetscolonysynchronizing agents

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

The Evolutionary Resilience of Distributed Cellular Computing ⋮ From P systems to morphogenetic systems: an overview and open problems ⋮ Morphogenetic systems for resource bounded computation and modeling

Cites Work

• The temporal logic of branching time
• A quick introduction to membrane computing
• Remarks on blind and partially blind one-way multicounter machines
• Petri net algorithms in the theory of matrix grammars
• Tissue P systems.
• Minimizing evolution communication P systems and automata
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
• Membrane computing. An introduction.
• Cell communication in tissue \(P\) systems: universality results
• A GRAMMAR-THEORETIC TREATMENT OF MULTIAGENT SYSTEMS
• Robustness of decentralized knowledge systems: a grammar-theoretic view
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A multiset-based model of synchronizing agents: Computability and robustness