Assume-guarantee reasoning for linear dynamical systems

The notion of simulation relation has been adopted from theoretical computing science to control theory to reduce the complexity arising in modeling physical processes. Simulations can serve as an abstraction of a given system behavior whilst preserving the input-output structure. We intend to apply simulation relations to develop a framework for compositional and assume-guarantee reasoning for linear dynamical systems. The underlying idea is to use information about the relation of components or subsystems to abstract the behavior of interconnected systems. The interconnection structure is hereby defined by two types of negative feedback.

[1]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Thomas A. Henzinger,et al.  Assume-Guarantee Reasoning for Hierarchical Hybrid Systems , 2001, HSCC.

[4]  A. J. van der Schaft.  Equivalence of dynamical systems by bisimulation , 2004, IEEE Transactions on Automatic Control.

[5]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[6]  Thomas A. Henzinger,et al.  You Assume, We Guarantee: Methodology and Case Studies , 1998, CAV.

[7]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[8]  S. Shankar Sastry,et al.  Hierarchically consistent control systems , 2000, IEEE Trans. Autom. Control..

[9]  Goran Frehse,et al.  Compositional verification of hybrid systems using simulation relations , 2005 .