@article {,
	title = {Exploring computation trees associated with P systems},
	journal = {Lecture Notes in Computer Science},
	volume = {3365},
	year = {2005},
	pages = {278-286},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Usually, the evolution of a P system generates a computation tree too large to be efficiently handled with present{\textendash}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.
},
	isbn = {978-3-540-25080-7},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/tv941vghkntuv8rb/?p=aec382c195614ca0a11739e4c1e790d8\&pi=15},
	author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez}
}
