Package net.automatalib.graph
Interface FiniteKripkeStructure<N,E,AP>
-
- Type Parameters:
N
- node classE
- edge classAP
- atomic property class
- All Superinterfaces:
FiniteRepresentation
,Graph<N,E>
,IndefiniteGraph<N,E>
,IndefiniteSimpleGraph<N>
,Iterable<N>
,KripkeInterpretation<N,AP>
,SimpleGraph<N>
- All Known Subinterfaces:
MutableProceduralModalProcessGraph<N,L,E,AP,TP>
,ProceduralModalProcessGraph<N,L,E,AP,TP>
- All Known Implementing Classes:
CompactPMPG
public interface FiniteKripkeStructure<N,E,AP> extends Graph<N,E>, KripkeInterpretation<N,AP>
A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.- See Also:
KripkeInterpretation
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface net.automatalib.graph.Graph
Graph.IntAbstraction<E>
-
-
Method Summary
-
Methods inherited from interface net.automatalib.graph.Graph
getAdjacentNodes, getOutgoingEdges, getOutgoingEdgesIterator, getVisualizationHelper
-
Methods inherited from interface net.automatalib.graph.IndefiniteGraph
getAdjacentNodesIterator, getEdgesBetween, getTarget
-
Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph
createDynamicNodeMapping, createStaticNodeMapping, isConnected
-
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Methods inherited from interface net.automatalib.graph.concept.KripkeInterpretation
getAtomicPropositions
-
Methods inherited from interface net.automatalib.graph.SimpleGraph
getNodes, iterator, nodeIDs, size
-
-