Skip to main content
SpringerLink
Log in

Dynamics of Circuits and Intersecting Circuits

  • Conference paper
Language and Automata Theory and Applications (LATA 2012)

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

Abstract

This paper presents a combinatorial study to characterise the dynamics of intersecting Boolean automata circuits and more specifically that of double Boolean automata circuits. Explicit formulae are given to count the number of periodic configurations and attractors of these networks and a conjecture proposes a comparison between the number of attractors of isolated circuits and that of double circuits. The aim of this study is to give intuition on the way circuits interact and how a circuits intersection modifies the “degrees of freedom” of the overall network.

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. Adams, W., Shanks, D.: Strong primality tests that are not sufficient. Mathematics of Computation (American Mathematical Society) 39(159), 255–300 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Apostol, T.M.: Introduction to analytic number theory. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  3. Aracena, J., Ben Lamine, S., Mermet, O., Cohen, O., Demongeot, J.: Mathematical modeling in genetic networks: relationships between the genetic expression and both chromosomic breakage and positive circuits. IEEE Transactions on Systems, Man, and Cybernetics 33, 825–834 (2003)

    Article  Google Scholar 

  4. Demongeot, J., Noual, M., Sené, S.: Combinatorics of boolean automata circuits dynamics (2011) (submitted)

    Google Scholar 

  5. Elena, A.: Algorithme pour la simulation dynamique des réseaux de régulation génétique. Master’s thesis, University J. Fourier (2004)

    Google Scholar 

  6. Goles, E.: Comportement oscillatoire d’une famille d’automates cellulaires non uniformes. Ph.D. thesis, Université scientifique et médicale de Grenoble, France (1980), http://tel.archives-ouvertes.fr/tel-00293368/fr/

  7. Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences of the USA 79, 2554–2558 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kauffman, S.A.: Metabolic stability and epigenesis in randomly constructed genetic nets. Journal of Theoretical Biology 22, 437–467 (1969)

    Article  MathSciNet  Google Scholar 

  9. McCulloch, W.S., Pitts, W.: A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics 5, 115–133 (1943)

    Article  MathSciNet  MATH  Google Scholar 

  10. Puri, Y., Ward, T.: Arithmetic and growth of periodic orbits. Journal of Integer Sequences 4(2) (2001)

    Google Scholar 

  11. Puri, Y., Ward, T.: A dynamical property unique to the Lucas sequence. The Fibonacci Quarterly. The Official Journal of the Fibonacci Association 39(5), 398–402 (2001)

    MathSciNet  MATH  Google Scholar 

  12. Remy, É., Ruet, P., Thieffry, D.: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Advances in Applied Mathematics 41, 335–350 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ribenboim, P.: The New Book of Prime Number Records. Springer, Heidelberg (1996)

    Book  MATH  Google Scholar 

  14. Richard, A.: Positive circuits and maximal number of fixed points in discrete dynamical systems. Discrete Applied Mathematics 157, 3281–3288 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Riordan, J.: An Introduction to Combinatorial Analysis. Wiley, New York (1980)

    Book  MATH  Google Scholar 

  16. Sloane, N.J.A.: The on-line encyclopedia of integer sequences, OEIS (2008)

    Google Scholar 

  17. Thomas, R.: Boolean formalisation of genetic control circuits. Journal of Theoretical Biology 42, 563–585 (1973)

    Article  Google Scholar 

  18. Thomas, R.: On the relation between the logical structure of systems and their ability to generate multiple steady states or sustained oscillations. Springer Series in Synergetics, vol. 9, pp. 180–193 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lyon, ÉNS-Lyon, LIP, CNRS UMR5668, Lyon, France

    Mathilde Noual

  2. IXXI, Institut Rhône-alpin des systèmes complexes, Lyon, France

    Mathilde Noual

Authors
  1. Mathilde Noual
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Noual, M. (2012). Dynamics of Circuits and Intersecting Circuits. In: Dediu, AH., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2012. Lecture Notes in Computer Science, vol 7183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28332-1_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28332-1_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28331-4

  • Online ISBN: 978-3-642-28332-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation