Abstract
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions. Because of the nature of maximal parallelism inherent in the model, P systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems. In this paper, we look at various models of P systems and investigate their model-checking problems. We identify what is decidable (or undecidable) about model-checking these systems under extended logic formalisms of CTL. We also report on some experiments on whether existing conservative (symbolic) model-checking techniques can be practically applied to handle P systems with a reasonable size.
The work by Zhe Dang, Cheng Li and Gaoyan Xie was supported in part by NSF Grant CCF-0430531. The work by Oscar H. Ibarra was supported in part by NSF Grant 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
Andrei, O., Ciobanu, G., Lucanu, D.: Executable specifications of p systems. In: Proc. 5th Workshop on Membrane Computing, pp. 126–145 (2005)
Bultan, T., Gerber, R., Pugh, W.: Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. ACM Trans. Program. Lang. Syst. 21(4), 747–789 (1999)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2), 244–263 (1986)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
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
Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311–324 (1978)
Holzmann, G.J.: The model checker SPIN. IEEE Transactions on Software Engineering 23(5), 279–295 (1997)
Ibarra, O.H.: The number of membranes matters. In: Proc. 4th Workshop on Membrane Computing, pp. 218–231 (2003)
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., Rozenberg, G.: A guide to membrane computing. TCS 287(1), 73–100 (2002)
Pugh, W.: The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM 35(8), 102–114 (1992)
Sosik, P.: P systems versus register machines: two universality proofs. In: Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, pp. 371–382 (2002)
Sosik, P., Freund, R.: P systems without priorities are computationally universal. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 400–409. Springer, Heidelberg (2003)
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
Dang, Z., Ibarra, O.H., Li, C., Xie, G. (2005). On Model-Checking of P Systems. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_9
Download citation
DOI: https://doi.org/10.1007/11560319_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29100-8
Online ISBN: 978-3-540-32022-7
eBook Packages: Computer ScienceComputer Science (R0)