Skip to main content

Rational verification

A key problem in computer science is checking what properties a program or system might exhibit. Typically the approach is to understand whether certain certain states are inevitable, possible, or impossible. In rational verification, we instead ask whether system states could arise through *rational behaviour* by system components. The work combines ideas from game theory and traditional verification, and runs the gamut from theory to implemented systems.



Past Members

Paul Harrenstein
Giuseppe Perelli