Abstract
We consider the following definition (different from the standard definition in the literature) of “maximal parallelism” in the application of evolution rules in a P system G: Let R ={ r 1, ... r k } be the set of (distinct) rules in the system. G operates in maximal parallel mode if at each step of the computation, a maximal subset of R is applied, and at most one instance of any rule is used at every step (thus at most k rules are applicable at any step). We refer to this system as a maximally parallel system. We look at the computing power of P systems under three semantics of parallelism.
The research of Oscar H. Ibarra was supported in part by NSF Grants IIS-0101134, CCR-0208595, and CCF-0430945. The research of Zhe Dang was supported in part by NSF Grant CCF-0430531.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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)
Csuhaj-Varju, E., Dassow, J., Kelemen, J., Paun, Gh.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers, Inc. (1994)
Dang, Z., Ibarra, O.H.: On P systems operating in sequential and limited parallel modes. 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: Reichel, H. (ed.) FCT 1995. 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 (2003), Available at http://psystems.disco.unimib.it
Freund, R., Paun, A.: Membrane systems with symport/antiport rules: universality results. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 270–287. Springer, Heidelberg (2003)
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., Dang, Z., Egecioglu, O.: Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science 312(2-3), 379–399 (2004)
Mayr, E.: Persistence of vector replacement systems is decidable. Acta Informat. 15, 309–318 (1981)
Paun, Gh.: 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., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science 287(1), 73–100 (2002)
Sosik, P.: P systems versus register machines: two universality proofs. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC-CdeA 2002. LNCS, vol. 2597, pp. 371–382. 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
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, O.H., Yen, HC., Dang, Z. (2004). The Power of Maximal Parallelism in P Systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds) Developments in Language Theory. DLT 2004. Lecture Notes in Computer Science, vol 3340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30550-7_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-30550-7_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24014-3
Online ISBN: 978-3-540-30550-7
eBook Packages: Computer ScienceComputer Science (R0)