P systems and the Byzantine agreement

DOI10.1016/J.JLAP.2010.03.004MaRDI QIDQ987968zbMATH OpenOpenAlexFDO

Authors Michael J. Dinneen, Yun B. Kim, Radu Nicolescu

Publication date 24 August 2010

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2010.03.004

zbMATH Keywords

distributed algorithmsP systemsByzantine agreementmodular design

Mathematics Subject Classification ID

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

Recommendations

• A faster P solution for the Byzantine agreement problem
• Revising the membrane computing model for Byzantine agreement
• Actor-like cP systems
• Parallel and distributed algorithms in P systems
• A simple Byzantine generals protocol

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1951582 (Why is no real title available?)
• Discovering the membrane topology of hyperdag P systems
• Fast Synchronization in P Systems
• Fast quantum byzantine agreement
• Faster synchronization in P systems
• HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
• Membrane computing. An introduction.
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Toward practical P systems for distributed computing

Cited in

(7)

• Faster synchronization in P systems
• Parallel and distributed algorithms in P systems
• Multidimensional agreement in Byzantine systems
• Actor-like cP systems
• P system implementation of dynamic programming stereo
• A faster P solution for the Byzantine agreement problem
• Revising the membrane computing model for Byzantine agreement

This page was built for publication: P systems and the Byzantine agreement

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