Modelling of Complex Systems: Systems as Dataflow Machines

We develop a unified functional formalism for modelling complex systems, that is to say systems that are composed of a number of heterogeneous components, including typically software and physical devices. Our approach relies on non-standard analysis that allows us to model continuous time in a discrete way. S ystems are defined as generalized Turing machines with temporized input, internal and output mechanisms. Behaviors of systems are represented by transfer functions. A transfer function is said to be implementable if it is associated with a system. This notion leads us to define a new class - which is natural in our framework - of computable functions on (usual) real numbers. We show that our definitions are robust: on one hand, the class of implementable transfer functions is closed under composition; on the other hand, the class of computable functions in our meaning includes analytical functions whose coefficients are computable in the usual way, and is closed under addition, multiplication, differentiation and integration. Our class of computable functions also includes solutions of dynamical and Hamiltonian systems defined by computable functions. Hence, our notion of system appears to take suitably into account physical systems.

[1]  W. Luxemburg.  Non-Standard Analysis , 1977 .

[2]  N. Costa,et al.  Undecidability and incompleteness in classical mechanics , 1991 .

[3]  Daniel Richardson,et al.  Some undecidable problems involving elementary functions of a real variable , 1969, Journal of Symbolic Logic.

[4]  Simon Bliudze,et al.  A Framework for Studying Complex Industrial Systems: An Example Based on the UMTS Infrastructure. , 2006 .

[5]  Leslie Lamport,et al.  Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers [Book Review] , 2002, Computer.

[6]  Martin Davis,et al.  Applied Nonstandard Analysis , 1977 .

[7]  Javier Fernández de Cañete,et al.  Introduction to systems , 2015 .

[8]  Bernard P. Zeigler,et al.  Theory of Modeling and Simulation: Integrating Discrete Event and Continuous Complex Dynamic Systems , 2000 .

[9]  Klaus Schneider,et al.  Verification of Reactive Systems: Formal Methods and Algorithms , 2003 .

[10]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[11]  Eduardo D. Sontag,et al.  Mathematical control theory: deterministic finite dimensional systems (2nd ed.) , 1998 .

[12]  Klaus Schneider.  Verification of Reactive Systems , 2004, Texts in Theoretical Computer Science.

[13]  Marian Boylan Pour-el,et al.  A computable ordinary differential equation which possesses no computable solution , 1979 .

[14]  Cristopher Moore,et al.  Recursion Theory on the Reals and Continuous-Time Computation , 1996, Theor. Comput. Sci..

[15]  François Robert.  Les systèmes dynamiques discrets , 1995 .

[16]  Selim G. Akl.  Three Counterexamples to Dispel the Myth of the Universal Computer , 2006, Parallel Process. Lett..

[17]  Wilfrid S. Kendall,et al.  NONSTANDARD ANALYSIS AND ITS APPLICATIONS (London Mathematical Society Student Texts 10) , 1989 .

[18]  Clive L. Dym,et al.  Fundamentals of Modeling and Analyzing Engineering Systems , 2000 .

[19]  Boris A. Trakhtenbrot.  Understanding Basic Automata Theory in the Continuous Time Setting , 2004, Fundam. Informaticae.

[20]  D. Diderot,et al.  Encyclopédie, ou, Dictionnaire raisonné des sciences, des arts et des métiers , 1963 .

[21]  Kenneth R. Meyer,et al.  Introduction to Hamiltonian Dynamical Systems and the N-Body Problem , 1991 .

[22]  Simon Bliudze,et al.  Towards a Functional Formalism for Modelling Complex Industrial Systems , 2004, Complexus.

[23]  Alexander Kossiakoff,et al.  Systems Engineering Principles and Practice , 2020 .

[24]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[25]  Daniel Krob,et al.  Modelling of Complex Software Systems: A Reasoned Overview , 2006, FORTE.

[26]  Peter Aczel etc.  HANDBOOK OF MATHEMATICAL LOGIC , 1999 .

[27]  Jean Bacon.  Concurrent systems - an integrated approach to operating systems, databases and distributed systems , 1993 .

[28]  Andrea Sorbi,et al.  New Computational Paradigms: Changing Conceptions of What is Computable , 2007 .

[29]  Bernard P. Zeigler,et al.  Theory of modeling and simulation , 1976 .

[30]  Jamal Daafouz,et al.  Systèmes dynamiques hybrides , 2007 .

[31]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[32]  Grégoire Nicolis,et al.  Foundations of Complex Systems , 2009, European Review.

[33]  Eduardo D. Sontag,et al.  Mathematical Control Theory: Deterministic Finite Dimensional Systems , 1990 .

[34]  Olivier Bournez,et al.  A Survey on Continuous Time Computations , 2009, ArXiv.

[35]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[36]  John Lygeros,et al.  Lecture Notes on Hybrid Systems , 2004 .

[37]  Vladimir Kanovei,et al.  Nonstandard Analysis, Axiomatically , 2004 .

[38]  Alain Robert.  Analyse non standard , 1985 .

[39]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[40]  F. Diener,et al.  Nonstandard Analysis in Practice , 1995 .

[41]  Alexander Moshe Rabinovich,et al.  Automata over continuous time , 2003, Theor. Comput. Sci..

[42]  Richard Zurawski,et al.  Embedded Systems Handbook , 2004 .

[43]  Frank L. Severance.  System Modeling and Simulation: An Introduction , 2001 .

[44]  Egon Börger,et al.  Abstract State Machines. A Method for High-Level System Design and Analysis , 2003 .

[45]  Henk Corporaal,et al.  Embedded System Design , 2006 .