| AbstractControllableGameSolver<T extends Strategy<?>> |
This class provides an abstract implementation of a controllable game solver.
|
| AbstractGameCreator |
This is an abstract creator for creating games with propositional alphabet
and labels on transitions.
|
| AbstractGameSolver<T extends Strategy<?>> |
This class provides an abstract implementation of a game solver.
|
| BigStepSolver |
This class provides an implementation of the big step solver for parity games
in [Sven Schewe: Solving Parity Games in Big Steps.
|
| BigStepSolver.ApproximateProgressMeasure |
This class provides an approximated progress measure.
|
| BigStepSolver.ApproximateTuple |
This class provides an approximated tuple.
|
| ChainedGameConversion |
This class provides a chained conversion of game types or a sequence of
conversions.
|
| ClassicalBuchiSolver |
This class provides an implementation of the classical algorithm for
Büchi games.
|
| DeadEndSolver |
This class provides a partial solver for any game.
|
| DominionDecompositionSolver |
This class provides an implementation of the subexponential algorithm for
solving parity games (min-even) [Marcin Jurdzinski, Mike Paterson, Uri Zwick:
A Deterministic Subexponential Algorithm for Solving Parity Games.
|
| Game |
A Game is a two-player game.
|
| Game2NMG |
This class provides a conversion from a game to an equivalent NMG.
|
| GameConversion |
A game conversion is a conversion from a game to another game.
|
| GameConversionRepository |
This class provides a repository for conversions of games.
|
| GameEvent<T extends Strategy<?>> |
This class provides events that indicate the progress of a game solver.
|
| GameGeneration |
This class provides methods for generating a game from specified sets of
inputs and outputs.
|
| GameSolverComparator |
This class provides a comparator of game solvers based on their names.
|
| GameSolverRepository |
This class provides a repository of game solvers.
|
| GameSolverWrapper |
This class provides a wrapper for a game and a solver dedicated to solve this
game.
|
| GameState |
A GameState is a state with the player property.
|
| GameTransition |
A GameTransition is nothing more than a normal transition.
|
| GameType |
This interface defines types of games.
|
| GameUtil |
This class collects utility functions specific to games.
|
| GlobalOptimizationSolver |
This class provides a game solver for parity games with global optimizations
that does not depend on any specific game solver.
|
| McNaughtonZielonkaSolver |
This class provides an implementation of the parity game solving procedure
which originates from McNaughton and was first presented for parity games by
Zielonka.
|
| MemoryfulStrategy |
This class provides an implementation of winning strategies with histories.
|
| MemorylessSolution |
This class defines solutions with memoryless strategies.
|
| MemorylessStrategy |
This class provides an implementation of a memoryless strategy for a game
player.
|
| NBG2NMG |
This class provides a conversion from NBG to equivalent NMG.
|
| NBG2NPG |
This class provides a conversion from a Büchi game to a min-even parity
game.
|
| NBGCreator |
This is a creator for creating a nondeterministic Büchi game with
propositional alphabet and labels on transitions.
|
| NCG2NMG |
This class provides a conversion from NCG to equivalent NMG.
|
| NCGCreator |
This is a creator for creating a nondeterministic co-Büchi game with
propositional alphabet and labels on transitions.
|
| NFGCreator |
This is a creator for creating a nondeterministic classic game with
propositional alphabet and labels on transitions.
|
| NGBG2NMG |
This class provides a conversion from NGBG to equivalent NMG.
|
| NGBGCreator |
This is a creator for creating a nondeterministic generalized Büchi game
with propositional alphabet and labels on transitions.
|
| NMG2NPG |
This class provides a conversion from NMG to equivalent NPG.
|
| NMGCreator |
This is a creator for creating a nondeterministic Muller game with
propositional alphabet and labels on transitions.
|
| NPG2NMG |
This class provides a conversion from NPG to equivalent NMG.
|
| NPGCreator |
This is a creator for creating a nondeterministic parity game with
propositional alphabet and labels on transitions.
|
| NPGVerifier |
This class provides a function to verify a memoryless solution for a parity
game.
|
| NREGCreator |
This is a creator for creating a nondeterministic reachability game with
propositional alphabet and labels on transitions.
|
| NRG2NMG |
This class provides a conversion from NRG to equivalent NMG.
|
| NRGCreator |
This is a creator for creating a nondeterministic Rabin game with
propositional alphabet and labels on transitions.
|
| NSG2NMG |
This class provides a conversion from NSG to equivalent NMG.
|
| NSGCreator |
This is a creator for creating a nondeterministic Streett game with
propositional alphabet and labels on transitions.
|
| RandomGame |
This is a generator of games.
|
| ReachabilitySolver |
This class provides a solver for reachability games.
|
| RecursiveSolver |
This class provides a solver for parity games (min-even) by Zielonka's
algorithm.
|
| SimpleDeadEndSolver |
|
| SimpleMcNaughtonZielonkaSolver |
|
| SimpleParityGame |
This class provides a simple structure for parity games.
|
| SimpleSolution |
|
| SimpleStrategy |
This class provides an implementation of memoryless strategy.
|
| SimpleWinningPair |
This class defines a pair of winning region and winning strategy.
|
| SmallProgressMeasureSolver |
This class provides an implementation of the solver for parity games based on
small progress measure in [Marcin Jurdziński: Small Progress Measures
for Solving Parity Games.
|
| SmallProgressMeasureSolver.ProgressMeasure |
A progress measure is a map from a state to its tuple.
|
| SmallProgressMeasureSolver.Tuple |
A tuple for a parity game is an array of integers.
|
| Solution<T extends Strategy<?>> |
This class defines the solutions of game solving.
|
| SolutionColoring |
This class provides methods for coloring a game based on a solution.
|
| WinningPair<T extends Strategy<?>> |
This class defines a pair of winning region and winning strategy.
|