On Simulations and Bisimulations of General Flow Systems

We introduce a notion of bisimulation equivalence between general flow systems, which include discrete, continuous and hybrid systems, and compare it with similar notions in the literature. The interest in the proposed notion is based on our main result, that the temporal logic GFL* - an extension to general flows of the well-known computation tree logic CTL* - is semantically preserved by this equivalence.

[1]  Nancy A. Lynch,et al.  Hybrid I/O automata , 1995, Inf. Comput..

[2]  J. M. DavorenResear.  Robust Controller Synthesis for Hybrid Systems Using Modal Logic , 2001 .

[3]  Jean-Pierre Aubin,et al.  Impulse differential inclusions: a viability approach to hybrid systems , 2002, IEEE Trans. Autom. Control..

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

[5]  Nicolas Markey,et al.  Non-deterministic Temporal Logics for General Flow Systems , 2004, HSCC.

[6]  Panos J. Antsaklis,et al.  Hybrid Systems V , 1999, Lecture Notes in Computer Science.

[7]  Paulo Tabuada,et al.  Bisimulation relations for dynamical, control, and hybrid systems , 2005, Theor. Comput. Sci..

[8]  George J. Pappas.  Bisimilar linear systems , 2003, Autom..

[9]  Jennifer M. Davoren,et al.  Non-Deterministic Reactive Systems, from Hybrid Systems and Behavioural Systems Perspectives , 2006, ADHS.

[10]  Jan C. Willems,et al.  Models for Dynamics , 1989 .

[11]  Moshe Y. Vardi.  Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.

[12]  Jean-Pierre Aubin,et al.  Dynamical qualitative analysis of evolutionary systems , 2001, 2001 European Control Conference (ECC).

[13]  George J. Pappas,et al.  Bisimilar control affine systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[14]  J. M. Davoren,et al.  On Hybrid Systems and the Modal/z-Calculus (extended abstract) , 1999 .

[15]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[16]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

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

[18]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  A. Agung Julius,et al.  On Interconnection and Equivalence of Continuous and Discrete Systems - A Behavioral Perspective , 2005 .

[20]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .