Skip to main content
SpringerLink
Log in

PX systems = P systems + X machines

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

The paper is a survey of the main features of P systems, X machines and of a new computational device called PX system. The sequential and the parallel PX systems are presented. Results reflecting the computational power of these models and their effectiveness in solving NP-complete problems are briefly mentioned.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aguado J, Bălănescu T, Gheorghe M, Holcombe M and Ipate F (2002) P systems with replicated rewriting and stream X machines. Fundamenta Informaticae 49: 17–33

    Google Scholar 

  • Baigent S (2003) Cells coupled by Voltage-Dependent gap junctions: the asymptotic dynamical limits. BioSystems 68: 213–222

    Google Scholar 

  • Bălănescu T, Cowling T, Georgescu H, Gheorghe M, Holcombe M and Vertan C (1999) Communicating stream X machines are no more than X machines. J of Universal Computer Sci 9: 497–502

    Google Scholar 

  • Bălănescu T, Gheorghe M, Holcombe M and Ipate F (2003) Eilenberg P systems. In: Păun Gh, Rozenberg G, Salomaa A and Zandron C (eds) Membrane Computing. International Workshop, WMC-CdeA 2002, pp. 43–57. Springer-Verlag, LNCS 2597

  • Bogdanov K and Holcombe M (2001) Statechart testing method for aircraft control systems. Software Testing, Verification and Reliability 11: 39–54

    Google Scholar 

  • Brendel V and Busse HG (1984) Genome structure described by formal languages. Nucleic Acids Res 12: 2561–2568

    Google Scholar 

  • Cavaliere M, Martin-Vide C and Păun Gh (eds) (2003) Brainstorming Week on Membrane Computing. Report 26/03, Rovira i Virgili University, Tarragona

    Google Scholar 

  • Chomsky N (1957) Syntactic Structures. Mouton, The Hague

  • Ciobanu G (to appear) Distributed algorithms over communicating membrane systems. BioSystems

  • Collado-Vides J (1989) A transformational grammar approach to the study of the regulation of gene expression. J Theor Biol 136: 403–425

    Google Scholar 

  • Csuhaj-Varju E, Dassow J, Kelemen J and Păun Gh (1994) Grammar Systems. A Grammatical Approach to Distribution and Cooperation. Gordon & Breach, London

    Google Scholar 

  • Ehrenfeucht A, Prescott DM and Rozenberg G (2000) Computational aspects of gene (un)scrambling in ciliates. In: Landwerber L and Winfree E (eds) Evolution as Computation, pp. 45–86. Springer-Verlag, Berlin

    Google Scholar 

  • Eilenberg S (1974) Automata, Languages and Machines. Academic Press

  • Gheorghe M (2000) Generalised stream X machines and cooperating distributed grammar systems. Formal Aspects of Computing 12: 459–472

    Google Scholar 

  • Gheorghe M, HolcombeMand Kefalas P (2001) Computational models of collective foraging. BioSystems 61: 133–141

    Google Scholar 

  • Giavitto J-L and Michel O (to appear) Modelling the topological organization of cellular processes. BioSystems

  • Gregory R, Paton R, Saunders J and Wu QH (2003) (to appear) A model of bacterial adaptability based on multiple scales of interaction: COSMIC. In: Paton RC et al. (eds) Computing in Cells and Tissues. Springer-Verlag, series on Natural Computing

  • Harel D (1987) Statecharts: a visual formalism for complex systems. Science of Computer Programming 8: 231–274

    Google Scholar 

  • Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull Math Biol 49: 737–757

    Google Scholar 

  • Holcombe M (1988) X-machines as a basis for dynamic system specification. Software Engineering Journal 3(2): 69–76

    Google Scholar 

  • Holcombe M (2000) X-machines in computing, biology and art. In: Freund R and Kelemenova A (eds) Proceedings of the International Workshop Grammar Systems, pp. 343–346. Silesian University at Opava, Bad Ischl

    Google Scholar 

  • Holcombe M, B ogdanov K and Gheorghe M (2001) Functional test generation for extreme programming. Proceedings of the 2nd Int Conf on Extreme Programming and Flexible Processes in Software Engineering, pp. 109–113. Italy

  • Holcombe M and Ipate F (1998) Correct Systems. Building a Business Process Solution. Springer-Verlag, Applied Computing Series

  • Jensen K (1992, 1994, 1997) Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use. Vol 1-3, Springer-Verlag, Berlin

    Google Scholar 

  • Jones S (2000) The Language of the Genes. Flamingo, London (Revised edition)

  • Kam N, Cohen IR and Harel D (2001) The Immune System as a Reactive System: Modelling T Cell Activation with Statecharts. Technical report MCS01-09, The Weizmann Institute of Science, Israel

  • Kefalas P (2002) Formal modelling of reactive agents as an aggregation of simple behaviours. In: Vlahavas IP and Spyropoulos CD (eds) pp. 461–472. Springer-Verlag, LNAI 2308

  • Kefalas P, Eleftherakis G, Holcombe M and Gheorghe M (to appear) Simulation and verification of P systems through communicating X machines. BioSystems

  • Kefalas P, Holcombe M, Eleftherakis G and Gheorghe M (2003) A formal method for the development of agent based systems. In: Plekhanova V (ed) Intelligent Agent Software Engineering, pp. 68–98. Idea Group Publishing

  • Kitano H (2002) Computational systems biology. Nature 420: 206–210

    Google Scholar 

  • Krishna SN and Rama R (2001) P systems with replicated rewriting. Journal of Automata, Languages and Combinatorics 6: 345–350

    Google Scholar 

  • Lindenmayer A (1968) Lindenmayer, mathematical models of cellular interactions in development, I. filaments with one-side inputs, II. simple and branching filaments with two-sided inputs. Journal of Theoretical Biology 18: 280–299, 300-315

    Google Scholar 

  • Păun Gh (2000) Computing with membranes. Journal of Computer System Sciences 61: 108–143 (see also Turku Center for Computer Science - TUCS Report No 208, 1998, http: //www.tucs.fi)

    Google Scholar 

  • Păun Gh (2002) Membrane Computing. An Introduction. Springer-Verlag, Berlin

    Google Scholar 

  • Păun Gh, Rozenberg G and Salomaa A (1998) DNA Computing. New Computing Paradigms. Springer-Verlag, Berlin

    Google Scholar 

  • Peleg M, Yeh I and Altman RB (2002) Modeling biological processes using workflow and Petri net models. Bioinformatics 18: 825–837

    Google Scholar 

  • Petrenko A (2001) Fault model-driven test derivation from finite state models: annotated bibliography. In: Modeling and Verification of Parallel Processes, 4th Summer School, MOVEP, pp. 196–205. Springer-Verlag, LNCS 2067

  • Prusinkiewicz P and Lindenmayer A (1990) The Algorithmic Beauty of Plants. Springer-Verlag, New York

    Google Scholar 

  • Rozenberg G and Salomaa A (eds) (1974) L Systems. Springer-Verlag, Berlin

    Google Scholar 

  • Sakakibara Y et al. (1994) Stochastic context-free grammars for TRNA modelling. Nucleic Acids Research 25: 5112–5120

    Google Scholar 

  • Searls DB (1992) The linguistics of DNA. Am Sci 80: 579–591

    Google Scholar 

  • Searls DB (1993) The computational linguistics of biological sequences. In: Hunter L (ed) Artificial Intelligence and Molecular Biology, pp. 47–120. AAAI Press, The MIT Press

  • Searls DB (2002) The language of genes. Nature 420: 211–217

    Google Scholar 

  • Tofts C (1993) Describing social insect behaviour using process algebra. Transaction of Society for Computer Simulation: 227–283

  • Simons A, Stannett M, Bogdanov K and Holcombe M (2002) Method for Object Testing, Integration and Verification. FORTESTWorkshop, University of York

  • Suzuki Y, Takabayashi J and Tanaka H (2000) Investigations of an ecological system using an abstract rewriting system of multisets. In: Păun Gh (ed) Recent Topics in Mathematical and Computational Linguistics, pp. 300–309. The Publishing House of the Romanian Academy, Bucharest

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sheffield University, Regent Court, Portobello Street, Sheffield, S1 4DP, UK

    Francesco Bernardini, Marian Gheorghe & Mike Holcombe

Authors
  1. Francesco Bernardini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marian Gheorghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mike Holcombe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bernardini, F., Gheorghe, M. & Holcombe, M. PX systems = P systems + X machines. Natural Computing 2, 201–213 (2003). https://doi.org/10.1023/A:1025463922702

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025463922702

Search

Navigation