Revising the Membrane Computing Model for Byzantine Agreement

DOI10.1007/978-3-319-54072-6_20zbMath1483.68126OpenAlexW2589034897MaRDI QIDQ2975922

Radu Nicolescu

Publication date: 12 April 2017

Published in: Membrane Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54072-6_20

zbMATH Keywords

unificationdistributed algorithmsmembrane computingByzantine agreementP-systemsactor modelcP-systemsProlog termsEIG treesinter-cell parallelismintra-cell parallelismgeneric rulescomplex symbolscells with subcellssynchronous and asynchronous models

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data structures (68P05) Distributed algorithms (68W15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• P systems and the Byzantine agreement
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Structured Grid Algorithms Modelled with Complex Objects
• Parallel and Distributed Algorithms in P Systems
• A Faster P Solution for the Byzantine Agreement Problem
• Parallel Thinning with Complex Objects and Actors
• Fast quantum byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Programming P Systems with Complex Objects

This page was built for publication: Revising the Membrane Computing Model for Byzantine Agreement