Fast Synchronization in P Systems

DOI10.1007/978-3-540-95885-7_9MaRDI QIDQ5191165zbMATH OpenOpenAlexFDO

Authors Artiom Alhazov, Sergey Verlan, M. Margenstern

Publication date 28 July 2009

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-95885-7_9

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
• Faster synchronization in P systems
• An adaptive algorithm for P system synchronization
• scientific article; zbMATH DE number 2060759
• Synchronization in P modules

Cites work

• A six-state minimal time solution to the Firing squad synchronization problem
• scientific article; zbMATH DE number 2016494 (Why is no real title available?)
• scientific article; zbMATH DE number 2163014 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Seven-state solutions to the firing squad synchronization problem

Cited in

(8)

• Faster synchronization in P systems
• Synchronization of rules in membrane computing
• An adaptive algorithm for P system synchronization
• HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
• Synchronization in P modules
• The power of synchronizing rules in membrane computing
• On the efficiency of synchronized P systems
• P systems and the Byzantine agreement

This page was built for publication: Fast Synchronization in P Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191165)