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

Authors:
Chih-Hong Cheng;Alois Knoll;Michael Luttenberger;Christian Buckl
Affiliations:
Department of Informatics, Technische Universität München, Garching, Germany;Department of Informatics, Technische Universität München, Garching, Germany;Department of Informatics, Technische Universität München, Garching, Germany;Fortiss GmbH, Guerickestr. 25, München, Germany
Venue:
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
Year:
2011

Citing 5
Cited 2

A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Concurrent reachability games

Theoretical Computer Science
PDDL2.1: an extension to PDDL for expressing temporal planning domains

Journal of Artificial Intelligence Research
GAVS: game arena visualization and synthesis

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Synthesis of fault-tolerant embedded systems using games: from theory to practice

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation

MGSyn: automatic synthesis for industrial automation

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
PRISM-games: a model checker for stochastic multi-player games

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a major revision of the tool GAVS. First, the number of supported games has been greatly extended and now encompasses in addition many classes important for the design and analysis of programs, e.g., it now allows to explore concurrent / probabilistic / distributed games, and games played on pushdown graphs. Second, among newly introduced utility functions, GAVS+ includes features such that the user can now process and synthesize planning (game) problems described in the established STRIPS/PDDL language by introducing a slight extension which allows to specify a second player. This allows researchers in verification to profit from the rich collection of examples coming from the AI community.