Uses of Interface
net.automatalib.graph.UniversalIndefiniteGraph
-
Packages that use UniversalIndefiniteGraph Package Description net.automatalib.automaton.fsa net.automatalib.automaton.graph net.automatalib.automaton.transducer net.automatalib.brics This package contains adapter classes for treating the Automaton objects from the BRICS library as AutomataLib models.net.automatalib.graph This package (including sub-packages) contains the basic classes concerning graphs.net.automatalib.graph.base net.automatalib.modelchecker.m3c.solver net.automatalib.ts.modal net.automatalib.util.graph.copy -
-
Uses of UniversalIndefiniteGraph in net.automatalib.automaton.fsa
Classes in net.automatalib.automaton.fsa that implement UniversalIndefiniteGraph Modifier and Type Class Description static class
FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>>
-
Uses of UniversalIndefiniteGraph in net.automatalib.automaton.graph
Classes in net.automatalib.automaton.graph that implement UniversalIndefiniteGraph Modifier and Type Class Description class
UniversalAutomatonGraphView<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>>
-
Uses of UniversalIndefiniteGraph in net.automatalib.automaton.transducer
Classes in net.automatalib.automaton.transducer that implement UniversalIndefiniteGraph Modifier and Type Class Description static class
MealyMachine.MealyGraphView<S,I,T,O,A extends MealyMachine<S,I,T,O>>
static class
MooreMachine.MooreGraphView<S,I,T,O,A extends MooreMachine<S,I,T,O>>
static class
SubsequentialTransducer.SSTGraphView<S,I,T,O,A extends SubsequentialTransducer<S,I,T,O>>
-
Uses of UniversalIndefiniteGraph in net.automatalib.brics
Classes in net.automatalib.brics that implement UniversalIndefiniteGraph Modifier and Type Class Description class
AbstractBricsAutomaton.GraphView
-
Uses of UniversalIndefiniteGraph in net.automatalib.graph
Subinterfaces of UniversalIndefiniteGraph in net.automatalib.graph Modifier and Type Interface Description interface
MutableGraph<N,E,NP,EP>
A graph that allows modification.interface
MutableProceduralModalProcessGraph<N,L,E,AP,TP extends MutableProceduralModalEdgeProperty>
A mutable version of theProceduralModalProcessGraph
.interface
MutableUniversalBidirectionalGraph<N,E,NP,EP>
interface
ProceduralModalProcessGraph<N,L,E,AP,TP extends ProceduralModalEdgeProperty>
Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.interface
UniversalBidirectionalGraph<N,E,NP,EP>
interface
UniversalGraph<N,E,NP,EP>
Classes in net.automatalib.graph that implement UniversalIndefiniteGraph Modifier and Type Class Description class
CompactBidiGraph<NP,EP>
class
CompactGraph<NP,EP>
class
CompactPMPG<L,AP>
class
CompactSimpleBidiGraph<EP>
class
CompactSimpleGraph<EP>
class
SimpleMapGraph<N>
A very simple graph realization, where nodes can be arbitrary Java objects. -
Uses of UniversalIndefiniteGraph in net.automatalib.graph.base
Classes in net.automatalib.graph.base that implement UniversalIndefiniteGraph Modifier and Type Class Description class
AbstractCompactBidiGraph<NP,EP>
class
AbstractCompactGraph<E extends CompactEdge<EP>,NP,EP>
-
Uses of UniversalIndefiniteGraph in net.automatalib.modelchecker.m3c.solver
Classes in net.automatalib.modelchecker.m3c.solver that implement UniversalIndefiniteGraph Modifier and Type Class Description class
WitnessTree<L,AP>
A tree-likeGraph
that represents the BFS-style exploration of the tableau generated by theWitnessTreeExtractor
. -
Uses of UniversalIndefiniteGraph in net.automatalib.ts.modal
Classes in net.automatalib.ts.modal that implement UniversalIndefiniteGraph Modifier and Type Class Description static class
ModalTransitionSystem.MTSGraphView<S,I,T,TP extends ModalEdgeProperty,M extends ModalTransitionSystem<S,I,T,TP>>
-
Uses of UniversalIndefiniteGraph in net.automatalib.util.graph.copy
Methods in net.automatalib.util.graph.copy with parameters of type UniversalIndefiniteGraph Modifier and Type Method Description static <N1,E1,N2,E2,NP2,EP2>
Mapping<N1,N2>GraphCopy. copyTraversal(UniversalIndefiniteGraph<N1,E1,? extends NP2,? extends EP2> in, MutableGraph<N2,E2,NP2,EP2> out, TraversalOrder order, int limit, Collection<? extends N1> initialNodes)
static <N1,E1,NP1,EP1,N2,E2,NP2,EP2>
Mapping<N1,N2>GraphCopy. copyUniversalTraversal(UniversalIndefiniteGraph<N1,E1,NP1,EP1> in, MutableGraph<N2,E2,NP2,EP2> out, TraversalOrder order, int limit, Collection<? extends N1> initialNodes, Mapping<? super NP1,? extends NP2> npConversion, Mapping<? super EP1,? extends EP2> epConversion)
-