P systems and the Byzantine agreement

DOI10.1016/J.JLAP.2010.03.004zbMATH Open1208.68116OpenAlexW1987248909MaRDI QIDQ987968FDOQ987968

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

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

zbMATH Keywords

distributed algorithmsP systemsByzantine agreementmodular design

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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)