| AbstractSimulation |
This class provides a default implementation of Simulation for
FSA. |
| AbstractSimulation2 |
This class provides a default implementation of Simulation2. |
| AltConnectorReducer |
An AltConnectorReducer can reduce alternating connectors that have at
most one successor or have the same successors as other connectors'
successors.
|
| DelayedSimulation |
This class provides methods for the computation of delayed simulation
relations for label-on-transition Büchi automata.
|
| DelayedSimulation.LOSCompoundState |
This class provides the compound state (b, s1, s2) where s1 is a state
from a label-on-state automaton A1 and s2 is a state from a
label-on-state automaton A2.
|
| DelayedSimulation.LOTCompoundState |
This class provides the compound state (s1, s2, a) or (s1, s2) where s1
is a state from a label-on-transition automaton A1, s2 is a state from a
label-on-transition automaton A2, and a is a symbol in the alphabet.
|
| DelayedSimulationOptimizer |
This class provides an implementation of the simplification with delayed
simulation relations in [Kousha Etessami, Thomas Wilke, and Rebecca A.
|
| EfficientDelayedSimulation |
This class provides a much more efficient computation of delayed simulation
compared to DelayedSimulation. |
| EfficientFairSimulation |
This class provides a much more efficient computation of fair simulation
compared to FairSimulation. |
| EfficientSimulation |
This class provides an implementation of the procedure EfficientSimilarity in
[Monika Rauch Henzinger, Thomas A.
|
| EfficientSimulation2 |
This class provides an implementation of the procedure EfficientSimilarity in
[Monika Rauch Henzinger, Thomas A.
|
| FairSimulation |
This class provides methods for the computation of fair simulation relations.
|
| FairSimulation.CompoundState |
This class provides the compound state (s1, s2, a) owned by
GamePlayer#P0 or (s1, s2) owned by GamePlayer#P1 where s1
is a state from an automaton A1, s2 is a state from an automaton A2, and
a is a symbol in the alphabet.
|
| FairSimulationOptimizer |
This class provides an implementation of the simplification with fair
simulation relations in [Sankar Gurumurthy, Roderick Bloem, Fabio Somenzi:
Fair Simulation Minimization.
|
| NaiveSimulation |
This class provides a naive implementation of computing the simulation
relations defined in [Fabio Somenzi and Roderick Bloem.
|
| NaiveSimulation2 |
This class provides an naive implementation for computing the simulation
relation between two automata.
|
| PruningFairSets |
A PruningFairSets object can simplify an NGBW by pruning fair
sets proposed in [Somenzi and Bloom.
|
| PruningFairSetsOptions |
This class provides options for pruning fair sets based on [Somenzi and
Bloom.
|
| RabinIndex |
A RabinIndex object can simplify the acceptance condition of an
NPW by Rabin index [Olivier Carton and Ramón Maceiras.
|
| RefinedSimulation |
This class provides an implementation of the procedure RefinedSimilarity in
[Monika Rauch Henzinger, Thomas A.
|
| RefinedSimulation2 |
This class provides an implementation of the procedure RefinedSimilarity in
[Monika Rauch Henzinger, Thomas A.
|
| SchematicSimulation |
This class provides an implementation of the procedure SchematicSimilarity1
in [Monika Rauch Henzinger, Thomas A.
|
| SchematicSimulation2 |
This class provides an implementation of the procedure SchematicSimilarity1
in [Monika Rauch Henzinger, Thomas A.
|
| SimulationOptimizer |
Use the simulation relations to reduce the state space [Fabio Somenzi and
Roderick Bloem.
|
| SimulationOptimizerOptions |
This class provides options for the simplification by simulation.
|
| SimulationRepository |
This is a repository of simulation computation procedures.
|
| StateReducer |
A StateReducer provides methods for removing dead states and
unreachable states in an automaton.
|
| SupersetReduction |
This class provides a superset reduction for generalized Büchi
acceptance condition.
|
| WringOptimizer |
A WringOptimizer can simplify an automaton by the Wring approach
[Fabio Somenzi and Roderick Bloem.
|