skip to main content
research-article

Π machines: virtual machines realizing graph structured transition P systems

Published:01 December 2007Publication History
Skip Abstract Section

Abstract

P systems is a model of computation inspired by the way cells live and function. A typical P system consists of nested compartments surrounded by porous membranes, which contain data that are transformed by transformation rules. P systems can be simulated by a distributed computing system, where each compartment of a given system is simulated by a (remote) process, each running on a different node. By adopting a more "liberal" membrane structure where compartments do not necessarily form a tree-structure but a graph-structure, we get a more general model of computation, which we call graph structured P systems. Any instance of the new model can be implemented by a network of virtual machines, called Π machines, where each machine is able to implement the functionality of any simple compartment.

References

  1. Agarwal, P. The Cell Programming Language. Artificial Life 2, 1 (1994), 37--77. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Berry, G., and Boudol, G. The chemical abstract machine. Theoretical Computer Science 96 (1992), 217--248. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Păun, G. Computing with Membranes. Journal of Computer and System Sciences 61, 1 (2000), 108--143. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Păun, G. Membrane Computing: An Introduction. Springer-Verlag, Berlin, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Romero-Jiménez, A., and J. Pérez-Jiménez, M. Computing Partial Recursive Functions by Transition P Systems. In Membrane Computing, C. Martín-Vide and G. Păun, Eds., no. 2933 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004, pp. 320--340.Google ScholarGoogle Scholar
  6. Syropoulos, A. On P Systems and Distributed Computing. In Pre-proceedings of the Fifth Workshop On Membrane Computing (WMC5). 2004, pp. 405--413. Milan, Italy.Google ScholarGoogle Scholar
  7. Syropoulos, A., Doumanis, S., and Sotiriades, K. T. Computing Recursive Functions with P Systems. In Pre-proceedings of the Fifth Workshop On Membrane Computing (WMC5). 2004, pp. 414--421. Milan, Italy.Google ScholarGoogle Scholar
  8. Syropoulos, A., Mamatas, E. G., Allilomes, P. C., and Sotiriades, K. T. A Distributed Simulation of Transition P Systems. In Membrane Computing, C. Martín-Vide and G. Păun, Eds., no. 2933 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004, pp. 357--368.Google ScholarGoogle Scholar

Index Terms

  1. Π machines: virtual machines realizing graph structured transition P systems

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)1

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!