A Logical Approach to Specification of Hybrid Systems

The main subject of our investigation is behaviour of the continuous components of hybrid systems. By a hybrid system we mean a network of digital and analog devices interacting at discrete times. A first-order logical formalization of hybrid systems is proposed in which the trajectories of the continuous components are presented by majorantcomputable functionals.

[1]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[2]  Zohar Manna,et al.  Verifying Hybrid Systems , 1992, Hybrid Systems.

[3]  Abbas Edalat,et al.  A Domain-Theoretic Approach to Computability on the Real Line , 1999, Theor. Comput. Sci..

[4]  Oleg V. Kudinov,et al.  Characteristic Properties of Majorant-Computability over the Reals , 1998, CSL.

[5]  Thomas A. Henzinger,et al.  Reachability Verification for Hybrid Automata , 1998, HSCC.

[6]  Anil Nerode,et al.  Models for Hybrid Systems: Automata, Topologies, Controllability, Observability , 1992, Hybrid Systems.

[7]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[8]  Richard Montague.  Recursion Theory as a Branch of Model Theory1 , 1968 .

[9]  Yiannis N. Moschovakis,et al.  Abstract first order computability. II , 1969 .

[10]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[11]  J. V. Tucker,et al.  Effective algebras , 1995, Logic in Computer Science.

[12]  I︠U︡riĭ Leonidovich Ershov.  Definability and Computability , 1996 .

[13]  Thomas A. Henzinger,et al.  Towards Refining Temporal Specifications into Hybrid Systems , 1992, Hybrid Systems.

[14]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[15]  Ker-I Ko,et al.  Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..

[16]  Nancy A. Lynch,et al.  Formal Verification of Safety-Critical Hybrid Systems , 1998, HSCC.

[17]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.