Analysis of dynamical systems using predicate transformers: Attraction and composition

  • M. Sintzoff
  • F. Geurts
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 888)

Abstract

We present a framework for the compositional analysis of dynamical systems. This framework is based on set-valued functions, defined by predicate transformers. It integrates concepts from mathematics, computing science, and neurosciences. We also introduce an additional concept: the attraction between predicates. The main results of the paper are then presented. We propose composition rules which permit to see a complex system as Composed of simpler ones, to study these simple systems using the concepts introduced before, and then to compose the results for deriving the analysis of the initial complex system.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Devaney, R.L. An Introduction to Chaotic Dynamical Systems. Addison-Wesley, 2nd ed., 1989.Google Scholar
  2. 2.
    Wiggins, S. Introduction to Applied Nonlinear Dynamical Systems and Chaos, TAM 2. Springer-Verlag, 1990.Google Scholar
  3. 3.
    Dijkstra, E.W. A Discipline of Programming. Prentice Hall, 1976.Google Scholar
  4. 4.
    Sintzoff, M. Invariance and contraction by infinite iteration of relations. In Banâtre, J.P. and Le Metayer, D., (eds), Research Directions in High-Level Parallel Programming Languages, LNCS 574, pp. 349–373. Springer-Verlag, 1992.Google Scholar
  5. 5.
    Hutchinson, J.E. Fractals and self similarity. Indiana University Mathematics Journal, 30(5):713–747, 1981.Google Scholar
  6. 6.
    Sifakis, J. A unified approach for studying the properties of transition systems. Theoretical Computer Science, 18:227–258, 1982.CrossRefGoogle Scholar
  7. 7.
    Tarski, A. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.Google Scholar
  8. 8.
    van Lamsweerde, A. and Sintzoff, M. Formal derivation of strongly correct concurrent programs. Acta Informatica, 12:1–31, 1979.Google Scholar
  9. 9.
    Francez, N. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, 1986.Google Scholar
  10. 10.
    Geurts, F. and Lombart, V. Etude des systèmes de transitions discrets. Unité d'Informatique, U.C.Louvain, June 1992. Travail de fin d'études.Google Scholar
  11. 11.
    Manna, Z. and Pnueli, A. The Temporal Logic of Reacative and Concurrent Systems: Specification. Springer-Verlag, 1992.Google Scholar
  12. 12.
    Dugundji, J. Topology. Wm.C. Brown Publishers, 2nd ed., 1989.Google Scholar
  13. 13.
    Chen, W. and Udding, J.T. Program inversion: More than fun! Science of Computer Programming, 15:1–13, 1990.Google Scholar
  14. 14.
    Sintzoff, M. Ensuring correctness by arbitrary postfixed-points. In Proc. 7th Symp. Math. Found. Comput. Sci., LNCS 64, pp. 484–492. Springer-Verlag, 1978.Google Scholar
  15. 15.
    Arnold, A. Systèmes de Transitions Finis et Sémantique des Processus Communicants. Masson, 1992.Google Scholar
  16. 16.
    Smale, S. Diffeomorphisms with many periodic points. In Cairns, S.S., (ed.), Differential and Combinatorial Topology, pp. 63–80. Princeton University Press, 1965.Google Scholar
  17. 17.
    Sintzoff, M. and Geurts, F. Compositional analysis of dynamical systems using predicate transformers (summary). In Proc. of 1993 International Symposium on Nonlinear Theory and its Applications, Hawaii, 1993.Google Scholar
  18. 18.
    Goles, E. and Martinez, S. Neural and Automata Networks, Dynamical Behavior and Applications. Mathematics and Its Applications. Kluwer Academic Publishers, 1990.Google Scholar
  19. 19.
    Hao, B.L. Elementary Symbolic Dynamics and Chaos in Dissipative Systems. World Scientific, 1989.Google Scholar
  20. 20.
    Bedford, T., Keane, M., and Series, C., (eds). Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces. Oxford Science Publications, 1991.Google Scholar
  21. 21.
    Barnsley, M.F. Fractals Everywhere. Academic Press, 1988.Google Scholar
  22. 22.
    Ginsburg, S. Algebraic and Automata-Theoretic Properties of Formal Languages, Fundamental Studies In Computer Science 2. North-Holland/American Elsevier, 1975.Google Scholar
  23. 23.
    Moore, C. Generalized one-sided shifts and maps of the interval. Nonlinearity, 4:727–745, 1991.Google Scholar
  24. 24.
    Troll, G. Formal languages in dynamical systems. Tech. Rep. 47, SFB 288, T.U.Berlin, 1993.Google Scholar
  25. 25.
    KÚrka, P. One-dimensional dynamics and factors of finite automata. Tech. rep., Department of Mathematical Logic and Philosophy of Mathematics, Charles U., Prague, 1993.Google Scholar
  26. 26.
    Dijkstra, E.W. and Scholten, C.S. Predicate Calculus and Program Semantics. Texts and Monographs In Computer Science. Springer-Verlag, 1990.Google Scholar
  27. 27.
    Hoare, C.A.R. Communicating Sequential Processes. International Series in Computer Science. Prentice Hall, 1985.Google Scholar
  28. 28.
    Milner, R. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.Google Scholar
  29. 29.
    Mazurkiewicz, A. Basic notions of trace theory. In de Bakker, J.W., de Roever, W.P., and Rozenberg, G., (eds), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pp. 285–363. Springer-Verlag, 1988.Google Scholar
  30. 30.
    Hopfield, J.J. Neural networks and physical systems with emergent collective computational abilities. Proc. of the National Academy of Sciences, 79:2554–2558, 1982.Google Scholar
  31. 31.
    Hopfield, J.J. Neurons with graded response have collective computational properties like those of two-state neurons. Proc. of the National Academy of Sciences, 81:3088–3092, 1984.Google Scholar
  32. 32.
    Phipps, M. From local to global: the lesson of cellular automata. In DeAngelis, D. and Gross, L., (eds), Individual-Based Approaches in Ecology: Concepts and Models. Chapman and Hall, 1992.Google Scholar
  33. 33.
    Weisbuch, G. Dynamique des systèmes complexes, Une introduction aux réseaux d'automates. InterEditions, 1989.Google Scholar
  34. 34.
    Blum, E.K. and Wang, X. Stability of fixed points and periodic orbits and bifurcations in analog neural networks. Neural Networks, 5:577–587, 1992.Google Scholar
  35. 35.
    Marcus, C.M., Waugh, F.R., and Westervelt, R.M. Nonlinear dynamics and stability of analog neural networks. Physica D, 51:234–247, 1992.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • M. Sintzoff
    • 1
  • F. Geurts
    • 1
  1. 1.Unité d'InformatiqueUniversity of LouvainLouvain-la-NeuveBelgium

Personalised recommendations