Skip to main content
SpringerLink
Log in

An Adaptive Algorithm for P System Synchronization

  • Conference paper
Membrane Computing (CMC 2011)

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

Included in the following conference series:

  • 532 Accesses

Abstract

We present an improved solution for the Firing Squad Synchronization Problem (FSSP) for digraph-structured P systems. We improve our previous FSSP algorithm by allowing the general to delegate a more central cell in the P system to send the final command to synchronize. With e being the eccentricity of the general and r denoting the radius of the underlying digraph, our new algorithm guarantees to synchronize all cells of the system, between e + 2r + 3 steps (for all trees structures and many digraphs) and up to 3e + 7 steps, in the worst case for any digraph. Empirical results show our new algorithm for tree-structured P systems yields at least 20% reduction in the number of steps needed to synchronize over the previous best-known algorithm.

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. Alhazov, A., Margenstern, M., Verlan, S.: Fast Synchronization in P Systems. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 118–128. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control 10(1), 22–42 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bernardini, F., Gheorghe, M., Margenstern, M., Verlan, S.: How to synchronize the activity of all components of a P system? Int. J. Found. Comput. Sci. 19(5), 1183–1198 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berthiaume, A., Bittner, T., Perkovic, L., Settle, A., Simon, J.: Bounding the firing synchronization problem on a ring. Theor. Comput. Sci. 320(2-3), 213–228 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dinneen, M.J., Kim, Y.-B., Nicolescu, R.: Faster synchronization in P systems. Natural Computing, 1–9 (2011)

    Google Scholar 

  6. Goto, E.: A minimal time solution of the firing squad problem. In: Course Notes for Applied Mathematics, vol. 298, pp. 52–59. Harvard University (1962)

    Google Scholar 

  7. Grefenstette, J.J.: Network structure and the firing squad synchronization problem. J. Comput. Syst. Sci. 26(1), 139–152 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy 2008), Pasadena, CA, USA, pp. 11–15 (August 2008)

    Google Scholar 

  9. Ionescu, M., Sburlan, D.: On P systems with promoters/inhibitors. J. UCS 10(5), 581–599 (2004)

    MathSciNet  Google Scholar 

  10. Kobayashi, K.: The firing squad synchronization problem for a class of polyautomata networks. J. Comput. Syst. Sci. 17(3), 300–318 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  11. Martín-Vide, C., Păun, G., Pazos, J., Rodríguez-Patón, A.: Tissue P systems. Theor. Comput. Sci. 296(2), 295–326 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Moore, E.F.: The firing squad synchronization problem. In: Moore, E. (ed.) Sequential Machines, Selected Papers, pp. 213–214. Addison-Wesley, Reading (1964)

    Google Scholar 

  13. Moore, F.R., Langdon, G.G.: A generalized firing squad problem. Information and Control 12(3), 212–220 (1968)

    Article  MATH  Google Scholar 

  14. Nishitani, Y., Honda, N.: The firing squad synchronization problem for graphs. Theor. Comput. Sci. 14, 39–61 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  15. Păun, G.: Membrane Computing: An Introduction. Springer-Verlag New York, Inc., Secaucus (2002)

    Book  MATH  Google Scholar 

  16. Păun, G.: Introduction to membrane computing. In: Ciobanu, G., Pérez-Jiménez, M.J., Păun, G. (eds.) Applications of Membrane Computing. Natural Computing Series, pp. 1–42. Springer, Heidelberg (2006)

    Google Scholar 

  17. Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Lévy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) IFIP TCS, pp. 111–124. Kluwer (2004)

    Google Scholar 

  18. Stein, W.A., et al.: Sage Mathematics Software (Version 4.6). The Sage Development Team (2010), http://www.sagemath.org

  19. Umeo, H., Kamikawa, N., Nishioka, K., Akiguchi, S.: Generalized firing squad synchronization protocols for one-dimensional cellular automata—a survey. Acta Physica Polonica B Proceedings Supplement 3(2), 267–289 (2010)

    Google Scholar 

  20. Waksman, A.: An optimum solution to the firing squad synchronization problem. Information and Control 9(1), 66–78 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  21. Weisstein, E.W.: Prüfer code, from MathWorld—a Wolfram web resource, http://mathworld.wolfram.com/PrueferCode.html (accessed April 8, 2011)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Auckland, 92019, Auckland, New Zealand

    Michael J. Dinneen, Yun-Bum Kim & Radu Nicolescu

Authors
  1. Michael J. Dinneen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yun-Bum Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Radu Nicolescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Sheffield, Regent Court, Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 014700, Bucharest, Romania

    Gheorghe Păun

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

    Grzegorz Rozenberg

  4. Turku Centre for Computer Science (TUCS), Leminkaisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

  5. Faculté des Sciences et Technologie, Laboratoire d’Algorithmique, Complexité et Logique (LACL), Université Paris Est – Créteil Val de Marne, 61, av. Général de Gaulle, 94010, Créteil, France

    Sergey Verlan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dinneen, M.J., Kim, YB., Nicolescu, R. (2012). An Adaptive Algorithm for P System Synchronization. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28024-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28023-8

  • Online ISBN: 978-3-642-28024-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation