Abstract
Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present–day computers; moreover, different branches in this tree may differ significantly from a computational complexity point of view, that is, for the amount of time and storage necessary to reach a result. In this paper we propose a first approach to outline a strategy for selecting a suitable branch, in some sense, of the computation tree associated with a P system. To this end, we introduce the key notion of the dependency graph of a P system.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cordón-Franco, A., Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A.: Weak metrics on configurations of a P system. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho-Caparrini, F. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, Report RGNC 01/04, University of Sevilla, pp. 139–151 (2004)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)
Păun, G.: Membrane Computing. An introduction. Springer, Heidelberg (2002)
http://psystems.disco.unimib.it/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cordón-Franco, A., Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Riscos-Núñez, A. (2005). Exploring Computation Trees Associated with P Systems. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2004. Lecture Notes in Computer Science, vol 3365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31837-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-31837-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25080-7
Online ISBN: 978-3-540-31837-8
eBook Packages: Computer ScienceComputer Science (R0)