Time–Independent P Systems

  • Matteo Cavaliere
  • Dragoş Sburlan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3365)

Abstract

We introduce a class of P systems called timed P systems where to each rule is associated an integer that represents the time needed by the rule (reaction) to be entirely executed. The idea comes from cell biology where chemical reactions take certain times to be executed. In this work we are interested in a special class of P systems, called time-free, working always in the same way (i.e., always producing the same result) independently from the values associated to the execution time of their rules.

Later we introduce a generalization of time-free P systems, namely clock-free P systems, where a time of execution is associated directly to each single application of the rules (in this case, different applications, even of the same rule, may take a different time to be executed). Several results are presented together with open problems and research proposals.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ardelean, I.I., Cavaliere, M., Sburlan, D.: Computing Using Signals: From Cells To P Systems, Technical Report 01/2004 of RGNC, Brainstorming Week on Membrane Computing, University of Sevilla and Soft Computing (2004) (to appear)Google Scholar
  2. 2.
    Bottoni, P., Martín-Vide, C., Păun, G., Rozenberg, G.: Membrane Systems with Promoters/Inhibitors. Acta Informatica 38(10), 695–720 (2002)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  4. 4.
    Fernau, H.: Parallel Grammars: A Phenomenology. Grammars 6(1), 25–87 (2003)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Ionescu, M., Sburlan, D.: On P Systems with Promoters/Inhibitors. JUCS 10(5), 581–599 (2004)MathSciNetGoogle Scholar
  6. 6.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  7. 7.
    Minsky, M.L.: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)MATHGoogle Scholar
  8. 8.
    Păun, G.: Membrane Computing – An Introduction. Springer, Berlin (2002)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Matteo Cavaliere
    • 1
  • Dragoş Sburlan
    • 1
    • 2
  1. 1.Department of Computer Science and Artificial IntelligenceUniversity of SevillaSevillaSpain
  2. 2.Department of Informatics and Numerical MethodsOvidius University of ConstantzaConstantzaRomania

Personalised recommendations