Package net.automatalib.graph
Interface ProceduralModalProcessGraph<N,L,E,AP,TP extends ProceduralModalEdgeProperty>
-
- Type Parameters:
N
- node typeL
- edge label typeE
- edge typeAP
- atomic proposition typeTP
- edge property type
- All Superinterfaces:
EdgeLabels<E,L>
,FinalNode<N>
,FiniteKripkeStructure<N,E,AP>
,FiniteLabeledGraph<N,E,L>
,FiniteRepresentation
,Graph<N,E>
,IndefiniteGraph<N,E>
,IndefiniteSimpleGraph<N>
,InitialNode<N>
,Iterable<N>
,KripkeInterpretation<N,AP>
,SimpleGraph<N>
,UniversalGraph<N,E,Set<AP>,TP>
,UniversalIndefiniteGraph<N,E,Set<AP>,TP>
- All Known Subinterfaces:
MutableProceduralModalProcessGraph<N,L,E,AP,TP>
- All Known Implementing Classes:
CompactPMPG
public interface ProceduralModalProcessGraph<N,L,E,AP,TP extends ProceduralModalEdgeProperty> extends UniversalGraph<N,E,Set<AP>,TP>, FiniteKripkeStructure<N,E,AP>, FiniteLabeledGraph<N,E,L>, InitialNode<N>, FinalNode<N>
Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking. Note that we use the term process graph from the original paper to prevent confusion with AutomataLib's concept ofTransitionSystem
s.
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from interface net.automatalib.graph.Graph
Graph.IntAbstraction<E>
-
Nested classes/interfaces inherited from interface net.automatalib.graph.UniversalGraph
UniversalGraph.IntAbstraction<E,NP,EP>
-
-
Method Summary
All Methods Instance Methods Default Methods Modifier and Type Method Description default Set<AP>
getAtomicPropositions(N node)
Retrieves the atomic propositions holding at the given node.default VisualizationHelper<N,E>
getVisualizationHelper()
Returns theVisualizationHelper
that contains information for displaying this graph.-
Methods inherited from interface net.automatalib.graph.concept.EdgeLabels
getEdgeLabel
-
Methods inherited from interface net.automatalib.graph.concept.FinalNode
getFinalNode
-
Methods inherited from interface net.automatalib.graph.Graph
getAdjacentNodes, getOutgoingEdges, getOutgoingEdgesIterator
-
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 net.automatalib.graph.concept.InitialNode
getInitialNode
-
Methods inherited from interface java.lang.Iterable
forEach, spliterator
-
Methods inherited from interface net.automatalib.graph.SimpleGraph
getNodes, iterator, nodeIDs, size
-
Methods inherited from interface net.automatalib.graph.UniversalIndefiniteGraph
getEdgeProperty, getNodeProperty
-
-
-
-
Method Detail
-
getAtomicPropositions
default Set<AP> getAtomicPropositions(N node)
Description copied from interface:KripkeInterpretation
Retrieves the atomic propositions holding at the given node.- Specified by:
getAtomicPropositions
in interfaceKripkeInterpretation<N,L>
- Parameters:
node
- the node- Returns:
- the set of atomic propositions that hold at the given node
-
getVisualizationHelper
default VisualizationHelper<N,E> getVisualizationHelper()
Description copied from interface:SimpleGraph
Returns theVisualizationHelper
that contains information for displaying this graph.- Specified by:
getVisualizationHelper
in interfaceGraph<N,L>
- Specified by:
getVisualizationHelper
in interfaceSimpleGraph<N>
- Returns:
- the visualization helper
-
-