Skip to main content
SpringerLink
Log in

On Observability of Automata Networks via Computational Algebra

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

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

Abstract

Automata networks have been successfully used as abstract modeling schemes in many different fields. This paper deals with the observability of automata networks, which describes the ability to uniquely infer the network’s initial configuration by measuring its output sequence. Simple necessary and sufficient conditions for observability are given. The results employ techniques from symbolic computation and can be easily implemented within the computer algebra environments. Two examples are worked out to illustrate the application of the results.

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. Choffrut, C. (ed.): Automata Networks. LNCS, vol. 316. Springer, Heidelberg (1988)

    MATH  Google Scholar 

  2. Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edn. Springer, New York (2007)

    Book  Google Scholar 

  3. Drüppel, S., Lunze, J., Fritz, M.: Modeling of asynchronous discrete-event systems as networks of input-output automata. In: Proceedings of the 17th IFAC World Congress, Seoul, Korea, pp. 544–549 (2008)

    Google Scholar 

  4. Goles, E., Martínez, S.: Neural and Automata Networks: Dynamical Behavior and Applications. Kluwer Academic Publishers, Dordrecht (1990)

    Book  MATH  Google Scholar 

  5. Kawano, Y., Ohtsuka, T.: An algebraic approach to local observability at an initial state for discrete-time polynomial systems. In: Proceedings of the 18th IFAC World Congress, Milano, Italy, pp. 6449–6453 (2011)

    Google Scholar 

  6. Kawano, Y., Ohtsuka, T.: Necessary condition for local observability of discrete-time polynomial systems. In: Proceedings of the 2012 American Control Conference, Montréal, Canada, pp. 6757–6762 (2012)

    Google Scholar 

  7. Kawano, Y., Ohtsuka, T.: Sufficiency of a necessary condition for local observability of discrete-time polynomial systems. In: Proceedings of the 2013 European Control Conference, Zürich, Switzerland, pp. 1722–1727 (2013)

    Google Scholar 

  8. Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  9. Lunze, J.: Relations between networks of standard automata and networks of I/O automata. In: Proceedings of the 9th International Workshop on Discrete Event Systems, Göteborg, Sweden, pp. 425–430 (2008)

    Google Scholar 

  10. Martín-Vide, C., Mateescu, A., Mitrana, V.: Parallel finite automata systems communicating by states. International Journal of Foundations of Computer Science 13(5), 733–749 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Martín-Vide, C., Mitrana, V.: Parallel communicating automata systems - A survey. Korean Journal of Computational & Applied Mathematics 7(2), 237–257 (2000)

    MATH  MathSciNet  Google Scholar 

  12. Martín-Vide, C., Mitrana, V.: Some undecidable problems for parallel communicating finite automata systems. Information Processing Letters 77(5–6), 239–245 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  14. von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press, Urbana (1966)

    Google Scholar 

  15. Paulevé, L., Andrieux, G., Koeppl, H.: Under-approximating cut sets for reachability in large scale automata networks. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 69–84. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Ramadge, P.J.: Observability of discrete event systems. In: Proceedings of the 25th IEEE Conference on Decision and Control, Athens, Greece, pp. 1108–1112 (1986)

    Google Scholar 

  17. Richard, A.: Negative circuits and sustained oscillations in asynchronous automata networks. Advances in Applied Mathematics 44(4), 378–392 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  18. Robert, F.: Discrete Iterations: A Metric Study. Springer, Heidelberg (1986)

    Book  MATH  Google Scholar 

  19. Saito, T., Nishio, H.: Structural and behavioral equivalence relations in automata networks. Theoretical Computer Science 63(2), 223–237 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  20. Veliz-Cuba, A.: An algebraic approach to reverse engineering finite dynamical systems arising from biology. SIAM Journal on Applied Dynamical Systems 11(1), 31–48 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  21. Veliz-Cuba, A., Jarrah, A.S., Laubenbacher, R.: Polynomial algebra of discrete models in systems biology. Bioinformatics 26(13), 1637–1643 (2010)

    Article  Google Scholar 

  22. Veliz-Cuba, A., Stigler, B.: Boolean models can explain bistability in the lac operon. Journal of Computational Biology 18(6), 783–794 (2011)

    Article  MathSciNet  Google Scholar 

  23. Xu, X., Hong, Y.: Observability analysis and observer design for finite automata via matrix approach. IET Control Theory and Applications 7(12), 1609–1615 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Systems and Control, Institute of Systems Science, Chinese Academy of Sciences, Beijing, 100190, China

    Rui Li & Yiguang Hong

Authors
  1. Rui Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yiguang Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rui Li .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, R., Hong, Y. (2015). On Observability of Automata Networks via Computational Algebra. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation