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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
GAVS: Game Arena Visualization and Synthesis, http://www6.in.tum.de/~chengch/gavs/
JDD: Java BDD and Z-BDD library, http://javaddlib.sourceforge.net/jdd/
JGraphX: Java Graph Drawing Component, http://www.jgraph.com/jgraph.html
Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)
Vöge, J., Jurdziński, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202–215. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, CH., Buckl, C., Luttenberger, M., Knoll, A. (2010). GAVS: Game Arena Visualization and Synthesis. In: Bouajjani, A., Chin, WN. (eds) Automated Technology for Verification and Analysis. ATVA 2010. Lecture Notes in Computer Science, vol 6252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15643-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-15643-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15642-7
Online ISBN: 978-3-642-15643-4
eBook Packages: Computer ScienceComputer Science (R0)