S
- state classI
- input symbol classT
- transition classSP
- state property classTP
- transition property classpublic interface UniversalDeterministicAutomaton<S,I,T,SP,TP> extends DeterministicAutomaton<S,I,T>, UniversalDTS<S,I,T,SP,TP>, UniversalAutomaton<S,I,T,SP,TP>
DeterministicAutomaton
with state and transition properties.UniversalAutomaton
Modifier and Type | Interface and Description |
---|---|
static interface |
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>
Interface for
full integer abstractions of a
UniversalDeterministicAutomaton . |
static interface |
UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP>
Base interface for
integer abstractions of a
UniversalDeterministicAutomaton . |
static interface |
UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>
Interface for
state integer abstractions of
a UniversalDeterministicAutomaton . |
Modifier and Type | Method and Description |
---|---|
default UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP> |
fullIntAbstraction(Alphabet<I> alphabet)
Retrieves a
SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the mapping induced by the given
alphabet as the abstraction for the input symbols. |
default UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP> |
fullIntAbstraction(int numInputs,
IntFunction<? extends I> symMapping)
Retrieves a
SimpleDeterministicAutomaton.FullIntAbstraction of this automaton, using the given number of
(abstract) inputs and the inputs mapping. |
default UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP> |
stateIntAbstraction()
Retrieves a
SimpleDeterministicAutomaton.StateIntAbstraction of this automaton. |
getTransitionProperty
getSuccessor, getSuccessors, getTransition, getTransitions, transToSet
getInitialState, getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSet
transitionGraphView
createStaticStateMapping, getStates, iterator, size, stateIDs
forEach, spliterator
getStateProperty, getTransitionProperty
getSuccessor, powersetView
createDynamicStateMapping, getSuccessors
default UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP> stateIntAbstraction()
SimpleDeterministicAutomaton
SimpleDeterministicAutomaton.StateIntAbstraction
of this automaton.stateIntAbstraction
in interface DeterministicAutomaton<S,I,T>
stateIntAbstraction
in interface SimpleDeterministicAutomaton<S,I>
SimpleDeterministicAutomaton.StateIntAbstraction
default UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP> fullIntAbstraction(int numInputs, IntFunction<? extends I> symMapping)
SimpleDeterministicAutomaton
SimpleDeterministicAutomaton.FullIntAbstraction
of this automaton, using the given number of
(abstract) inputs and the inputs mapping.fullIntAbstraction
in interface DeterministicAutomaton<S,I,T>
fullIntAbstraction
in interface SimpleDeterministicAutomaton<S,I>
numInputs
- the number of inputs represented in the full abstractionsymMapping
- the mapping from integers in the range [0, numInputs - 1]
to
input symbols.SimpleDeterministicAutomaton.FullIntAbstraction
default UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP> fullIntAbstraction(Alphabet<I> alphabet)
SimpleDeterministicAutomaton
SimpleDeterministicAutomaton.FullIntAbstraction
of this automaton, using the mapping induced by the given
alphabet as the abstraction for the input symbols.
This method is provided for convenience. It is equivalent to calling
fullIntAbstraction(alphabet.size(), alphabet)
.
fullIntAbstraction
in interface DeterministicAutomaton<S,I,T>
fullIntAbstraction
in interface SimpleDeterministicAutomaton<S,I>
alphabet
- the alphabet inducing the abstractionSimpleDeterministicAutomaton.FullIntAbstraction
Copyright © 2015. All rights reserved.