Uses of Class
org.tweetyproject.logics.petri.syntax.reachability_graph.Marking

Packages that use Marking

Package	Description
org.tweetyproject.logics.petri.syntax
org.tweetyproject.logics.petri.syntax.reachability_graph

Uses of Marking in org.tweetyproject.logics.petri.syntax

Methods in org.tweetyproject.logics.petri.syntax that return Marking

Modifier and Type	Method	Description
Marking	PetriNet.getMarking()	Get the marking of this graph, based on the current token distribution at the places

Methods in org.tweetyproject.logics.petri.syntax that return types with arguments of type Marking

Modifier and Type	Method	Description
Set<Marking>	PetriNet.getInitialMarkings()

Methods in org.tweetyproject.logics.petri.syntax with parameters of type Marking

Modifier and Type	Method	Description
boolean	PetriNet.addInitialMarking(Marking initialMarking)	add a designated initial marking
boolean	PetriNet.isInitial(Marking marking)	Check whether the marking is an initial marking
void	PetriNet.setState(Marking marking)	Set the state (token distribution) according to the provided marking

Uses of Marking in org.tweetyproject.logics.petri.syntax.reachability_graph

Methods in org.tweetyproject.logics.petri.syntax.reachability_graph that return types with arguments of type Marking

Modifier and Type	Method	Description
Collection<Marking>	ReachabilityGraph.getChildren(Node node)
Graph<Marking>	ReachabilityGraph.getComplementGraph(int selfloops)
Edge<Marking>	ReachabilityGraph.getEdge(Marking a, Marking b)
Set<Marking>	ReachabilityGraph.getInitialMarkings()	Retrieve the designated initial markings
Optional<Marking>	ReachabilityGraph.getMarking(Marking marking)	Retrieve, if present, the marking in this graph that equals the query marking in the sense that both markings describe the same token distribution over places
Collection<Marking>	ReachabilityGraph.getNeighbors(Marking node)
List<Marking>	ReachabilityGraph.getNodes()
Collection<Marking>	ReachabilityGraph.getParents(Node node)
Graph<Marking>	ReachabilityGraph.getRestriction(Collection<Marking> nodes)
Collection<Collection<Marking>>	ReachabilityGraph.getStronglyConnectedComponents()
Collection<Graph<Marking>>	ReachabilityGraph.getSubgraphs()
Iterator<Marking>	ReachabilityGraph.iterator()

Methods in org.tweetyproject.logics.petri.syntax.reachability_graph with parameters of type Marking

Modifier and Type	Method	Description
boolean	ReachabilityGraph.add(Marking node)
boolean	ReachabilityGraph.areAdjacent(Marking a, Marking b)
int	Marking.compareTo(Marking that)
boolean	Marking.equals(Marking marking)	check if this marking deeply equals that marking
boolean	ReachabilityGraph.existsDirectedPath(Marking node1, Marking node2)
Edge<Marking>	ReachabilityGraph.getEdge(Marking a, Marking b)
Optional<Marking>	ReachabilityGraph.getMarking(Marking marking)	Retrieve, if present, the marking in this graph that equals the query marking in the sense that both markings describe the same token distribution over places
Collection<Marking>	ReachabilityGraph.getNeighbors(Marking node)
Set<MarkingEdge>	ReachabilityGraph.getOutgoing(Marking marking)	For one particular marking, retrieve all outgoing edges
boolean	ReachabilityGraph.hasMarking(Marking marking)	Determine if the specified marking is present as a node in the graph
boolean	ReachabilityGraph.isInitial(Marking marking)	Check whether a marking is a designated initial marking

Method parameters in org.tweetyproject.logics.petri.syntax.reachability_graph with type arguments of type Marking

Modifier and Type	Method	Description
boolean	ReachabilityGraph.add(GeneralEdge<Marking> edge)
Graph<Marking>	ReachabilityGraph.getRestriction(Collection<Marking> nodes)

Constructors in org.tweetyproject.logics.petri.syntax.reachability_graph with parameters of type Marking

Modifier	Constructor	Description
	MarkingEdge(Marking from, Marking to, Transition transition)	Create a new instance