Time and Synchronization in Membrane Systems

• Autorzy: Cavaliere M. , Sburlan D.
• Języki publikacji: EN

Abstrakty

EN

Membrane systems are parallel computational devices inspired from the cell functioning. Since the original definition, a standard feature of membrane systems is the fact that each rule of the system is executed in exactly one time-unit. However, this hypothesis seems not to have a counterpart in real world. In fact, in cells, chemical reactions might take different times to be executed. Therefore, a natural step is to associate to each rule of a membrane system a certain time of execution. We are interested in membrane systems, called time-free, working independently from the assigned execution time of the rules. A basic and interesting problem in time-free membrane systems consists in the synchronization of different rules, running in parallel, and having unknown execution times. Here, we present different ways to approach this problem within the framework of membrane systems. Several research proposals are also suggested.

Słowa kluczowe

EN

membrane system; synchronization; time; time-free; universality

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 64, nr 1-4
• Strony: 65--77
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Cavaliere M.

• Department of Computer Science and Artificial Intelligence, University of Sevilla, Av. Reina Mercedes, 41012, Sevilla, Spain

autor

Sburlan D.

• Department of Computer Science and Artificial Intelligence University of Sevilla Av. Reina Mercedes, 41012, Sevilla, Spain
• Department of Informatics and Numerical Methods Ovidius University of Constantza 124 Mamaia Bv., Constantza, Romania

Bibliografia

• [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, Sevilla, 2004, and Soft Computing, to appear.
• [2] Cavaliere, M., Deufemia, V.: On Time-Free P Systems, manuscript, 2004.
• [3] Cavaliere, M., Sburlan, D.: Time-Independent P Systems, Proceedings of WMC5, Fifth Workshop on Membrane Computing,Milano, 2004, Lecture Notes in Computer Science, to appear.
• [4] Dassow, J., P˘aun, Gh.: Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, 1989.
• [5] Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally Universal P systems Without Priorities: Two Catalysts are Sufficient, submitted, 2004.
• [6] Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
• [7] Marcus, S.: The Mathematical Modeling of Human Time, Noesis, 10, 1984, 129–135.
• [8] Marcus, S.: The Time (in Romanian), Ed. Albatros, Bucuresti, 1985.
• [9] Minsky, M.L.: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, 1967.
• [10] P˘aun, A., P˘aun, Gh.: The Power of Communication: P Systems with Symport/Antiport, New Generation Computing, 20, 2002, 295–305.
• [11] Păun, Gh.: Membrane Computing – An Introduction, Springer-Verlag, Berlin, 2002.
• [12] Ray, L.B., Adler, E.M., Gough, N.G., Chong, L.D.: Focus Issue: Computational Approaches in Signal Transduction, Science’s STKE, eg3 2004, http://www.stke.org.