Presentation
An Approach to the Degree of Parallelism in P Systems
Author/s | Gutiérrez Naranjo, Miguel Ángel
![]() ![]() ![]() ![]() ![]() ![]() ![]() Pérez Jiménez, Mario de Jesús ![]() ![]() ![]() ![]() ![]() ![]() ![]() Riscos Núñez, Agustín ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Department | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Publication Date | 2006 |
Deposit Date | 2016-03-10 |
Published in |
|
ISBN/ISSN | 8461106814 |
Abstract | In the literature, several designs of P systems were used for performing the
same task. The use of different techniques or even different P system models makes it
very difficult to compare these designs. In this paper, ... In the literature, several designs of P systems were used for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this paper, we introduce a new criterion for such a comparison: the degree of parallelism of a P system. To this aim, we define the labeled dependency graph associated with a P system, and we use this new concept for proving some results concerning the maximum number of applications of rules in a single step along the computation of a P system. |
Funding agencies | Ministerio de Educación y Ciencia (MEC). España |
Project ID. | TIN2005-09345-C04-01
![]() |
Files | Size | Format | View | Description |
---|---|---|---|---|
miguelpara.pdf | 222.8Kb | ![]() | View/ | |