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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Cheng, C. H., Knoll, A., Luttenberger, M., & Buckl, C. (2011). GAVS+: An open platform for the research of algorithmic game solving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6605 LNCS, pp. 258–261). https://doi.org/10.1007/978-3-642-19835-9_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
