TY - GEN

T1 - Latticed simulation relations and games

AU - Kupferman, Orna

AU - Lustig, Yoad

PY - 2007

Y1 - 2007

N2 - Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed Kripke structures, in which the elements in the set are partially ordered, are useful in abstraction, query checking, and reasoning about multiple view-points. The challenges that formal methods involve in the Boolean setting are carried over, and in fact increase, in the presence of multivalued systems and logics. We lift to the latticed setting two basic notions that have been proven useful in the Boolean setting. We first define latticed simulation between latticed Kripke structures. The relation maps two structures M1 and M2 to a lattice element that essentially denotes the truth value of the statement "every behavior of M1 is also a behavior of M2" We show that latticed-simulation is logically characterized by the universal fragment of latticed μ-calculus, and can be calculated in polynomial time. We then proceed to defining latticed two-player games. Such games are played along graphs in which each transition have a value in the lattice. The value of the game essentially denotes the truth value of the statement "the V-player can force the game to computations that satisfy the winning condition". An earlier definition of such games involved a zig-zagged traversal of paths generated during the game. Our definition involves a forward traversal of the paths, and it leads to better understanding of multi-valued games. In particular, we prove a min-max property for such games, and relate latticed simulation with latticed games.

AB - Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed Kripke structures, in which the elements in the set are partially ordered, are useful in abstraction, query checking, and reasoning about multiple view-points. The challenges that formal methods involve in the Boolean setting are carried over, and in fact increase, in the presence of multivalued systems and logics. We lift to the latticed setting two basic notions that have been proven useful in the Boolean setting. We first define latticed simulation between latticed Kripke structures. The relation maps two structures M1 and M2 to a lattice element that essentially denotes the truth value of the statement "every behavior of M1 is also a behavior of M2" We show that latticed-simulation is logically characterized by the universal fragment of latticed μ-calculus, and can be calculated in polynomial time. We then proceed to defining latticed two-player games. Such games are played along graphs in which each transition have a value in the lattice. The value of the game essentially denotes the truth value of the statement "the V-player can force the game to computations that satisfy the winning condition". An earlier definition of such games involved a zig-zagged traversal of paths generated during the game. Our definition involves a forward traversal of the paths, and it leads to better understanding of multi-valued games. In particular, we prove a min-max property for such games, and relate latticed simulation with latticed games.

UR - http://www.scopus.com/inward/record.url?scp=38149124754&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-75596-8_23

DO - 10.1007/978-3-540-75596-8_23

M3 - Conference contribution

AN - SCOPUS:38149124754

SN - 9783540755951

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 316

EP - 330

BT - Automated Technology for Verification and Analysis - 5th International Symposium, ATVA 2007, Proceedings

PB - Springer Verlag

T2 - 5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007

Y2 - 22 October 2007 through 25 October 2007

ER -