Latticed simulation relations and games

Orna Kupferman*, Yoad Lustig

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


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.

Original languageAmerican English
Title of host publicationAutomated Technology for Verification and Analysis - 5th International Symposium, ATVA 2007, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540755951
StatePublished - 2007
Event5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007 - Tokyo, Japan
Duration: 22 Oct 200725 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4762 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th International Symposium on Automated Technology for Verification and Analysis, ATVA 2007


Dive into the research topics of 'Latticed simulation relations and games'. Together they form a unique fingerprint.

Cite this