Fast synchronization in P systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5391 LNCS, Issue , 2009, Pages 118-128

  Alhazov, Artiom ^a   Margenstern, Maurice ^b   Verlan, Sergey ^a,c  

^a INSTITUTE OF MATHEMATICS AND COMPUTER SCIENCE   (Moldova)

^b UNIVERSITÉ DE LORRAINE   (France)

^c UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; CELLULAR AUTOMATA; FLEXIBLE STRUCTURES; PATTERN RECOGNITION SYSTEMS; TREES (MATHEMATICS);

FIRING SQUAD SYNCHRONIZATION PROBLEMS; MEMBRANE STRUCTURES; P SYSTEMS;

CELL MEMBRANES;

EID: 60349115255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-95885-7_9     Document Type: Conference Paper

References (12)

1. Bernardini, F., Gheorghe, M., Margenstern, M., Verlan, S.: How to synchronize the activity of all components of a P system? In: Vaszil, G. (ed.) Proc. Intern. Workshop Automata for Cellular and Molecular Computing, MTA SZTAKI, Budapest, Hungary, pp. 11-22 (2007)
2. Goto, E.: A minimum time solution of the firing squad problem. Harward Univ. Course Notes for Applied Mathematics, 298 (1962)
3. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society 7, 48-50 (1956)
4. Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theoretical Science 50, 183-238 (1987)
5. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
6. Pǎun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)
7. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389-1401 (1957)
8. Spellman, P.T., Sherlock, G.: Reply whole-cell synchronization - effective tools for cell cycle studies. Trends in Biotechnology 22, 270-273 (2004)
9. Umeo, H., Maeda, M., Fujiwara, N.: An efficient mapping scheme for embedding any one-dimensional firing squad synchronization algorithm onto two-dimensional arrays. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 69-81. Springer, Heidelberg (2002)
10. Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Proc. IFIP TCS 2004, pp. 111-124 (2004)
11. Yunès, J.-B.: Seven-state solution to the firing squad synchronization problem. Theoretical Computer Sci. 127, 313-332 (1994)
12. The P systems web page, http://ppage.psystems.eu