I - input symbol typepublic abstract class AbstractTTTHypothesis<I,D,T> extends Object implements DeterministicAutomaton<TTTState<I,D>,I,T>, FiniteAlphabetAutomaton<TTTState<I,D>,I,T>, DeterministicAutomaton.FullIntAbstraction<T>, SupportsGrowingAlphabet<I>, Serializable
TTT algorithm.| Modifier and Type | Class and Description |
|---|---|
class |
AbstractTTTHypothesis.GraphView |
static class |
AbstractTTTHypothesis.TTTEdge<I,D> |
DeterministicAutomaton.FullIntAbstraction<T>, DeterministicAutomaton.IntAbstraction<T>, DeterministicAutomaton.StateIntAbstraction<I,T>DeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,A extends DeterministicAutomaton.StateIntAbstraction<I,T>>| Modifier and Type | Field and Description |
|---|---|
protected Alphabet<I> |
alphabet |
protected List<TTTState<I,D>> |
states |
INVALID_STATE| Constructor and Description |
|---|
AbstractTTTHypothesis(Alphabet<I> alphabet)
Constructor.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitfullIntAbstraction, stateIntAbstractiongetSuccessor, getSuccessors, getTransitions, transToSetgetInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSettransitionGraphViewtransitionGraphViewgetSuccessor, powersetViewcreateDynamicStateMapping, createStaticStateMapping, iterator, stateIDsgetSuccessorsforEach, spliteratorgetSuccessorpublic T getTransition(int stateId, int symIdx)
getTransition in interface DeterministicAutomaton.FullIntAbstraction<T>public T getTransition(TTTState<I,D> state, I input)
getTransition in interface DeterministicTransitionSystem<TTTState<I,D>,I,T>public TTTTransition<I,D> getInternalTransition(TTTState<I,D> state, I input)
TTTTransition object) for a given state and input.
This method is required since the DFA interface requires the return value of getTransition(TTTState, Object) to refer to the successor state directly.state - the source stateinput - the input symbol triggering the transitionpublic TTTTransition<I,D> getInternalTransition(TTTState<I,D> state, int input)
protected abstract T mapTransition(TTTTransition<I,D> internalTransition)
public TTTState<I,D> initialize()
public boolean isInitialized()
initialize() has been called).true if this automaton was initialized, false otherwise.public Alphabet<I> getInputAlphabet()
getInputAlphabet in interface InputAlphabetHolder<I>public AbstractTTTHypothesis.GraphView graphView()
graphView in interface FiniteAlphabetAutomaton<TTTState<I,D>,I,T>graphView in interface GraphViewablepublic int getIntInitialState()
getIntInitialState in interface SimpleDeterministicAutomaton.IntAbstractionpublic int numInputs()
numInputs in interface SimpleDeterministicAutomaton.FullIntAbstractionpublic int getIntSuccessor(T trans)
getIntSuccessor in interface DeterministicAutomaton.IntAbstraction<T>public DeterministicAutomaton.FullIntAbstraction<T> fullIntAbstraction(Alphabet<I> alphabet)
fullIntAbstraction in interface DeterministicAutomaton<TTTState<I,D>,I,T>fullIntAbstraction in interface SimpleDeterministicAutomaton<TTTState<I,D>,I>public void addAlphabetSymbol(I symbol)
addAlphabetSymbol in interface SupportsGrowingAlphabet<I>public Collection<TTTState<I,D>> getStates()
public int size()
size in interface SimpleAutomaton<TTTState<I,D>,I>size in interface SimpleDeterministicAutomaton.IntAbstractionCopyright © 2020. All rights reserved.