GAVS: game arena visualization and synthesis

Authors:
Chih-Hong Cheng;Christian Buckl;Michael Luttenberger;Alois Knoll
Affiliations:
Department of Informatics, Technischen Universität München, Garching, Germany;fortiss GmbH, München, Germany;Department of Informatics, Technischen Universität München, Garching, Germany;Department of Informatics, Technischen Universität München, Garching, Germany
Venue:
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Year:
2010

Citing 2
Cited 1

A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research

GAVS+: an open platform for the research of algorithmic game solving

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reasoning on the properties of computer systems can often be reduced to deciding the winner of a game played on a finite graph. In this paper, we introduce GAVS, an open-source tool for the visualization of some of the most fundamental games on finite graphs used in theoretical computer science, including, e.g., reachability games and parity games. The main purpose of GAVS is educational, a fact which is emphasized by the graphical editor for both defining game graphs and also visualizing the computation of the winning sets. Nevertheless, the underlying solvers are implemented with scalability in mind using symbolic techniques where applicable.