dc.contributor.author |
Nicolescu, Radu |
en |
dc.contributor.editor |
Gheorghe, Marian |
en |
dc.contributor.editor |
Păun, Gheorghe |
en |
dc.contributor.editor |
Rozenberg, Grzegorz |
en |
dc.contributor.editor |
Salomaa, Arto |
en |
dc.contributor.editor |
Verlan, Serghei |
en |
dc.coverage.spatial |
Fontainebleau, France |
en |
dc.date.accessioned |
2012-04-10T21:33:28Z |
en |
dc.date.issued |
2012 |
en |
dc.identifier.citation |
Conference on Membrane Computing (CMC 2011), Fontainebleau, France. Editors: Gheorghe M, Păun G, Rozenberg G, Salomaa A, Verlan S. Membrame computing: 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised Selected Papers. Springer, Berlin, Germany. LNCS 7184: 35-50. 2012 |
en |
dc.identifier.isbn |
3642280234 |
en |
dc.identifier.isbn |
9783642280238 |
en |
dc.identifier.issn |
0302-9743 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/16888 |
en |
dc.description.abstract |
Our group's recent quest has been to use P systems to model parallel and distributed algorithms. Several framework extensions are recalled or detailed, in particular, modular composition with information hiding, complex symbols, generic rules, reified cell IDs, asynchronous operational modes, asynchronous complexity. We motivate our proposals via P~system models of several well-known distributed algorithms, such as leader election and distributed echo. As another type of application, we mention a dynamic programming algorithm for stereo matching in image processing. We suggest criteria to assess the merits of this modelling approach and offer preliminary evaluations of our proposed additional ingredients, which have been useful in refactoring existing systems and could be useful to the larger P~systems community. |
en |
dc.description.uri |
http://link.springer.com/chapter/10.1007/978-3-642-28024-5_4 |
en |
dc.publisher |
Springer |
en |
dc.relation.ispartof |
Conference on Membrane Computing (CMC 2011) |
en |
dc.relation.ispartofseries |
Membrame computing: 12th International Conference, CMC 2011, Fontainebleau, France, August 23-26, 2011, Revised 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 |
Parallel and Distributed Algorithms in P Systems |
en |
dc.type |
Conference Item |
en |
dc.identifier.doi |
10.1007/978-3-642-28024-5_4 |
en |
pubs.begin-page |
35 |
en |
pubs.volume |
LNCS 7184 |
en |
dc.rights.holder |
Copyright: Springer Verlag |
en |
pubs.end-page |
50 |
en |
pubs.place-of-publication |
Berlin, Germany |
en |
pubs.publication-status |
Published |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/RestrictedAccess |
en |
pubs.subtype |
Proceedings |
en |
pubs.elements-id |
254437 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2011-12-07 |
en |