Revising the membrane computing model for byzantine agreement

Show simple item record

dc.contributor.author Nicolescu, Radu en
dc.coverage.spatial Milan, Italy en
dc.date.accessioned 2017-07-31T05:20:32Z en
dc.date.issued 2017 en
dc.identifier.citation 17th International Conference, CMC 2016, Milan, Italy, 25 Jul 2016 - 29 Jul 2019. Lecture Notes in Computer Science: Membrane Computig. Springer Verlag. 10105: 317-339. 2017 en
dc.identifier.isbn 9783319540719 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri http://hdl.handle.net/2292/34634 en
dc.description.abstract We refine our earlier version of P systems with complex symbols. The new version, called cP systems, enables the creation and manipulation of high-level data structures which are typical in high-level languages, such as: relations (graphs), associative arrays, lists, trees. We assess these capabilities by attempting a revised version of our previously best solution for the Byzantine agreement problem – a famous problem in distributed algorithms, with non-trivial data structures and algorithms. In contrast to our previous solutions, which use a greater than exponential number of symbols and rules, the new solution uses a fixed sized alphabet and ruleset, independent of the problem size. The new ruleset follows closely the conceptual description of the algorithm. This revised framework opens the way to further extensions, which may bring P systems closer to the conceptual Actor model. en
dc.publisher Springer Verlag en
dc.relation.ispartof 17th International Conference, CMC 2016 en
dc.relation.ispartofseries Lecture Notes in Computer Science: Membrane Computig 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 Revising the membrane computing model for byzantine agreement en
dc.type Conference Item en
dc.identifier.doi 10.1007/978-3-319-54072-6_20 en
pubs.begin-page 317 en
pubs.volume 10105 en
dc.rights.holder Copyright: Springer Verlag en
pubs.end-page 339 en
pubs.finish-date 2016-07-29 en
pubs.publication-status Published en
pubs.start-date 2016-07-25 en
dc.rights.accessrights http://purl.org/eprint/accessRights/RestrictedAccess en
pubs.subtype Proceedings en
pubs.elements-id 616651 en
pubs.org-id Science en
pubs.org-id School of Computer Science en
dc.identifier.eissn 1611-3349 en
pubs.record-created-at-source-date 2017-07-31 en


Files in this item

There are no files associated with this item.

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics