HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?

DOI10.1142/S0129054108006224zbMath1175.68158OpenAlexW2154913437MaRDI QIDQ3542878

Francesco Bernardini, Marian Gheorghe, Sergey Verlan, Maurice Margenstern

Publication date: 1 December 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006224

zbMATH Keywords

cellular automatasynchronizationP systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)

Related Items (4)

An Adaptive Algorithm for P System Synchronization ⋮ Faster synchronization in P systems ⋮ P systems and the Byzantine agreement ⋮ The computational power of monodirectional tissue P systems with symport rules

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A six-state minimal time solution to the Firing squad synchronization problem
• Seven-state solutions to the firing squad synchronization problem

This page was built for publication: HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?