Bisimulation as congruence in the behavioral setting

We cast the notion of bisimulation in the Willems' behavioral setting. We show that in this setting, bisimulation is also a congruence, as it is known in the field of concurrent processes. Bisimulation is a congruence means if A and A′ are bisimilar systems, then A ∥ B and A′ ∥ B are also bisimilar. Here, the operator ∥ denotes systems composition, and B is any other system that is composed with A or A′.

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

[2]  Maria Domenica Di Benedetto,et al.  Bisimulation theory for switching linear systems , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

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

[5]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

[6]  Madhu N. Belur,et al.  Control in a behavioral context , 2003 .

[7]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[8]  L.C.G.J.M. Habets,et al.  Book review: Introduction to mathematical systems theory, a behavioral approach , 2000 .

[9]  Harry L. Trentelman,et al.  Stabilization, pole placement, and regular implementability , 2002, IEEE Trans. Autom. Control..

[10]  D UllmanJeffrey,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001 .

[11]  Arjan van der Schaft,et al.  Equivalence of hybrid dynamical systems , 2004 .

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

[13]  Jan C. Willems,et al.  Introduction to mathematical systems theory: a behavioral approach, Texts in Applied Mathematics 26 , 1999 .

[14]  Arjan van der Schaft,et al.  Bisimulation of Dynamical Systems , 2004, HSCC.

[15]  A.J. van der Schaft,et al.  Achievable behavior by composition , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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

[17]  Rajeev Alur.  Discrete Abstraction of Hybrid Systems , 2000 .

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

[19]  Frank M. Callier.  Book review: J. W. Polderman and J.C. Willems, "Introduction to Mathematical Systems Theory: a Behavioral Approach" (Springer Verlag 1998) , 2002 .

[20]  A. Nerode,et al.  Logics for hybrid systems , 2000, Proceedings of the IEEE.

[21]  A. Schaft,et al.  State maps of general behaviors, their lattice structure and bisimulations , 2004 .