Abstract
Let R = {r1, ..., r k } be the set of labeled rules in a P system. We look at the computing power of the system under three semantics of parallelism. For a positive integer n ≤ k, define:
n -Max-Parallel: At each step, nondeterministically select a maximal subset of at most n rules in R to apply.
≤n -Parallel: At each step, nondeterministically select any subset of at most n rules in R to apply.
n -Parallel: At each step, nondeterministically select any subset of exactly n rules in R to apply.
Note that in all three cases, at most one instance of any rule can be included in the selected subset. Moreover, if any rule in the subset selected is not applicable, then the whole subset is not applicable. When n = 1, the three semantics reduce to the Sequential mode.
For two models of P systems that have been studied in the literature, catalytic systems and communicating P systems, we show that n-Max-Parallel mode is strictly more powerful than any of the following three modes: Sequential, ≤ n -Parallel, or n -Parallel. For example, it follows from a previous result that a 3-Max Parallel communicating P system is universal. However, under the three limited modes of parallelism, the system is equivalent to a vector addition system, which is known to only define a recursive set. This shows that gmaximal parallelismh (in the sense ofn -Max-Parallel) is key for the model to be universal.
We also summarize our recent results concerning membrane hierarchy, determinism versus nondeterminism, and computational complexity of P systems. Finally, we propose some problems for future research.
Some of the results presented here were obtained in collaboration with Zhe Dang and Hsu-Chun Yen.
This research was supported in part by NSF Grants IIS-0101134, CCR-0208595, and CCF-0430945.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baker, H.G.: Rabin’s proof of the undecidability of the reachability set inclusion problem for vector addition systems. In: C.S.C. Memo 79, Project MAC. MIT, Cambridge (1973)
Calude, C.S., Paun, G.: Computing with cells and atoms: after five years (New text added to Russian edition of the book with the same title first published by Taylor and Francis Publishers, London, 2001). To be published by Pushchino Publishing House (2004)
Csuhaj-Varju, E., Ibarra, O.H., Vaszil, G.: On the computational complexity of P automata. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) Proc. DNA 10, Univ. Milano-Bicocca, pp. 97–106 (2004)
Dang, Z., Ibarra, O.H.: On P systems operating in sequential mode. In: Pre-Proc. 6th Workshop on Descriptional Complexity of Formal Systems (2004)
Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. In: Proc. Fundamentals of Computer Theory. LNCS, vol. 965, pp. 221–232. Springer, Heidelberg (1995)
Freund, R.: Sequential P-systems (2000), Available at http://psystems.disco.unimib.it
Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient. Theoretical Computer Science 330(2), 251–266 (2005)
Freund, R., Paun, A.: Membrane systems with symport/Antiport rules: Universality results. In: Păun, G., et al. (eds.) WMC 2002. LNCS, vol. 2597, pp. 270–287. Springer, Heidelberg (2003)
Freund, R., Paun, G.: On deterministic P systems (2003), See http://psystems.disco.unimib.it
Hack, M.H.: The equality problem for vector addition systems is undecidable. In: C.S.C. Memo 121, Project MAC. MIT, Cambridge (1975)
Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science 8(2), 135–159 (1979)
Huynh, D.T.: Commutative grammars: The complexity of uniform word problems. Information and Control 57, 21–39 (1983)
Ibarra, O.H.: The number of membranes matters. In: Martín-Vide, C., et al. (eds.) WMC 2003. LNCS, vol. 2933, pp. 218–231. Springer, Heidelberg (2004)
Ibarra, O.H.: On the computational complexity of membrane systems. Theoretical Computer Science, 89–109 (2004)
Ibarra, O.H.: On determinism versus nondeterminism in P systems. Theoretical Computer Science (2005) (to appear)
Ibarra, O.H., Yen, H., Dang, Z.: The power of maximal parallelism in P systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 212–224. Springer, Heidelberg (2004)
Martin-Vide, C., Paun, A., Paun, G.: On the power of P systems with symport rules. Journal of Universal Computer Science, 317–331 (2002)
Mayr, E.: Persistence of vector replacement systems is decidable. Acta Informatica 15, 309–318 (1981)
Paun, A., Paun, G.: The power of communication: P systems with symport/antiport. New Generation Computing, 295–306 (2002)
Paun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000)
Paun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)
Paun, G., Perez-Jimenez, M., Sancho-Caparrini, F.: On the reachability problem for P systems with symport/antiport (2002) (submitted)
Paun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287(1), 73–100 (2002)
Savitch, W.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci., 177–192 (1970)
Savitch, W.: A note on multihead automata and context-sensitive languages. Acta Informatica, 249–252 (1973)
Sosik, P.: P systems versus register machines: two universality proofs. In: Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA 2002), Curtea de Arges, Romania, pp. 371–382 (2002)
Sosik, P., Freund, R.: P systems without priorities are computationally universal. In: Păun, G., et al. (eds.) WMC 2002. LNCS, vol. 2597, pp. 400–409. Springer, Heidelberg (2003)
Sosík, P., Matýsek, J.: Membrane computing: when communication is enough. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 264–275. Springer, Heidelberg (2002)
van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. In: Proceedings of STOC 1974, pp. 303–309 (1974)
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
Ibarra, O.H. (2005). P Systems: Some Recent Results and Research Problems. In: Banâtre, JP., Fradet, P., Giavitto, JL., Michel, O. (eds) Unconventional Programming Paradigms. UPP 2004. Lecture Notes in Computer Science, vol 3566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527800_18
Download citation
DOI: https://doi.org/10.1007/11527800_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27884-9
Online ISBN: 978-3-540-31482-0
eBook Packages: Computer ScienceComputer Science (R0)