Games with Secure Equilibria

Authors:
Krishnendu Chatterjee;Thomas A. Henzinger;Marcin Jurdzinski
Affiliations:
University of California, Berkeley;University of California, Berkeley/ EPFL, Switzerland;University of California, Berkeley/ University of Warwick, UK
Venue:
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Year:
2004

Citing 0
Cited 13

Games in system design and verification

TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Better Quality in Synthesis through Quantitative Objectives

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Generalized parity games

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Admissibility in infinite games

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Assume-guarantee synthesis

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
The complexity of Nash equilibria in infinite multiplayer games

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Computing equilibria in two-player timed games via turn-based finite games

FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Iterated regret minimization in game graphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Nash equilibria for reachability objectives in multi-player timed games

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Rational behaviour and strategy construction in infinite multiplayer games

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A survey of stochastic ω-regular games

Journal of Computer and System Sciences
Robustness of structurally equivalent concurrent parity games

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Strategy logic

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a concise and natural encoding of the spi-calculus into the more basic 驴-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests ...