Faster synchronization in P systems
type: Item
instance of: scholarly article
title: Faster synchronization in P systems
zbMATH Open document ID: 1251.68102
author: Michael J. Dinneen
author: Yun B. Kim
author: Radu Nicolescu
published in: Natural Computing
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 6107165
zbMATH Keywords: cellular automata
zbMATH Keywords: P systems
zbMATH Keywords: simple P modules
zbMATH Keywords: firing squad synchronization
MaRDI profile type: Publication
full work available at URL: s11047-011-9271-z
OpenAlex ID: W2032748692
cites work: An 8-state minimal time solution to the firing squad synchronization problem
cites work: HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
cites work: P systems and the Byzantine agreement
cites work: Network structure and the firing squad synchronization problem
cites work: Q4799368
cites work: A six-state minimal time solution to the Firing squad synchronization problem
cites work: The firing squad synchronization problem for graphs
cites work: Q4673398
cites work: Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
cites work: Unconventional Computation
cites work: An optimum solution to the firing squad synchronization problem
DOI: 10.1007/S11047-011-9271-Z
description: scientific article; zbMATH DE number 6107165