S
- state typeI
- input symbol typeT
- transition typepublic interface DeterministicAutomaton<S,I,T> extends Automaton<S,I,T>, SimpleDeterministicAutomaton<S,I>, DeterministicTransitionSystem<S,I,T>
DeterministicTransitionSystem
with a finite number of states.Modifier and Type | Interface and Description |
---|---|
static interface |
DeterministicAutomaton.FullIntAbstraction<T>
Interface for
full integer abstractions of a DeterministicAutomaton . |
static interface |
DeterministicAutomaton.IntAbstraction<T>
Base interface for
integer abstractions of a DeterministicAutomaton . |
static interface |
DeterministicAutomaton.StateIntAbstraction<I,T>
Interface for
state integer abstractions of a DeterministicAutomaton . |
Modifier and Type | Method and Description |
---|---|
default DeterministicAutomaton.FullIntAbstraction<T> |
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 DeterministicAutomaton.FullIntAbstraction<T> |
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 DeterministicAutomaton.StateIntAbstraction<I,T> |
stateIntAbstraction()
Retrieves a
SimpleDeterministicAutomaton.StateIntAbstraction of this automaton. |
transitionGraphView
createStaticStateMapping, getStates, iterator, size, stateIDs
forEach, spliterator
getSuccessor, getSuccessors, getTransition, getTransitions, transToSet
getSuccessor, powersetView
getInitialState, getInitialStates, getState, getStates, getSuccessor, getSuccessors, stateToSet
createDynamicStateMapping, getSuccessors
default DeterministicAutomaton.FullIntAbstraction<T> 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 SimpleDeterministicAutomaton<S,I>
alphabet
- the alphabet inducing the abstractionSimpleDeterministicAutomaton.FullIntAbstraction
default DeterministicAutomaton.FullIntAbstraction<T> 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 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 DeterministicAutomaton.StateIntAbstraction<I,T> stateIntAbstraction()
SimpleDeterministicAutomaton
SimpleDeterministicAutomaton.StateIntAbstraction
of this automaton.stateIntAbstraction
in interface SimpleDeterministicAutomaton<S,I>
SimpleDeterministicAutomaton.StateIntAbstraction
Copyright © 2019. All rights reserved.