dc.contributor.author |
Dinneen, Michael |
en |
dc.contributor.author |
Kim, Yun-Bum |
en |
dc.contributor.author |
Nicolescu, Radu |
en |
dc.contributor.editor |
Gheorghe, Marian |
en |
dc.contributor.editor |
Paun, Gheorghe |
en |
dc.contributor.editor |
Hinze, Thomas |
en |
dc.contributor.editor |
Rozenberg, Grzegorz |
en |
dc.contributor.editor |
Salomaa, Arto |
en |
dc.coverage.spatial |
Friedrich Schiller University Jena, Germany |
en |
dc.date.accessioned |
2012-04-10T21:37:01Z |
en |
dc.date.issued |
2011 |
en |
dc.identifier.citation |
Conference on Membrane Computing (CMC 2010), Friedrich Schiller University Jena, Germany, 24 Aug 2010 - 27 Aug 2010. Editors: Gheorghe M, Paun G, Hinze T, Rozenberg G, Salomaa A. Proceedings of 11th International Conference, Revised and Selected Papers. Springer, Berlin and Heidelberg. LNCS 6501: 175-197. 2011 |
en |
dc.identifier.isbn |
978-3-642-18122-1 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/16890 |
en |
dc.description.abstract |
We propose an improved generic version of P modules, an extensible framework for recursive composition of P systems. We further provide a revised P solution for the Byzantine agreement problem, based on Exponential Information Gathering (EIG) trees, for N processes connected in a complete graph. Each process is modelled by the combination of N + 1 modules: one “main” module, plus one “firewall” communication module for each process (including one for itself). The EIG tree evaluation functionality is localized into a “main” single cell P module. The messaging functionality is localized into a three cells communication P module. This revised P solution improves overall running time from 9L + 6 to 6L + 1, where L is the number of messaging rounds. Most of the running time, 5L steps, is spent on the communication overhead. We briefly discuss if single cells can solve the Byzantine agreement without support and protection from additional communication cells; we conjecture that this is not possible, within the currently accepted definitions. |
en |
dc.publisher |
Springer |
en |
dc.relation.ispartof |
Conference on Membrane Computing (CMC 2010) |
en |
dc.relation.ispartofseries |
Proceedings of 11th International Conference, Revised and Selected Papers |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
A Faster P Solution for the Byzantine Agreement Problem |
en |
dc.type |
Conference Item |
en |
dc.identifier.doi |
10.1007/978-3-642-18123-8_15 |
en |
pubs.issue |
Revised Selected Papers |
en |
pubs.begin-page |
175 |
en |
pubs.volume |
LNCS 6501 |
en |
dc.rights.holder |
Copyright: Springer |
en |
pubs.author-url |
http://www.springerlink.com/content/88n5485148lpu815/ |
en |
pubs.end-page |
197 |
en |
pubs.finish-date |
2010-08-27 |
en |
pubs.place-of-publication |
Berlin and Heidelberg |
en |
pubs.publication-status |
Published |
en |
pubs.start-date |
2010-08-24 |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Proceedings |
en |
pubs.elements-id |
188614 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2010-11-30 |
en |