A multiset-based model of synchronizing agents: Computability and robustness
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1951580 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A GRAMMAR-THEORETIC TREATMENT OF MULTIAGENT SYSTEMS
- A quick introduction to membrane computing
- Cell communication in tissue \(P\) systems: universality results
- Cellular automata. A discrete universe
- Membrane computing. An introduction.
- Minimizing evolution communication P systems and automata
- Multiset-based self-assembly of graphs
- Petri net algorithms in the theory of matrix grammars
- Remarks on blind and partially blind one-way multicounter machines
- Robustness of decentralized knowledge systems: a grammar-theoretic view
- The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
- The temporal logic of branching time
- Tissue P systems.
Cited in
(5)- From P systems to morphogenetic systems: an overview and open problems
- A LOGICAL CHARACTERIZATION OF ROBUSTNESS, MUTANTS AND SPECIES IN COLONIES OF AGENTS
- The evolutionary resilience of distributed cellular computing
- Robustness of multi-agent models: the example of collaboration between turmites with synchronous and asynchronous updating
- Morphogenetic systems for resource bounded computation and modeling
This page was built for publication: A multiset-based model of synchronizing agents: Computability and robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474434)