How to synchronize the activity of all components of A P system?

International Journal of Foundations of Computer Science

Volumn 19, Issue 5, 2008, Pages 1183-1198

  Bernardini, Francesco ^a   Gheorghe, Marian ^b   Margenstern, Maurice ^c   Verlan, Sergey ^d  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

^c UNIVERSITÉ DE LORRAINE   (France)

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

Author keywords

Cellular automata; P systems; Synchronization

Indexed keywords

EID: 55849088758     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054108006224     Document Type: Article

References (16)

1. F. Bernardini, V. Manca, P systems with boundary rules, in Membrane Computing, International Workshop WMC-CdeA 02, Curtea de Arge s, Romania, August, 19-23, 2002, Revised Papers, Lecture Notes in Computer Science, Vol. 2597, eds. Gh. Pǎun, G. Rozenberg, A. Salomaa, C. Zandron (Springer-Verlag, 2003), pp. 107-118.
2. G. Ciobanu, Distributed algorithms over communicating membrane systems, BioSystems 70(2) (2003) 123-133.
3. G. Ciobanu, R. Desai, A. Kumar, Membrane systems and distributed computing, in Membrane Computing, Lecture Notes in Computer Science, Vol. 2597, eds. Gh. Pǎun, G. Rozenberg, A. Salomaa, C. Zandron (Springer-Verlag, 2003), pp. 187-202.
4. E. Goto, A minimum time solution of the firing squad problem, Course Notes for Applied Mathematics 298 (1962), Harvard University.
5. Ch. Iwamoto, M. Margenstern, Time and space complexity classes of hyperbolic cellular automata, IEICE Transactions on Information and Systems 387-D(3) (2004) 700-707.
6. J.B. Kruskal, On the shortest spanning subtree of a graph and the travelling salesman problem, Proceedings of the American Mathematical Society 7 (1956) 48-50.
7. M. Margenstern, An algorithm for building intrisicaly universal cellular automata in hyperbolic spaces, FCS 2006, Las Vegas, June, 2006.
8. J. Mazoyer, A six-state minimal time solution to the firing squad synchronization problem, Theoretical Computer Science 50 (1987) 183-238.
9. M. Minsky, Computation: Finite and Infinite Machines (Prentice-Hall, 1967).
10. Gh. Pǎun, Membrane Computing. An Introduction (Springer-Verlag, 2002).
11. R.C. Prim, Shortest connection networks and some generalizations, Bell System Technical Journal 36 (1957) 1389-1401.
12. P.T. Spellman, G. Sherlock, Reply whole-cell synchronization - effective tools for cell cycle studies, Trends in Biotechnology 22(6) (2004) 270-273.
13. H. Umeo, M. Maeda, N. Fujiwara, An efficient mapping scheme for embedding any one-dimensional firing squad synchronization algorithm onto two-dimensional arrays, ACRI 2002, Lecture Notes in Computer Science, Vol. 2493 (Springer-Verlag, 2002), pp. 69-81.
14. H. Schmid, T. Worsch, The firing squad synchronization problem with many generals for one-dimensional CA, IFIP TCS 2004, (2004), pp. 111-124.
15. J.-B. Yunès, Seven-state solution to the firing squad synchronization problem, Theoretical Computer Science 127(2) (1994) 313-332.
16. The P systems web page. http://psystems.disco.unimib.it.