Faster synchronization in P systems
From MaRDI portal
Publication:1761716
DOI10.1007/s11047-011-9271-zzbMath1251.68102OpenAlexW2032748692MaRDI QIDQ1761716
Radu Nicolescu, Yun-Bum Kim, Michael J. Dinneen
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-011-9271-z
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Parallel and Distributed Algorithms in P Systems ⋮ An Adaptive Algorithm for P System Synchronization ⋮ The power of synchronizing rules in membrane computing ⋮ On the efficiency of synchronized P systems ⋮ Synchronization of rules in membrane computing ⋮ P systems and the Byzantine agreement
Cites Work
- Unnamed Item
- Unnamed Item
- P systems and the Byzantine agreement
- Network structure and the firing squad synchronization problem
- A six-state minimal time solution to the Firing squad synchronization problem
- The firing squad synchronization problem for graphs
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
- Unconventional Computation
This page was built for publication: Faster synchronization in P systems
