public class TTTHypothesisDFA<I> extends AbstractTTTHypothesis<I,Boolean,TTTState<I,Boolean>> implements net.automatalib.automata.fsa.DFA<TTTState<I,Boolean>,I>, net.automatalib.automata.UniversalDeterministicAutomaton.FullIntAbstraction<TTTState<I,Boolean>,Boolean,Void>
AbstractTTTHypothesis.GraphView, AbstractTTTHypothesis.TTTEdge<I,D>net.automatalib.automata.UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>, net.automatalib.automata.UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>, net.automatalib.automata.UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>net.automatalib.automata.fsa.FiniteStateAcceptor.FSAGraphView<S,I,A extends net.automatalib.automata.fsa.FiniteStateAcceptor<S,I>>net.automatalib.automata.UniversalDeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends net.automatalib.automata.UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>>alphabet, states| Constructor and Description |
|---|
TTTHypothesisDFA(net.automatalib.words.Alphabet<I> alphabet) |
| Modifier and Type | Method and Description |
|---|---|
net.automatalib.automata.UniversalDeterministicAutomaton.FullIntAbstraction<TTTState<I,Boolean>,Boolean,Void> |
fullIntAbstraction(net.automatalib.words.Alphabet<I> alphabet) |
Boolean |
getStateProperty(int state) |
TTTState<I,Boolean> |
getSuccessor(TTTState<I,Boolean> transition) |
Void |
getTransitionProperty(TTTState<I,Boolean> transition) |
boolean |
isAccepting(TTTState<I,Boolean> state) |
protected TTTState<I,Boolean> |
mapTransition(TTTTransition<I,Boolean> internalTransition) |
protected TTTState<I,Boolean> |
newState(int alphabetSize,
TTTTransition<I,Boolean> parent,
int id) |
addAlphabetSymbol, createState, getInitialState, getInputAlphabet, getInternalTransition, getInternalTransition, getIntInitialState, getIntSuccessor, getStates, getTransition, getTransition, graphView, initialize, isInitialized, numInputs, sizeclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitaccepts, computeOutput, computeStateOutput, computeSuffixOutput, isAcceptingfullIntAbstraction, stateIntAbstractiongetSuccessor, getSuccessors, getTransition, getTransitions, transToSetgetInitialState, getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSettransitionGraphViewcreateStaticStateMapping, getStates, iterator, size, stateIDscreateDynamicStateMapping, getSuccessorsforEach, spliteratorgetTransitionPropertygetSuccessor, getTransitiongetIntSuccessornumInputspublic TTTHypothesisDFA(net.automatalib.words.Alphabet<I> alphabet)
protected TTTState<I,Boolean> mapTransition(TTTTransition<I,Boolean> internalTransition)
mapTransition in class AbstractTTTHypothesis<I,Boolean,TTTState<I,Boolean>>protected TTTState<I,Boolean> newState(int alphabetSize, TTTTransition<I,Boolean> parent, int id)
public net.automatalib.automata.UniversalDeterministicAutomaton.FullIntAbstraction<TTTState<I,Boolean>,Boolean,Void> fullIntAbstraction(net.automatalib.words.Alphabet<I> alphabet)
fullIntAbstraction in interface net.automatalib.automata.DeterministicAutomaton<TTTState<I,Boolean>,I,TTTState<I,Boolean>>fullIntAbstraction in interface net.automatalib.automata.simple.SimpleDeterministicAutomaton<TTTState<I,Boolean>,I>fullIntAbstraction in interface net.automatalib.automata.UniversalDeterministicAutomaton<TTTState<I,Boolean>,I,TTTState<I,Boolean>,Boolean,Void>fullIntAbstraction in class AbstractTTTHypothesis<I,Boolean,TTTState<I,Boolean>>public Boolean getStateProperty(int state)
public Void getTransitionProperty(TTTState<I,Boolean> transition)
getTransitionProperty in interface net.automatalib.automata.UniversalDeterministicAutomaton.IntAbstraction<TTTState<I,Boolean>,Boolean,Void>getTransitionProperty in interface net.automatalib.ts.acceptors.AcceptorTS<TTTState<I,Boolean>,I>getTransitionProperty in interface net.automatalib.ts.UniversalTransitionSystem<TTTState<I,Boolean>,I,TTTState<I,Boolean>,Boolean,Void>Copyright © 2018. All rights reserved.