Buscar
Mostrando ítems 1-3 de 3
Ponencia
Asynchronous P Systems (Draft)
(Fénix Editora, 2011)
In this paper, we propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the eld of distributed algorithms. We validate our approach by implementing several well-known ...
Ponencia
BFS Solution for Disjoint Paths in P Systems
(Fénix Editora, 2011)
This paper continues the research on determining a maximum cardinality set of edge- and node-disjoint paths between a source cell and a target cell in P systems. We review the previous solution, based on depth-fi rst ...
Ponencia
Using Central Nodes to Improve P System Synchronization
(Fénix Editora, 2011)
We present an improved solution for the Firing Squad Synchronization Problem (FSSP) for digraph-based P systems. We improve our previous FSSP algorithm by allowing the general to delegate a more central cell in the P ...