TY - GEN
T1 - Multi-valued logics, automata, simulations, and games
AU - Kupferman, Orna
AU - Lustig, Yoad
PY - 2008
Y1 - 2008
N2 - Multi-valued systems are systems in which the atomic propositions and the transitions are not Boolean and can take values from some set. Latticed systems, in which the elements in the set are partially ordered, are useful in abstraction, query checking, and reasoning about multiple view-points. For example, abstraction involves systems in which an atomic proposition can take values from {true, unknown, false}, and these values can be partially ordered according to a "being more true" order (true ≤ unknown ≤ false) or according to a "being more informative" order (true ≤ unknown and false ≤ unknown). For Boolean temporal logics, researchers have developed a rich and beautiful theory that is based on viewing formulas as descriptors of languages of infinite words or trees. This includes a relation between temporal-logic formulas and automata on infinite objects, a theory of simulation relation between systems, a theory of two-player games, and a study of the relations among these notions. The theory is very useful in practice, and is the key to almost all algorithms and tools we see today in verification.
AB - Multi-valued systems are systems in which the atomic propositions and the transitions are not Boolean and can take values from some set. Latticed systems, in which the elements in the set are partially ordered, are useful in abstraction, query checking, and reasoning about multiple view-points. For example, abstraction involves systems in which an atomic proposition can take values from {true, unknown, false}, and these values can be partially ordered according to a "being more true" order (true ≤ unknown ≤ false) or according to a "being more informative" order (true ≤ unknown and false ≤ unknown). For Boolean temporal logics, researchers have developed a rich and beautiful theory that is based on viewing formulas as descriptors of languages of infinite words or trees. This includes a relation between temporal-logic formulas and automata on infinite objects, a theory of simulation relation between systems, a theory of two-player games, and a study of the relations among these notions. The theory is very useful in practice, and is the key to almost all algorithms and tools we see today in verification.
UR - http://www.scopus.com/inward/record.url?scp=40549089878&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78163-9_3
DO - 10.1007/978-3-540-78163-9_3
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:40549089878
SN - 3540781625
SN - 9783540781622
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 5
BT - Verification, Model Checking, and Abstract Interpretation - 9th International Conference, VMCAI 2008, Proceedings
T2 - 9th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2008
Y2 - 7 January 2008 through 9 January 2008
ER -