Skip to main content
SpringerLink
Log in

Fast Synchronization in P Systems

  • Conference paper
Membrane Computing (WMC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5391))

Included in the following conference series:

Abstract

We consider the problem of synchronizing the activity of all membranes of a P system. After pointing the connection with a similar problem dealt with in the field of cellular automata, where the problem is called the firing squad synchronization problem, FSSP for short, we provide two algorithms to solve this problem for P systems. One algorithm is non-deterministic and works in 2h + 3 steps, the other is deterministic and works in 3h + 3 steps, where h is the height of the tree describing the membrane structure.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  2. Goto, E.: A minimum time solution of the firing squad problem. Harward Univ. Course Notes for Applied Mathematics, 298 (1962)

    Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  4. Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theoretical Science 50, 183–238 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  6. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  7. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)

    Article  Google Scholar 

  8. Spellman, P.T., Sherlock, G.: Reply whole-cell synchronization - effective tools for cell cycle studies. Trends in Biotechnology 22, 270–273 (2004)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Google Scholar 

  11. Yunès, J.-B.: Seven-state solution to the firing squad synchronization problem. Theoretical Computer Sci. 127, 313–332 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. The P systems web page, http://ppage.psystems.eu

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, str. Academiei 5, MD-2028, Chişinău, Moldova

    Artiom Alhazov & Sergey Verlan

  2. Université Paul Verlaine - Metz, LITA, EA 3097, IUT de Metz, Ile du Saulcy, 57045, Metz Cédex, France

    Maurice Margenstern

  3. LACL, Département Informatique, Université Paris Est, 61 av. Général de Gaulle, 94010, Créteil, France

    Sergey Verlan

Authors
  1. Artiom Alhazov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice Margenstern
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sergey Verlan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematical and Computer Science, Heriot-Watt University, EH14 8AS, Edinburgh, UK

    David Wolfe Corne

  2. School of Mathematical and Computer Science, Heriot-Watt University, EH14 4AS, Edinburgh, UK

    Pierluigi Frisco

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucharest, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333 CA, Leiden, The Netherlands

    Grzegorz Rozenberg

  5. Turku Centre for Computer Science (TUCS), Leminkäisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alhazov, A., Margenstern, M., Verlan, S. (2009). Fast Synchronization in P Systems. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2008. Lecture Notes in Computer Science, vol 5391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95885-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95885-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95884-0

  • Online ISBN: 978-3-540-95885-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation