Game Constructions that are Safe for Bisimulation

The notion of bisimulation is extended to Game Logic (GL), a logic for reasoning about winning strategies in 2-player games. We show that all game constructions of GL are safe for bisimulation, i.e. that an atomic bisimulation can be lifted to non-atomic games constructed by the operations of GL. As a consequence, bisimilar states satisfy the same GL-formulas.

[1]  Jan A. Bergstra,et al.  Logic of transition systems , 1994, J. Log. Lang. Inf..

[2]  Giovanna DAgostino.  Modal Logic and non-well-founded Set Theory: translation, bisimulation, interpolation , 1998 .

[3]  Jan van Eijck,et al.  Modal Logic, Transition Systems and Processes , 1993, J. Log. Comput..

[4]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Rohit Parikh.  Logics of Programs , 1985, Lecture Notes in Computer Science.

[6]  R. Parikh.  The logic of games and its applications , 1985 .

[7]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[8]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[9]  J. Davenport.  Editor , 1960 .

[10]  J.F.A.K. van Benthem,et al.  Bisimulation: The Never-Ending Story , 1996 .

[11]  Johan van Benthem,et al.  Program Constructions that are Safe for Bisimulation , 1998, Stud Logica.

[12]  R. Lathe.  Phd by thesis , 1988, Nature.

[13]  Johan van Benthem,et al.  Modality, Bisimulation and Interpolation in Infinitary Logic , 1999, Ann. Pure Appl. Log..