Index (CSTNU-Tool 4.12 API)

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Ε
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form

A

absent - Enum constant in enum class it.univr.di.labeledvalue.ALabel.State: Not present.
ABSENT - Static variable in class it.univr.di.labeledvalue.Literal: On 20171027 using VisualVM it has been shown that representing the state values of a literal using an enum consumes a lot of memory in this kind of application.
Therefore, I decided to simplify the representation using 4 constants value: ABSENT, Literal.STRAIGHT, Literal.NEGATED, and Literal.UNKNOWN.
AbstractComponent - Class in it.univr.di.cstnu.graph: Abstract component as base class for nodes and edges.
AbstractComponent() - Constructor for class it.univr.di.cstnu.graph.AbstractComponent: Minimal constructor.
AbstractComponent(Component) - Constructor for class it.univr.di.cstnu.graph.AbstractComponent: Constructor to clone the component.
AbstractComponent(String) - Constructor for class it.univr.di.cstnu.graph.AbstractComponent: Creates a component with name n if not null, otherwise with a unique name "c<int>".
AbstractCSTN<E> - Class in it.univr.di.cstnu.algorithms: Core class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
AbstractCSTN() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN: Default constructor.
AbstractCSTN(TNGraph<E>) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN: Initialize the CSTN using graph.
For saving the resulting graph in a file during/after a check, field AbstractCSTN.fOutput must be set.
AbstractCSTN(TNGraph<E>, int) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN: Initialize the CSTN using graph.
For saving the resulting graph in a file during/after a check, field AbstractCSTN.fOutput must be set.
AbstractCSTN.CheckAlgorithm - Enum Class in it.univr.di.cstnu.algorithms: Only for stating which kind of DC checking algorithms have been implemented so far.
AbstractCSTN.CSTNCheckStatus - Class in it.univr.di.cstnu.algorithms: Represents the status of a CSTN-checking algorithm during an execution.
AbstractCSTN.DCSemantics - Enum Class in it.univr.di.cstnu.algorithms: Value for dcSemantics
AbstractCSTN.EdgesToCheck<E> - Class in it.univr.di.cstnu.algorithms: Simple class to maintain the set of edges to check in the following phase.
AbstractCSTN.NodesToCheck - Class in it.univr.di.cstnu.algorithms: Acts as a queue and a set.
AbstractEdge - Class in it.univr.di.cstnu.graph: Base class for implementing LabeledIntEdge.
AbstractEdge() - Constructor for class it.univr.di.cstnu.graph.AbstractEdge: Minimal constructor.
AbstractEdge(Edge) - Constructor for class it.univr.di.cstnu.graph.AbstractEdge: Creates a new edge cloning e if not null.
AbstractEdge(String) - Constructor for class it.univr.di.cstnu.graph.AbstractEdge: Creates an edge with name n and type Edge.ConstraintType.requirement.
AbstractLabeledIntMap - Class in it.univr.di.labeledvalue: Abstract class for LabeledIntMap interface.
AbstractLabeledIntMap() - Constructor for class it.univr.di.labeledvalue.AbstractLabeledIntMap
AbstractNode - Class in it.univr.di.cstnu.graph: Base class for implementing Node.
AbstractNode() - Constructor for class it.univr.di.cstnu.graph.AbstractNode: Minimal constructor.
AbstractNode(Node) - Constructor for class it.univr.di.cstnu.graph.AbstractNode: Constructor to clone the component.
AbstractNode(String) - Constructor for class it.univr.di.cstnu.graph.AbstractNode: Simplified constructor
activationNode - Variable in class it.univr.di.cstnu.algorithms.CSTNPSU: Utility map that returns the activation time point (node) associated to a contingent link given the contingent time point, i.e., contingent link A===>C determines the entry (C,A) in this map.
activationNode - Variable in class it.univr.di.cstnu.algorithms.CSTNU: Utility map that returns the activation time point (node) associated to a contingent link given the contingent time point, i.e., contingent link A===>C determines the entry (C,A) in this map.
activationNode - Variable in class it.univr.di.cstnu.algorithms.OSTNU: Utility map that returns the activation time point (node) associated to a contingent link given the contingent time point, i.e., contingent link A===>C determines the entry (C,A) in this map.
activationNode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink: Returns the value of the activationNode record component.
ActiveWaits - Class in it.univr.di.cstnu.util: Active wait of a timepoint.
Scope of this class is to maintain the list of active waits for a node allowing a fast determination of the greatest wait and fast removing of useless waits.
For these reasons, a max priority queue with key the wait value and value the associated contingent node is used.
Since the library has a min priority queue implementation, I reuse it making it private and giving all the proper methods for manipulating it as max priority queue.
ActiveWaits() - Constructor for class it.univr.di.cstnu.util.ActiveWaits
add(E, LabeledNode, LabeledNode, LabeledNode, TNGraph<E>, boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck: Check if the edge that has to be added has one end-point that is an observer.
add(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
add(K) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
add(T) - Method in class it.univr.di.cstnu.util.ObjectPair
addAll(Collection<? extends LabeledNode>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
addAll(Collection<? extends K>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
addAll(Collection<? extends T>) - Method in class it.univr.di.cstnu.util.ObjectPair
addAll(Collection<E>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck: Add a set of edges without any check.
addChildToObserverNode(LabeledNode, char) - Method in class it.univr.di.cstnu.graph.TNGraph: Add child to obs.
addChildToObserverNode(LabeledNode, char) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
addEdge(E, Pair<? extends LabeledNode>) - Method in class it.univr.di.cstnu.graph.TNGraph: Unsupported
addEdge(E, Pair<? extends LabeledNode>, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph
addEdge(E, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph: Adds the edge if there not exist an edge between v1 and v2.
addEdge(E, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Adds the edge to this graph.
addEdge(E, LabeledNode, LabeledNode, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph
addEdge(E, String, String) - Method in class it.univr.di.cstnu.graph.TNGraph: Optimized method for adding edge.
addEdge(E, Collection<? extends LabeledNode>) - Method in class it.univr.di.cstnu.graph.TNGraph: Unsupported
addEdge(E, Collection<? extends LabeledNode>, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph: Unsupported
addEdge(K, Pair<? extends LabeledNode>, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
addEdge(K, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
addEdge(K, LabeledNode, LabeledNode, EdgeType) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
addEdge(K, String, String) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
addNegativeScenario(Label) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: Adds to negative scenarios maintain minimal the representation of the set.
addNode(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Adds node to the set of nodes.
addObserver(String, PropertyChangeListener) - Method in class it.univr.di.cstnu.graph.AbstractComponent: An observer for the property.
addUpperBounds() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: The upper bounds from Z to each node have to be set after the horizon is determined.
addVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph: Adds the given vertex to the graph.
addVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
addWait(LabeledNode, int) - Method in class it.univr.di.cstnu.util.ActiveWaits: Add an active wait represented as (Contingent, positive value) to the queue.
addWeakOrdinaryConstraints(ObjectList<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU: It makes sanity check fixing each wait (V, C:-v, A) if v≤x or v>y.
agileControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.OSTNU: Checks the agile controllability (AC) of the given network (see OSTNU(TNGraph) or AbstractCSTN.setG(TNGraph)).
If the network is AC, it determines all the minimal ranges for the constraints.
aLabel - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
ALabel - Class in it.univr.di.labeledvalue: Simple class to represent a A-label in the CSTNU framework.
ALabel(ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabel: Default constructor using a given alphabet.
ALabel(ALabelAlphabet.ALetter, ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabel: Builds an a-label using the a-letter 'l' and 'alphabet'.
ALabel(String, ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabel: Helper constructor.
ALABEL_RE - Static variable in class it.univr.di.labeledvalue.ALabel: Regular expression representing an A-Label.
ALABEL_SEPARATOR - Static variable in class it.univr.di.labeledvalue.ALabel: ALabel separator '∙'.
ALABEL_SEPARATORstring - Static variable in class it.univr.di.labeledvalue.ALabel: ALabel separator '∙'.
ALabel.EmptyLabel - Class in it.univr.di.labeledvalue: An unmodifiable empty label.
ALabel.State - Enum Class in it.univr.di.labeledvalue: Possible state of a ALabelAlphabet.ALetter in an alphabetic label.
ALabelAlphabet - Class in it.univr.di.labeledvalue: A customizable alphabet, where elements are strings.
ALabelAlphabet() - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet: Default constructor.
ALabelAlphabet(int) - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet
ALabelAlphabet(ALabelAlphabet) - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet: Constructor by copy.
ALabelAlphabet.ALetter - Class in it.univr.di.labeledvalue: ALetter makes simpler to check if a node name is appropriate.
ALetter(String) - Constructor for class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
ALETTER - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet: A-Letter.
ALETTER_RANGE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet: A-Letter range.
allComponentsOfBaseGenerator(char[]) - Static method in class it.univr.di.labeledvalue.Label: A base is a set of same-length labels that are can be used to build any other greater-length label of the universe.
AllPairsShortestPaths - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm: All-Pairs-Shortest-Paths
alreadyAddAllIncidentsToZ - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
alreadyRepresents(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
alreadyRepresents(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
alreadyRepresents(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
alreadyRepresents(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
alreadyRepresents(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
AND - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga: Token to represent logic AND in Tiga expression.
applyFastDispatchSTNU(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU: FD_STNU algorithm for checking the DC of the network and making it dispatchable (if DC).
applyMinDispatchableESTNU() - Method in class it.univr.di.cstnu.algorithms.STNU: Makes the current DC network dispatchable removing all the dominated edges (ordinaries or waits).
applyMorris2014() - Method in class it.univr.di.cstnu.algorithms.STNU: Morris' 2014 algorithm to check the dynamic controllability of an STNU.
applyMorris2014Dispatchable() - Method in class it.univr.di.cstnu.algorithms.STNU: Morris' 2014 algorithm to check the dynamic controllability (DC) of an STNU.
applyNormalForm() - Method in class it.univr.di.cstnu.algorithms.STNU: The equivalent normal-form of the distance graph associated to a STNU.
applyR0R3(CSTNEdge, LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTN: Applies R0 and R3 to the edge AB.
applyRul2018() - Method in class it.univr.di.cstnu.algorithms.STNU: RUL^- algorithm by Cairo, Hunsberger, and Rizzi, presented in Faster dynamic controllability checking for simple temporal networks with uncertainty at TIME 2018.
applyRul2021() - Method in class it.univr.di.cstnu.algorithms.STNU: Luke Hunsberger version of RUL^- algorithm.
APSP_FloydWarshall(TNGraph<E>, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines the minimal distance between all pair of nodes (all-pair-shortest-paths (APSP)) using the Floyd-Warshall algorithm.
If the graph contains a negative cycle, it returns false and the graph contains the edges that have determined the negative cycle.
APSP_Johnson(TNGraph<E>, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines the minimal distance between all pair of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
areComplement(char, char) - Static method in class it.univr.di.labeledvalue.Literal

B

backingArray - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: The backing array.
BannisterEppstein - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm
base - Variable in class it.univr.di.labeledvalue.LabeledIntTreeMap: Set of propositions forming a base for the labels of the map.
BASE_DIR_NAME - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Name of the root directory
BASE_DIR_NAME - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Name of the root directory
BASE_DIR_NAME - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Name of the root directory
baseDirName - Variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Base directory for saving the random instances.
baseDirName - Variable in class it.univr.di.cstnu.util.STNURandomGenerator: Base directory for saving the random instances.
BasicCSTNUEdge - Interface in it.univr.di.cstnu.graph: Represents the behavior of a CSTNU edge.
BasicCSTNUEdgePluggable - Class in it.univr.di.cstnu.graph: An implementation of CSTNUEdge where the labeled value set can be plugged during the creation.
BasicCSTNUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
BasicCSTNUEdgePluggable(Edge, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
BasicCSTNUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
BasicCSTNUEdgePluggable(String, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
BasicCSTNUEdgePluggable.InternalEntry - Class in it.univr.di.cstnu.graph: Represents a pair (Label, String).
BellmanFord - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm: Bellman-Ford
BellmanFordSingleSink - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm: Bellman-Ford
BFCT - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm: SSSP_BFCT
buildAPairRndCSTNInstances(boolean) - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Builds a pair of DC and not DC of CSTN instances using the building parameters.
buildRenderContext(VisualizationViewer<LabeledNode, E>, boolean) - Method in class it.univr.di.cstnu.visualization.TNEditor: Adds vertex and edges renders, tooltips and mouse behavior to a viewer.

C

caseLabel - Variable in class it.univr.di.cstnu.graph.STNUEdgeInt: The upper/lower case label.
CaseLabel(STNUEdge.CaseLabel) - Constructor for class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
CaseLabel(ALabelAlphabet.ALetter, boolean) - Constructor for class it.univr.di.cstnu.graph.STNUEdge.CaseLabel: A lower/upper-case label.
charValue(int) - Static method in class it.univr.di.labeledvalue.Literal
check(char) - Static method in class it.univr.di.labeledvalue.Literal
CHECK_ACTIVATION_UNIQUENESS(LabeledNode, LabeledNode, Object2ObjectMap<LabeledNode, LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STNU: Checks if the activation node is already an activation node for another contingent node.
checkAlgorithm - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus: Which algorithm was used to check the network last time.
checkAndManageIfNewLabeledValueIsANegativeLoop(int, LabeledNode, LabeledNode, BasicCSTNUEdge, AbstractCSTN.CSTNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.CSTNU: Just to check if a new labeled value is negative, its label has not unknown literals, and it is in a self loop.
checkAndManageIfNewLabeledValueIsANegativeLoop(int, Label, LabeledNode, LabeledNode, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Checks if a new labeled value is negative and represents a negative cycle.
checkedGraph - Variable in class it.univr.di.cstnu.visualization.TNEditor: TNGraph structures necessary to represent derived graph.
Checker - Class in it.univr.di.cstnu.util: Simple class to determine the average execution time (and std dev) of the (C)STN(U) DC checking algorithm on a given set of (C)STN(U)s.
Checker() - Constructor for class it.univr.di.cstnu.util.Checker
Checker.GlobalStatisticKey - Class in it.univr.di.cstnu.util: Utility internal class to store #contingent, #nodes, and #propositions and allows the ordering among objects of this class.
checkGuardedLinkBounds(LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, AbstractCSTN.CSTNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU: A ---(u, alpha)---> C ---(v, beta)---> A If u+v < 0, raise non controllability status of the guarded link.
checkingAlgCSTNComboBox - Variable in class it.univr.di.cstnu.visualization.TNEditor: Drop-down list for selecting CSTN CheckingAlgorithm
checkModifiers(MouseEvent) - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
checkModifiers(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin: Overridden to be more flexible, and pass events with key combinations.
checkStatus - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: Check status
checkStatus - Variable in class it.univr.di.cstnu.algorithms.OSTNU: Agile status
checkStatus - Variable in class it.univr.di.cstnu.algorithms.STN: Check status
checkTimeOutAndAdjustStatus(Instant) - Method in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: If current instant is after the timeoutInstant, it adjust this object setting to true timeout and to false consistency, finished.
checkWellDefinitionProperties() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: checkWellDefinitionProperties.
checkWellDefinitionProperty1and3(LabeledNode, LabeledNode, E, boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Checks whether the constraint represented by an edge 'e' satisfies the well definition 1 property (WD1):
any labeled valued of the edge has a label that subsumes both labels of two endpoints. In case a label is not WD1 and hasToBeFixed, then it is fixed.
checkWellDefinitionProperty1and3(LabeledNode, LabeledNode, CSTNUEdge, boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Calls and, then, checks upper and lower case values.
checkWellDefinitionProperty2(LabeledNode, boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Checks whether the label of a node satisfies the well definition 2 property (WD2):
For each literal present in a node label label: the label of the observation node of the considered literal is subsumed by the label of the current node.
choice(STNURTE.NodeEnabledInTimeInterval) - Method in interface it.univr.di.cstnu.algorithms.STNURTE.NodeAndExecutionTimeChoice
cleanCheckedInstance - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: If true, after a check, the resulting graph is cleaned: all empty edges or labeled values containing unknown literals are removed.
cleanCheckedInstance - Variable in class it.univr.di.cstnu.algorithms.STN
cleanResult - Variable in class it.univr.di.cstnu.visualization.TNEditor: Cleaned result.
clear() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck: Clear the set.
clear() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck: Clear the set.
clear() - Method in class it.univr.di.cstnu.graph.AbstractComponent
clear() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
clear() - Method in interface it.univr.di.cstnu.graph.Component: Clear all component but name.
clear() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Clear all component but name.
clear() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
clear() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
clear() - Method in class it.univr.di.cstnu.graph.LabeledNode: Clears all fields but name.
clear() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
clear() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
clear() - Method in class it.univr.di.cstnu.graph.TNGraph: clear all internal structures.
clear() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Makes this graph empty.
clear() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Clear all structures.
clear() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Makes the queue empty.
clear() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
clear() - Method in class it.univr.di.cstnu.util.ObjectPair
clear() - Method in class it.univr.di.labeledvalue.ALabel: Makes the label empty.
clear() - Method in class it.univr.di.labeledvalue.ALabelAlphabet: Cleans the map.
clear() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
clear() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
clear() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode: Clear all internal objects making them empty.
clear() - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Remove all entries of the map.
clear() - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView
clear() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
clear() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
clear(int) - Method in class it.univr.di.cstnu.graph.TNGraph: Clear all internal structures.
clear(int) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported
clearCache() - Method in class it.univr.di.cstnu.graph.TNGraph: Clear all internal caches.
clearCache() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
clearLowerCaseValues() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge: Clears the labeled lower case values.
clearLowerCaseValues() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
clearLowerCaseValues() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
clearPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode: Clears all fields about potential values.
clearPredecessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Clears all predecessors of the given node.
clearUpperCaseValues() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge: Clears all upper case labeled values.
clearUpperCaseValues() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
clone(ALabel) - Static method in class it.univr.di.labeledvalue.ALabel: In order to have a correct copy of an a-label.
CLOSE_PAIR - Static variable in class it.univr.di.labeledvalue.Constants: Char representing labeled-value closing ")".
CLOSE_TUPLE - Static variable in class it.univr.di.labeledvalue.Constants: A tuple closing char
COLLAPSE_RIGID_COMPONENT(ObjectList<ObjectList<LabeledNode>>) - Method in class it.univr.di.cstnu.algorithms.STN: Collapses rigid components of the current STN.
COLLAPSE_RIGID_COMPONENT(TNGraph<E>, Object2ObjectMap<LabeledNode, LabeledNode>, Object2IntMap<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STN: Collapses given rigid components (RC) rerouting, in each RC, all edges to/from nodes in RC to the representative node of RC.
collapseRigidComponents(Object2ObjectMap<LabeledNode, LabeledNode>, Object2IntMap<LabeledNode>, ObjectSet<E>, ObjectList<E>) - Method in class it.univr.di.cstnu.algorithms.STNU: Collapses given rigid components (RC) rerouting, in each RC, all edges to/from nodes in RC to the representative node of RC.
comparator() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
comparator() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: This implementation returns null (FIFO queues have no comparator).
compareTo(Object2ObjectMap.Entry<Label, ALabel>) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
compareTo(STNURTE.NodeWithTimeInterval) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval
compareTo(Checker.GlobalStatisticKey) - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey: The order is respect to #nodes,#contingents, and #propositions.
compareTo(ALabel) - Method in class it.univr.di.labeledvalue.ALabel: In order to speed up this method and considering that the ALabelAlphabet order may be not the expected alphabetic one, (first letter in an ALabelAlphabet can be 'nodeZ' and the last one 'aNode'), the order of labels is given w.r.t.
compareTo(ALabel) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
compareTo(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
compareTo(Label) - Method in class it.univr.di.labeledvalue.Label: Determines an order based on length of label.
compareTo(LabeledIntHierarchyMap.HierarchyNode) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode: * In order to minimize the number of insertions, it is better to have sons ordered in inverted lexicographical order.
compareTo(Literal) - Method in class it.univr.di.labeledvalue.Literal
compareTo(Object) - Method in class it.univr.di.cstnu.graph.AbstractComponent
Component - Interface in it.univr.di.cstnu.graph: Component interface.
configureSubNetworks(ObjectList<CSTNPSU.PrototypalLink>, int) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: Checks if current network can be embedded with subnetworks represented by subNetworks.
conjoin(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel: Conjoins a-letter to this.
conjoin(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
conjunction(char, char) - Method in class it.univr.di.labeledvalue.Label: It returns a new label conjunction of proposition and this if this is consistent with proposition and its propositionState.
conjunction(ALabel) - Method in class it.univr.di.labeledvalue.ALabel: Conjoins a-label to this and returns the result without modifying this.
conjunction(ALabel) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
conjunction(Label) - Method in class it.univr.di.labeledvalue.Label: Conjuncts label to this if this is consistent with label and returns the result without modifying this.
conjunction(Literal) - Method in class it.univr.di.labeledvalue.Label: Helper method for Label.conjunction(char, char)
conjunctionExtended(char, char) - Method in class it.univr.di.labeledvalue.Label: It returns the conjunction of proposition to this.
conjunctionExtended(Label) - Method in class it.univr.di.labeledvalue.Label: Create a new label that represents the conjunction of this and label using also Literal.UNKNOWN literals.
conjunctionExtended(Literal) - Method in class it.univr.di.labeledvalue.Label: Helper method Label.conjunctionExtended(char, char)
consideredLabeledValue - Variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Maintains log of labeled values that have been already inserted and, therefore, cannot be reinserted.
consideredLowerCaseValue - Variable in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable: The CSTNU controllability check algorithm needs to know if a labeled value has been already considered in the past in order to avoid to add it a second time.
consideredUpperCaseValue - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable: The CSTNU controllability check algorithm needs to know if a labeled value has been already considered in the past in order to avoid to add it a second time.
consistency - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: Consistency status (it is assumed true at the initialization).
consistencyCheck() - Method in class it.univr.di.cstnu.algorithms.STN: Checks the consistency of this STN instance within STN.timeOut seconds using the algorithm STN.getDefaultConsistencyCheckAlg().
consistencyCheck(STN.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STN: Checks the consistency of this STN instance using algorithm alg.
Constants - Class in it.univr.di.labeledvalue: Some useful constants for the package.
constraintEdgeStroke - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering: Simple stroke object to draw a 'standard' type edge.
constraintType - Variable in class it.univr.di.cstnu.graph.AbstractEdge: The type of the edge.
contains(char) - Method in class it.univr.di.labeledvalue.Label
contains(ALabel) - Method in class it.univr.di.labeledvalue.ALabel: L₁ contains L₂ if L₁ contains all a-letters of L₂.
contains(ALabel) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
contains(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel
contains(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
contains(Literal) - Method in class it.univr.di.labeledvalue.Label
contains(Object) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
contains(Object) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
contains(Object) - Method in class it.univr.di.cstnu.util.ObjectPair
containsAll(Collection<?>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
containsAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
containsAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectPair
containsEdge(E) - Method in class it.univr.di.cstnu.graph.TNGraph
containsUnknown() - Method in class it.univr.di.labeledvalue.Label
containsValue(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
containsVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
CONTINGENCY_SYMBOL - Static variable in class it.univr.di.labeledvalue.Constants: Char representing the contingency symbol (0x2B0D): ↕︎
contingent - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType: The edge represent a contingent constraint.
contingentAlsoAsOrdinary - Variable in class it.univr.di.cstnu.algorithms.CSTNU: Represent contingent links also as ordinary constraints.
contingentAlsoAsOrdinary - Variable in class it.univr.di.cstnu.algorithms.OSTNU: Represent contingent links also as ordinary constraints.
contingentAlsoAsOrdinary - Variable in class it.univr.di.cstnu.visualization.TNEditor: True if contingent link as to be represented also as ordinary constraints.
contingentEdgeStroke - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering: Simple stroke object to draw a 'standard' type edge.
ContingentLink(LabeledNode, int, int, LabeledNode) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink: Creates an instance of a ContingentLink record class.
contingentNode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink: Returns the value of the contingentNode record component.
contingents - Variable in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey: # contingents
controlSouthPanel - Variable in class it.univr.di.cstnu.visualization.TNEditor
copy(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph: Defensive copy of all internal structures of g into this.
copy(TNGraph<K>) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
copyCleaningRedundantLabels(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph: Makes a copy as TNGraph.copy(TNGraph) removing all labeled values having unknown literal(s) or -∞ value.
copyCleaningRedundantLabels(TNGraph<K>) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph: Unsupported.
coreCSTNInitAndCheck() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Makes the CSTN well-definedness check and initialization.
coreSTNInitAndCheck() - Method in class it.univr.di.cstnu.algorithms.STN: Makes the STN check and initialization.
count - Variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap: The number of elements in the map
create(ALabel, int, Label) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue: Creates a lower-case value.
create(LabeledLowerCaseValue) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue: Copy constructor.
crossCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus: Counters about the # of application of different rules.
crossCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: Counters about the # of application of different rules.
cstn - Variable in class it.univr.di.cstnu.visualization.TNEditor: CSTN checker
CSTN - Class in it.univr.di.cstnu.algorithms: Represents a Conditional Simple Temporal Network (CSTN) and it contains a method to check the dynamic consistency of the instance.
Edge weights are signed integer.
This class is the base class for 9 classes for CSTNs: each class is a specialization of this one where some assumptions about the system reaction type and/or the presence or not of labels on nodes are done.
In more details, in this class the dynamic consistency (DC) check is done assuming the standard DC semantics (a system reacts to the observations after a small but not quantified delay (cf.
CSTN - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
CSTN() - Constructor for class it.univr.di.cstnu.algorithms.CSTN: Default constructor.
CSTN(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTN: Initialize the CSTN using graph.
For saving the resulting graph in a file during/after a check, field AbstractCSTN.fOutput must be set.
CSTN(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTN: Initialize the CSTN using graph.
For saving the resulting graph in a file during/after a check, field AbstractCSTN.fOutput must be set.
CSTN_CLASS - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Checker
CSTN2CSTN0 - Class in it.univr.di.cstnu.algorithms: Simple class to represent and check Conditional Simple Temporal Network assuming epsilon semantics and reducing an instance to an appropriate CSTN where DC checking is made assuming instantaneous reaction semantics.
CSTN2CSTN0(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTN2CSTN0
CSTN2CSTN0(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTN2CSTN0
cstnCheckAlg - Variable in class it.univr.di.cstnu.visualization.TNEditor: Which check alg for CSTN
CSTNCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus
cstnDCSemanticsComboBox - Variable in class it.univr.di.cstnu.visualization.TNEditor: semantic combo for CSTN
CSTNEdge - Interface in it.univr.di.cstnu.graph: Represents the behavior of a CSTN edge.
CSTNEdgePluggable - Class in it.univr.di.cstnu.graph: An implementation of CSTNEdge where the labeled value set can be configured at source level.
CSTNEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable
CSTNEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable: A simple constructor cloner.
CSTNEdgePluggable(Edge, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable: A simple constructor cloner.
CSTNEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable: Constructor for LabeledIntEdge.
CSTNEdgePluggable(String, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNEdgePluggable: Constructor for LabeledIntEdge.
cstnEditor - Variable in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin: The editor in which this plugin works.
cstnEditor - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse: Internal reference to the main JFrame.
CSTNEpsilon - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilon() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon: Default constructor.
CSTNEpsilon(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon: Constructor for CSTN.
CSTNEpsilon(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon: Constructor for CSTN.
CSTNEpsilon3R - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilon3R() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3R: Default constructor.
CSTNEpsilon3R(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3R: Constructor for CSTN with reaction time at least epsilon and without node labels.
CSTNEpsilon3R(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3R
CSTNEpsilon3RwoNodeLabels - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilon3RwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels: Default constructor.
CSTNEpsilon3RwoNodeLabels(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels: Constructor for CSTN with reaction time at least epsilon and without node labels.
CSTNEpsilon3RwoNodeLabels(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels
CSTNEpsilonwoNodeLabels - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilonwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels: Default constructor.
CSTNEpsilonwoNodeLabels(int, TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels: Constructor for CSTN with reaction time at least epsilon and without node labels.
CSTNEpsilonwoNodeLabels(int, TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels: Constructor for CSTN with reaction time at least epsilon and without node labels.
CSTNIR - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIR() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR: Default constructor.
CSTNIR(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR: Constructor for CSTN.
CSTNIR(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR
CSTNIR3R - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIR3R() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3R
CSTNIR3R(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3R
CSTNIR3R(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3R
CSTNIR3RwoNodeLabels - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIR3RwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels: Default constructor.
CSTNIR3RwoNodeLabels(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels: Constructor for
CSTNIR3RwoNodeLabels(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels
CSTNIRwoNodeLabels - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIRwoNodeLabels() - Constructor for class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels: Default constructor.
CSTNIRwoNodeLabels(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels: Constructor for
CSTNIRwoNodeLabels(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels
CSTNLayout - Class in it.univr.di.cstnu.visualization: Allows the layout of a CSTN(U) determined by transforming a workflow generated by Atapis Random generator tool.
CSTNLayout(Graph<LabeledNode, CSTNEdge>) - Constructor for class it.univr.di.cstnu.visualization.CSTNLayout: Creates an instance for the specified graph and default size; vertex locations are determined by CSTNLayout.positionInitializer.
CSTNLayout(Graph<LabeledNode, CSTNEdge>, Dimension) - Constructor for class it.univr.di.cstnu.visualization.CSTNLayout: Creates an instance for the specified graph and size.
CSTNPotential - Class in it.univr.di.cstnu.algorithms: Represents a Conditional Simple Temporal Network (CSTN) and it contains a method to check the dynamic consistency of the instance.
CSTNPotential() - Constructor for class it.univr.di.cstnu.algorithms.CSTNPotential: Default constructor.
CSTNPotential(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPotential: Constructor for CSTNPotential.
CSTNPotential(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPotential: Constructor for CSTNPotential.
cstnpsu - Variable in class it.univr.di.cstnu.visualization.TNEditor: CSTNPSU checker
CSTNPSU - Class in it.univr.di.cstnu.algorithms: Represents and checks streamlined Conditional Simple Temporal Network with Partial Shrinkable Uncertainty (CSTNPSU).
CSTNPSU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType: FTNU === CSTNPSU
CSTNPSU() - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU: Default constructor, package use only!
CSTNPSU(TNGraph<CSTNPSUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU: Constructor for CSTNPSU
CSTNPSU(TNGraph<CSTNPSUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU: Constructor for CSTNPSU
CSTNPSU(String) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU: Helper constructor for CSTNPSU.
CSTNPSU.PrototypalLink - Class in it.univr.di.cstnu.algorithms: Represents a prototypal link.
CSTNPSUEdge - Interface in it.univr.di.cstnu.graph: Represents the behavior of a CSTNPSU edge.
CSTNPSUEdgePluggable - Class in it.univr.di.cstnu.graph: An implementation of CSTNUEdge where the labeled value set can be plugged during the creation.
CSTNPSUEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
CSTNPSUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable: Constructor to clone the component.
CSTNPSUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
CSTNRandomGenerator - Class in it.univr.di.cstnu.util: Allows one to build random CSTN instances specifying:
CSTNRandomGenerator(int, int, int, int, int, int, int, double, int) - Constructor for class it.univr.di.cstnu.util.CSTNRandomGenerator
cstnStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor: CSTN check status
cstnu - Variable in class it.univr.di.cstnu.visualization.TNEditor: CSTNU checker
CSTNU - Class in it.univr.di.cstnu.algorithms: Represents a Conditional Simple Temporal Network with Uncertainty (CSTNU).
This class implementation considers instantaneous reactions and uses only rules qR0, and qR3 as label modification rules.
Edge values are integers.
CSTNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType
CSTNU() - Constructor for class it.univr.di.cstnu.algorithms.CSTNU: Default constructor, package use only!
CSTNU(TNGraph<CSTNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU: Constructor for CSTNU
CSTNU(TNGraph<CSTNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU: Constructor for CSTNU
CSTNU(TNGraph<CSTNUEdge>, int, boolean) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU: Constructor for CSTNU
CSTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU: Helper constructor for CSTNU.
CSTNU.CSTNUCheckStatus - Class in it.univr.di.cstnu.algorithms: Simple class to represent the status of the checking algorithm during an execution.
controllability = super.consistency.
cstnu2cstn - Variable in class it.univr.di.cstnu.visualization.TNEditor: CSTNU2CSTN checker
CSTNU2CSTN - Class in it.univr.di.cstnu.algorithms: Simple class to represent and check Conditional Simple Temporal Network with Uncertainty (CSTNU) where the DC checking is done reducing the instance to an equivalent CSTN instance where the DC checking is done assuming instantaneous reaction.
In other words, the CSTNU instance is transformed into a CSTN one and checked invoking CSTN.dynamicConsistencyCheck().
CSTNU2CSTN() - Constructor for class it.univr.di.cstnu.algorithms.CSTNU2CSTN: Constructor for CSTNU2CSTN.
CSTNU2CSTN(TNGraph<CSTNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU2CSTN
CSTNU2CSTN(TNGraph<CSTNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNU2CSTN: Constructor for CSTNU
CSTNU2CSTNPSU - Class in it.univr.di.cstnu.util: Reads CSTNU instances and converts them into CSTNPSU (==FTNU) instances transforming each contingent link into a guarded one.
CSTNU2UppaalTiga - Class in it.univr.di.cstnu.util: Actor class that transforms a CSTNU instance into a UppaalTiga Time Game Automate schema.
It is sufficient to build an CSTNU2UppaalTiga object giving a TNGraph instance that represents the network of a CSTNU instance and an output stream where the result must be sent (see CSTNU2UppaalTiga(TNGraph, PrintStream)).
Then, invoking CSTNU2UppaalTiga.translate(), the result is sent to the specified output stream.
CSTNU2UppaalTiga(TNGraph<CSTNUEdge>, PrintStream) - Constructor for class it.univr.di.cstnu.util.CSTNU2UppaalTiga: Constructor for CSTNU2UppaalTiga.
CSTNUCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
CSTNUEdge - Interface in it.univr.di.cstnu.graph: Represents the behavior of a CSTNU edge.
CSTNUEdgePluggable - Class in it.univr.di.cstnu.graph: An implementation of CSTNUEdge where the labeled value set can be plugged during the creation.
CSTNUEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable: Internal constructor
CSTNUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable: Constructor to clone the component.
CSTNUEdgePluggable(Edge, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable: Constructor to clone the component.
CSTNUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
CSTNUEdgePluggable(String, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.cstnu.graph.CSTNUEdgePluggable
CSTNUGraphAttributeEditingMousePlugin<V,E> - Class in it.univr.di.cstnu.visualization: Allows to edit vertex or edge attributes.
CSTNUGraphAttributeEditingMousePlugin(TNEditor) - Constructor for class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin: Create an instance with default settings
CSTNUStaticLayout<E> - Class in it.univr.di.cstnu.visualization: Extends CSTNUStaticLayout retrieving initial node positions from node attributes.
CSTNUStaticLayout(Graph<LabeledNode, E>) - Constructor for class it.univr.di.cstnu.visualization.CSTNUStaticLayout: Creates an instance for the specified graph and default size; vertex locations are determined by CSTNUStaticLayout.positionInitializer.
CSTNUStaticLayout(Graph<LabeledNode, E>, Dimension) - Constructor for class it.univr.di.cstnu.visualization.CSTNUStaticLayout: Creates an instance for the specified graph and size.
cstnuStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor: CSTNU check status
CSTNwoNodeLabel - Class in it.univr.di.cstnu.algorithms: Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNwoNodeLabel() - Constructor for class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel: Default constructor.
CSTNwoNodeLabel(TNGraph<CSTNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel: Constructor for
CSTNwoNodeLabel(TNGraph<CSTNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel
CSVSep - Static variable in class it.univr.di.cstnu.util.Checker: CSV separator
CSVSep - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: CSV separator
CSVSep - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: CSV separator
CTG_FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.util.STNUDensifier: Default instance name suffix for contingent node reduction
current - Variable in class it.univr.di.cstnu.util.RunMeter
currentEdgeFactory - Variable in class it.univr.di.cstnu.util.Checker
currentEdgeImpl - Variable in class it.univr.di.cstnu.visualization.TNEditor: Current edge implementation class
currentEdgeImplClass - Variable in class it.univr.di.cstnu.util.Checker: Class for representing edge .
currentEdgeImplClass - Variable in class it.univr.di.cstnu.util.CSTNU2CSTNPSU: Class for representing edge .
currentEdgeImplClass - Variable in class it.univr.di.cstnu.util.STNUDensifier: Class for representing edge .
currentTNGraphType - Variable in class it.univr.di.cstnu.visualization.TNEditor: The kind of network the system is currently showing
cycle - Variable in class it.univr.di.cstnu.visualization.TNEditor: Number of cycles of CSTN(U) check step-by-step
cycles - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: Counters about the # of application of different rules.

D

DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Name of sub dir containing DC instances
DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Name of sub dir containing DC instances
DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Name of sub dir containing DC instances
dcCurrentSem - Variable in class it.univr.di.cstnu.visualization.TNEditor: The current wanted semantics
Debug - Enum Class in it.univr.di: Contains the static final boolean for enable/disable debug logging in all it.univr.di subpackages.
DEFAULT_ALETTER_RET_VALUE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet: Default value for not found index.
DEFAULT_BYTE_RET_VALUE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet: Default value for not found name.
DEFAULT_CSTN_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
DEFAULT_CSTNPSU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
DEFAULT_CSTNU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
DEFAULT_LABELED_INT_MAP_CLASS - Static variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Default class for representing labeled values.
DEFAULT_LABELED_INT_MAP_CLASS - Static variable in class it.univr.di.cstnu.graph.OSTNUEdgePluggable: Class for representing labeled values.
DEFAULT_LABELEDINTMAP_CLASS - Static variable in class it.univr.di.labeledvalue.LabeledIntMapSupplier
DEFAULT_OSTNU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
DEFAULT_STN_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
DEFAULT_STNU_EDGE_CLASS - Static variable in class it.univr.di.cstnu.graph.EdgeSupplier
defaultConsistencyCheckAlg - Variable in class it.univr.di.cstnu.algorithms.STN: Which algorithm to use for consistency check.
defaultDir - Variable in class it.univr.di.cstnu.visualization.TNEditor: Default load/save directory
defaultMain(String[], CSTN, String) - Static method in class it.univr.di.cstnu.algorithms.CSTN
degree(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
delete(T) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Removes the element if it is present in the queue.
It runs in O(log n) time.
DENSE_FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.util.STNUDensifier: Default instance name suffix for dense transformation
DEPTH_FIRST_ORDER(TNGraph<STNEdge>, LabeledNode, ObjectList<LabeledNode>, Object2BooleanMap<LabeledNode>, boolean) - Static method in class it.univr.di.cstnu.algorithms.STN: Recursive method for determining a depth-first order of nodes.
Depth-first order sorts node with respect to their 'finishing time' in a Depth-First-Search (DFS) (see cap.
dequeue() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
dequeue() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
dequeueLast() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: Dequeues the last element from the queue.
derived - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType: The edge represents a constraint derived by the controllability check algorithm.
DERIVED_GRAPH_BIG_VIEWER_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor: Name of the derived graph big viewer
derivedEdgeStroke - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering: Simple stroke object to draw a 'derived' type edge.
derivedGraphBiggerViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor: Button for derived network bigger viewer
Design assumptions - Search tag in class it.univr.di.labeledvalue.ALabel: Section
differentEdgesOf(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph: Returns the list of different edges of this graph from g1.
Dijkstra - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm: Dijkstra
DispatchabilityBenchmarkRunner - Class in it.univr.di.cstnu.util: Simple class to determine the average execution time (and std dev) of the STN(U) dispatchability algorithms on a given set of STNUs.
DispatchabilityBenchmarkRunner() - Constructor for class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
DISTANCE_VIEWER_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor: Name of the distance viewer panel
done() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
done() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
draw(LabeledNode, double, double, TNGraph<CSTNEdge>, int) - Method in class it.univr.di.cstnu.visualization.CSTNLayout
dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTN
dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTN2CSTN0: Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU: Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
dynamicConsistencyCheck() - Method in class it.univr.di.cstnu.algorithms.OSTNU: Checks the dynamic consistency (DC) of a CSTN instance within timeout seconds.
dynamicConsistencyCheckWOInit() - Method in class it.univr.di.cstnu.algorithms.CSTN: Checks the dynamic consistency of a CSTN instance without initialize the network.
This method can be used ONLY when it is guaranteed that the network is already initialize by method AbstractCSTN.initAndCheck().
dynamicConsistencyCheckWOInit() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: Checks the controllability of a CSTNPSU instance and, if the instance is controllable, determines all the minimal ranges for the constraints.
dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU: Checks the dynamic controllability (DC) of the given network (see CSTNU(TNGraph) or AbstractCSTN.setG(TNGraph)).
If the network is DC, it determines all the minimal ranges for the constraints.
dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU2CSTN: Checks the dynamic controllability (DC) of the given network (see CSTNU(TNGraph) or AbstractCSTN.setG(TNGraph)).
If the network is DC, it determines all the minimal ranges for the constraints.
dynamicControllabilityCheck() - Method in class it.univr.di.cstnu.algorithms.STNU: Checks the consistency of an STN instance within timeout seconds.
dynamicControllabilityCheck(STNU.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STNU: Executes the dynamic controllability check using the specified algorithm, and returns the status of the check.

E

EARLY_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE: Returns the minimum possible execution time, l, with all nodes that can be executed at that time, i.e., l' ≤ l.
It is assumed that candidates.timeInterval = [l, u] and each node has a time interval [l',u'] such that l ≤ l' and u ≤ u'.
Edge - Interface in it.univr.di.cstnu.graph: Root class for representing edges in it.univr.di.cstnu package.
EDGE_CASE_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
EDGE_LABELED_LC_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
EDGE_LABELED_UC_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
EDGE_LABELED_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
EDGE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Default edge name prefix
EDGE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Default edge name prefix
EDGE_PROBABILITY - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Default edge probability for each pair of nodes
EDGE_PROBABILITY - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Default edge probability for each pair of nodes
EDGE_TYPE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
EDGE_VALUE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
Edge.ConstraintType - Enum Class in it.univr.di.cstnu.graph: Possible types of an edge.
edgeDrawPaintFunction(PickedInfo<K>, Paint, Paint, Paint, Paint, Paint) - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering: Returns a transformer to select the color that is used to draw the edge.
edgeFactory - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
edgeFactory - Variable in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
edgeFillPaintFunction(Paint, Paint, Paint) - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering: An edge is usually draw as an arc between two points.
The area delimited by the arc and the straight line connecting the two edge points can be filled by a color.
edgeFontFunction - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering: Font for edge label rendering
edgeLabelFunction - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering: Font for edge label rendering
EdgeRendering - Enum Class in it.univr.di.cstnu.visualization: Edge rendering.
edgesToCheck - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck: It must be a set because an edge could be added more times!
edgesToCheck - Variable in class it.univr.di.cstnu.visualization.TNEditor: Edges to check in CSTN(U) check step-by-step
EdgesToCheck() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
EdgesToCheck(Collection<? extends E>) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck: A simple constructor when the initial set of edges is available.
edgeStrokeFunction - Static variable in enum class it.univr.di.cstnu.visualization.EdgeRendering: Select how to draw an edge given its type.
EdgeSupplier<E> - Class in it.univr.di.cstnu.graph: This supplier requires as E a class that implements Edge interface and that contains the following 3 constructors: E(Class<? extends LabeledIntMap>) E(E, Class<? extends LabeledIntMap>) E(String, Class<? extends LabeledIntMap>)
EdgeSupplier(Class<? extends E>) - Constructor for class it.univr.di.cstnu.graph.EdgeSupplier
edgeSupport - Variable in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin: Helper for creating an edge
EditingGraphMousePlugin<V,E> - Class in it.univr.di.cstnu.visualization: A plugin that can create vertices, undirected edges, and directed edges using mouse gestures.
EditingGraphMousePlugin(Supplier<V>, Supplier<E>) - Constructor for class it.univr.di.cstnu.visualization.EditingGraphMousePlugin: Creates an instance and prepares shapes for visual effects, using the default modifiers of designed button (button 1).
EditingModalGraphMouse<V,E> - Class in it.univr.di.cstnu.visualization: I modified the source to use a local EditingGraphMousePlugin and to remove some extra useless features.
EditingModalGraphMouse(RenderContext<V, E>, Supplier<V>, Supplier<E>, TNEditor, boolean) - Constructor for class it.univr.di.cstnu.visualization.EditingModalGraphMouse: Creates an instance with default values.
EditingModalGraphMouse.ModeKeyAdapter - Class in it.univr.di.cstnu.visualization: Personalization of key adapter.
editingPlugin - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
EditingPopupGraphMousePlugin<V,E> - Class in it.univr.di.cstnu.visualization: 2017-10-23 I added a menu item to manage the export of a graph.
EditingPopupGraphMousePlugin(Supplier<V>, Supplier<E>) - Constructor for class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
EDITOR_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor: Name of the editor panel
EMPTY_LABEL - Static variable in class it.univr.di.labeledvalue.Constants: Char representing empty label: ⊡.
EMPTY_LABELstring - Static variable in class it.univr.di.labeledvalue.Constants
EMPTY_UPPER_CASE_LABEL - Static variable in class it.univr.di.labeledvalue.Constants: Char representing empty upper case label: ◇.
EMPTY_UPPER_CASE_LABELstring - Static variable in class it.univr.di.labeledvalue.Constants
emptyLabel - Static variable in class it.univr.di.labeledvalue.ALabel: A constant empty label to represent an empty label that cannot be modified.
emptyLabel - Static variable in class it.univr.di.labeledvalue.Label: A constant empty label to represent an empty label that cannot be modified.
EmptyLabel() - Constructor for class it.univr.di.labeledvalue.ALabel.EmptyLabel: default constructor
emptyLabeledLowerCaseValue - Static variable in class it.univr.di.labeledvalue.LabeledLowerCaseValue: A constant empty label to represent an empty label that cannot be modified.
end - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: The end position in ObjectArrayFIFOSetQueue.backingArray.
enqueue(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
enqueue(K) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
enqueueFirst(K) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: Enqueues a new element as the first element (in dequeue order) of the queue.
entryAsString(Object2IntMap.Entry<Label>) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
entryAsString(ALabel, int, Label, boolean) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
entryAsString(Label, int) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
entryAsString(Label, int, ALabel) - Static method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: entryAsString.
entryComparator - Static variable in interface it.univr.di.labeledvalue.LabeledIntMap: A natural comparator for Entry<Label>.
entrySet() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
entrySet() - Method in interface it.univr.di.labeledvalue.LabeledIntMap: The set of all entries of the map.
entrySet() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap: This method returns a copy of the view of the map.
entrySet() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap: The set of all entries of the map.
entrySet(ObjectSet<Object2IntMap.Entry<Label>>) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap: This method returns a copy of the view of the map.
entrySet(ObjectSet<Object2IntMap.Entry<Label>>) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
entrySet(ObjectSet<Object2IntMap.Entry<Label>>) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: The set of all entries of the map.
entrySet(ObjectSet<Object2IntMap.Entry<Label>>) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
environmentStrategy - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Strategy used by Environment to choice a duration.
epsilon - Variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon: Reaction time for CSTN
epsilonPanel - Variable in class it.univr.di.cstnu.visualization.TNEditor: The epsilon panel
equals(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel: Compare the letter with an a-letter name.
equals(Object) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink: Indicates whether some other object is "equal to" this one.
equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval: Indicates whether some other object is "equal to" this one.
equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence: Indicates whether some other object is "equal to" this one.
equals(Object) - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval: Indicates whether some other object is "equal to" this one.
equals(Object) - Method in class it.univr.di.cstnu.graph.AbstractComponent: Deprecated.
equals(Object) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
equals(Object) - Method in interface it.univr.di.cstnu.graph.Component: Deprecated.
equals(Object) - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
equals(Object) - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
equals(Object) - Method in class it.univr.di.cstnu.util.ObjectPair
equals(Object) - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
equals(Object) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
equals(Object) - Method in class it.univr.di.labeledvalue.ALabel
equals(Object) - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
equals(Object) - Method in class it.univr.di.labeledvalue.Label
equals(Object) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
equals(Object) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
equals(Object) - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
equals(Object) - Method in class it.univr.di.labeledvalue.Literal
equals(String) - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
equalsByName(Component) - Method in class it.univr.di.cstnu.graph.AbstractComponent
equalsByName(Component) - Method in interface it.univr.di.cstnu.graph.Component: A component is assumed to be equal to another if it has the same name.
executionTimeHCEns - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
executionTimeHOEns - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
executionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: Execution time in nanoseconds.
executionTimeObserveNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
executionTimeRTEDecisionNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
executionTimeRTEinitNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
executionTimeRTEns - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
executionTimeRTEUpdateNs - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState: Execution time statistics.
ExtendedPriorityQueue<T> - Class in it.univr.di.cstnu.util: Simple implementation priority queue where elements are T objects and priorities are integers.
ExtendedPriorityQueue() - Constructor for class it.univr.di.cstnu.util.ExtendedPriorityQueue: Default constructor for minimum priority queue based on binary heap.
ExtendedPriorityQueue(boolean) - Constructor for class it.univr.di.cstnu.util.ExtendedPriorityQueue: General constructor for min/max priority queue based on binary heap.
ExtendedPriorityQueue.Status - Enum Class in it.univr.di.cstnu.util: The possible state of an element with respect to a ExtendedPriorityQueue.
extraButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor: Some buttons have meaning only for some contexts.
extractFirst() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Removes and returns the item with minimum (maximum) priority in this heap.
It runs in O(1) time.
extractFirstEntry() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Removes and returns the first entry in this heap.
It runs in O(1) time.

F

father - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode: Labeled values subsumed by this.
FD_STNU - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm: RUL2021 + dispatchable phase
FD_STNU_IMPROVED - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm: Original FD_STNU improved by removing waits with values greater than the maximum duration of the relative contingent link.
fdMinSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: Filename suffix of STNU checked by FD_STNU and minimized by FD_ESTNU algorithm.
fdSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: Filename suffix of STNU checked by FD_STNU algorithm.
FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: Suffix for file name
FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.STN: Suffix for file name
FILE_NAME_SUFFIX - Static variable in class it.univr.di.cstnu.algorithms.STNU: Suffix for file name
findEdge(LabeledNode, LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
findEdge(String, String) - Method in class it.univr.di.cstnu.graph.TNGraph: Find the edge given the name of source node and destination one.
finished - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: Becomes true if no rule can be applied anymore.
fInput - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: The input file containing the CSTN graph in GraphML format.
fInput - Variable in class it.univr.di.cstnu.algorithms.STN: The input file containing the STN graph in GraphML format.
first() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
first() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
FIRST_NODE_EARLY_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE: Returns the first node among the candidate and the lower bound of its time window compatible with the given time window.
FIRST_NODE_LATE_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE: Returns the first node among the candidate and the upper time of its time window compatible with the given time window.
FIRST_NODE_MIDDLE_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE: Returns the first node among the candidate and the middle time of its time window compatible with the given time window.
firstProposition - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: First free proposition
formatInt(int) - Static method in class it.univr.di.labeledvalue.Constants
fOutput - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: Output file where to write the XML representing the CSTN graph after a check.
fOutput - Variable in class it.univr.di.cstnu.algorithms.STN: Output file where to write the XML representing the minimal STN graph.
FTNU - Class in it.univr.di.cstnu.algorithms: FTNU model was introduced as an evolution of CSTNPSU one for having a simpler name and a DC checking algorithm able to determine the guarded bounds in a correct way.
FTNU() - Constructor for class it.univr.di.cstnu.algorithms.FTNU: Default constructor, package use only!
FTNU(TNGraph<CSTNPSUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.FTNU
FTNU(TNGraph<CSTNPSUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.FTNU
FTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.FTNU: Helper constructor for FTNU.

G

g - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: Input TNGraph.
g - Variable in class it.univr.di.cstnu.algorithms.STN: Input TNGraph.
gCheckedCleaned - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: The graph obtained by a check and the cleaning action.
gCheckedCleaned - Variable in class it.univr.di.cstnu.algorithms.STN: TNGraph on which to operate.
get() - Method in class it.univr.di.cstnu.graph.EdgeSupplier
get() - Method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
get() - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
get(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
get(byte) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
get(Edge) - Method in class it.univr.di.cstnu.graph.EdgeSupplier
get(LabeledNode) - Static method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
get(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
get(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
get(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
get(Label) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
get(Label) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
get(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
get(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
get(Class<K>, int) - Static method in class it.univr.di.cstnu.graph.EdgeSupplier
get(String) - Method in class it.univr.di.cstnu.graph.EdgeSupplier
get(String) - Static method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
get(String, char) - Static method in class it.univr.di.cstnu.graph.LabeledNodeSupplier
GET_APSP_Johnson(TNGraph<T>, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: * Determines the minimal distance between all pair of nodes (all-pair-shortest-paths (APSP)) using the Johnson algorithm.
GET_DEPTH_FIRST_ORDER(TNPredecessorGraph<E>, LabeledNode, Object2BooleanMap<LabeledNode>, boolean) - Static method in class it.univr.di.cstnu.algorithms.STN: Iterative method for determining a depth-first order of nodes.
Depth-first order sorts node with respect to their 'finishing time' in a Depth-First-Search (DFS) (see cap.
GET_REPRESENTATIVE_RIGID_COMPONENTS(ObjectList<ObjectList<LabeledNode>>, Object2IntMap<LabeledNode>, LabeledNode) - Static method in class it.univr.di.cstnu.algorithms.STN: For each rigid components with two elements at least, determines: 1) the node that should precede the others as representative and 2) the distances from the representative and the other nodes of the rigid component.
Such information are stored and returned as two maps: one saying the representative for each node, the other the distance from the representative for each node.
GET_REPRESENTATIVE_RIGID_COMPONENTS(ObjectList<ObjectList<LabeledNode>>, Object2IntMap<LabeledNode>, LabeledNode, ObjectCollection<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STNU: For each rigid components with two elements at least, determines: 1) the node that should precede the others as representative and 2) the distances from the representative and the other nodes of the rigid component.
Such information are stored and returned as two maps: one saying the representative for each node, the other the distance from the representative for each node.
Activation timepoint are preferred in case that there is 0 distance.
GET_REVERSE_POST_ORDER_VISIT(TNPredecessorGraph<E>, LabeledNode, Object2BooleanMap<LabeledNode>) - Static method in class it.univr.di.cstnu.algorithms.STN: Determine the reverse-post-order of reachable nodes from the given root node in graph.
GET_SSSP_BellmanFord(TNGraph<E>, LabeledNode, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines the minimal distance from the give source node to each other node (single-source-shortest-paths (SSSP)) using the BellmanFord algorithm.
The minimal distance is stored in a map (node, distanceFromSource).
GET_SSSP_BellmanFordOL(TNGraph<STNUEdge>, STNU.STNUCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STNU: Determines the minimal distance from a virtual source node (added by the method) and each other node (single-source-shortest-path (SSSP)) using the BellmanFord algorithm.
The minimal distance h is determined considering the ordinary and the lower case values of the input STNU.
GET_SSSP_Dijkstra(TNGraph<E>, LabeledNode, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines the minimal distance between source node and any node reachable by source (single-source-shortest-paths (SSSP)) using the Dijkstra algorithm.
Minimal distances are returned as map (destinationNode, distance).
If a node is not reachable from the source, its distance is +∞.
If the graph contains a negative edge beyond the source outgoing edges or the source is not in the graph, it returns false.
GET_STN_PRECEDESSOR_SUBGRAPH_OPTIMIZED(TNGraph<E>, LabeledNode, Object2IntMap<LabeledNode>, Object2IntMap<LabeledNode>, TNPredecessorGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN: Returns the predecessor graph of the given source in the given STN graph.
GET_STN_PREDECESSOR_SUBGRAPH(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STN: Returns the Muscettola predecessor graph of the given source in the current STN.
Be aware that Muscettola predecessor graph is made by ALL shortest paths having source as origin node.
The returned graph is a ``view'' of this network.
GET_STN_PREDECESSOR_SUBGRAPH(TNGraph<E>, LabeledNode, Object2IntMap<LabeledNode>, Object2IntMap<LabeledNode>, TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN: Returns the predecessor graph of the given source in the given STN graph.
GET_STRONG_CONNECTED_COMPONENTS(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STN: Determines all the strong connected components (SCC) of size > 1 containing source node using the Tarjan algorithm.
GET_STRONG_CONNECTED_COMPONENTS(TNGraph<E>, LabeledNode) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines all the strong connected components (SCC) having size > 1 and containing the source node, using the Tarjan algorithm.
If source is null, it determines all SCC of size > 1 of the network.
It does not modify node or edges internal data.
GET_UNDOMINATED_EDGES(LabeledNode, TNPredecessorGraph<E>, Object2IntMap<LabeledNode>, EdgeSupplier<E>) - Static method in class it.univr.di.cstnu.algorithms.STN: Returns all un-dominated edges emanating from a given source in the predecessor graph without determining and storing the All-Pairs-Shortest-Paths.
getActivationNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
getActivationNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNU
getActivationNodeMap() - Method in class it.univr.di.cstnu.algorithms.STNU
getAfter() - Method in class it.univr.di.cstnu.graph.LabeledNode
getALabel() - Method in class it.univr.di.cstnu.graph.LabeledNode
getALabelAlphabet() - Method in class it.univr.di.cstnu.graph.TNGraph
getAllDeterminedPriorities() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue
getAllLowerCaseAndLabeledValuesMaps() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
getAllLowerCaseAndLabeledValuesMaps() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
getAllUnknown() - Method in class it.univr.di.labeledvalue.Label
getAllUpperCaseAndLabeledValuesMaps() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
getAllUpperCaseAndLabeledValuesMaps() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
getAlphabet() - Method in class it.univr.di.labeledvalue.ALabel
getBefore() - Method in class it.univr.di.cstnu.graph.LabeledNode
getCaseLabel() - Method in interface it.univr.di.cstnu.graph.STNUEdge
getCaseLabel() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
getCaseStatus() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
getCheckAlgorithm() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Getter for the field checkStatus, the status of a checking algorithm.
getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.CSTNU
getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.STN: Getter for the field checkStatus.
getCheckStatus() - Method in class it.univr.di.cstnu.algorithms.STNU
getChildrenOf(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph: Given an observation node obs that observes the proposition 'p', its 'children' are all observation nodes, Q, for which 'p' appears in the label of node Q.
getCleanedOutput() - Method in class it.univr.di.cstnu.algorithms.STNU
getClockName(LabeledNode) - Static method in class it.univr.di.cstnu.util.CSTNU2UppaalTiga: Build a clock name: "t" followed by node name cleaned off not allowed chars.
getComplement() - Method in class it.univr.di.labeledvalue.Literal: Returns the complement of this.
getConstraintType() - Method in class it.univr.di.cstnu.graph.AbstractEdge
getConstraintType() - Method in interface it.univr.di.cstnu.graph.Edge
getContingency() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getContingencyGraph() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: The contingency graph is a labeled graph for determining the contingency value of each node.
getContingent() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
getContingentNodeCount() - Method in class it.univr.di.cstnu.graph.TNGraph
getCstnEditor() - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
getCurrentTimeWindow(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
getDcInstanceNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
getDcInstanceNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getDcInstances() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field dcInstances.
getDefaultConsistencyCheckAlg() - Method in class it.univr.di.cstnu.algorithms.STN: Getter for the field defaultConsistencyCheckAlg.
getDefaultControllabilityCheckAlg() - Method in class it.univr.di.cstnu.algorithms.STNU
getDest(E) - Method in class it.univr.di.cstnu.graph.TNGraph
getDest(String) - Method in class it.univr.di.cstnu.graph.TNGraph: Wrapper TNGraph.getDest(Edge)
getDistanceBellmanFord(TNGraph<E>, LabeledNode, boolean, int, boolean, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines the minimal distance between source node and any node (or any node and the sink (==source) if backward) using the BellmanFord algorithm.
getDistanceDijkstra(TNGraph<E>, LabeledNode, boolean, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN: Determines the minimal distance between source node and any node using the Dijkstra algorithm.
Each minimal distance is stored as potential value of the node.
getEdge(String) - Method in class it.univr.di.cstnu.graph.TNGraph: Returns the edge associated to the name.
getEdgeCount() - Method in class it.univr.di.cstnu.graph.TNGraph
getEdgeEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse: getEdgeEditingPlugin.
getEdgeFactory() - Method in class it.univr.di.cstnu.graph.TNGraph: Getter for the field edgeFactory.
getEdgeFromObserversToNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Determines the set of edges P?-->nX where P? is an observer node and nX is the given node.
getEdgeImplClass() - Method in class it.univr.di.cstnu.graph.EdgeSupplier
getEdgeImplClass() - Method in class it.univr.di.cstnu.graph.TNGraph
getEdgeProb() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field edgeProb.
getEdgeProb() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator: Getter for the field edgeProb.
getEdgeProb() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getEdges() - Method in class it.univr.di.cstnu.graph.TNGraph: Returns an independent collection of the edges of this graph.
getEdgesOrdered() - Method in class it.univr.di.cstnu.graph.TNGraph
getEdgeSupport() - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
getEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
getElements() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: It runs in O(n) time.
getEndingNodeName() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getEndpoints(E) - Method in class it.univr.di.cstnu.graph.TNGraph: getEdgesArray.
getEpsilonReactionTime() - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
getFileName() - Method in class it.univr.di.cstnu.graph.TNGraph
getfInput() - Method in class it.univr.di.cstnu.algorithms.STNU
getFirst() - Method in class it.univr.di.cstnu.util.ObjectPair
getFirstEntry() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: It runs in O(1) time.
getfOutput() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Getter for the field fOutput.
getfOutput() - Method in class it.univr.di.cstnu.algorithms.STN
getfOutput() - Method in class it.univr.di.cstnu.algorithms.STNU
getG() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Getter for the field g, the input graph.
getG() - Method in class it.univr.di.cstnu.algorithms.STN
getG() - Method in class it.univr.di.cstnu.algorithms.STNU
getG() - Method in class it.univr.di.cstnu.algorithms.STNURTE
getGChecked() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Getter for the resulting graph of a check.
In order to obtain a resulting graph without redundant labels or labels having unknown literals, set output cleaned flag by AbstractCSTN.setOutputCleaned(boolean) before calling this method.
getGChecked() - Method in class it.univr.di.cstnu.algorithms.STN
getGChecked() - Method in class it.univr.di.cstnu.algorithms.STNU
getGCheckedAsGraphML() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Helper method for having the graph obtained by AbstractCSTN.getGChecked() in GraphML format.
getGraphLabelDescription(TNGraph<?>) - Static method in class it.univr.di.cstnu.visualization.TNEditor
getHorizon() - Method in class it.univr.di.cstnu.algorithms.STNU
getIncidentEdges(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
getInEdges(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
getInEdgesAndNodes(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph: It is an optimization of TNGraph.getInEdges(LabeledNode) that returns also the source node of the in-going edge.
getInitialX() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
getInitialY() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
getIntValue() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
getKey() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
getKey() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
getLabel() - Method in class it.univr.di.cstnu.graph.LabeledNode
getLabel() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
getLabel4ValueInvolvingContingent(LabeledNode, LabeledNode, boolean) - Method in class it.univr.di.cstnu.algorithms.OSTNU
getLabeledIntMapImplClass() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getLabeledIntMapImplClass() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getLabelEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
getLabeledPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode: Returns the map of labeled potential of the node.
getLabeledPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode: Returns the potential associated to label l, if it exists; Constants.INT_NULL otherwise.
getLabeledPotentialCount(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode
getLabeledUpperPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode: Returns the map of labeled upper potential of the node.
getLabeledUpperPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode: Returns the upper potential associated to label l, if it exists; Constants.INT_NULL otherwise.
getLabeledValue() - Method in interface it.univr.di.cstnu.graph.STNUEdge
getLabeledValue() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
getLabeledValueFormatted() - Method in interface it.univr.di.cstnu.graph.STNUEdge: Representation of the labeled value as a string.
getLabeledValueMap() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getLabeledValueMap() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getLabeledValueSet() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getLabeledValueSet() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getLabeledValueSet(ObjectSet<Object2IntMap.Entry<Label>>) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getLabeledValueSet(ObjectSet<Object2IntMap.Entry<Label>>) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getLetter(byte) - Method in class it.univr.di.labeledvalue.ALabel
getLiterals() - Method in class it.univr.di.labeledvalue.Label
getLocations() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout
getLower() - Method in class it.univr.di.cstnu.util.TimeInterval
getLowerBound() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getLowerCaseEdgesMap() - Method in class it.univr.di.cstnu.algorithms.STNU: Returns a map containing the lower-case edges associated to the contingent link of the network if the network was initialized (STNU.initAndCheck() executed successfully); null otherwise.
getLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
getLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
getLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
getLowerCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
getLowerCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
getLowerCaseValueMap() - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge
getLowerCaseValueMap() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
getLowerContingentLink(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU
getLowerContingentLink(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNU
getLowerGuard() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getLowerLabeledEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
getMaximum() - Method in class it.univr.di.cstnu.util.ActiveWaits
getMaxMinConstraint() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
getMaxPathContingencySpanInContingencyGraph(String, TNGraph<CSTNEdge>) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU: Returns the labeled path contingency span of node with name nodeName.
getMaxValue() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
getMaxValue() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
getMaxValueSubsumedBy(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Returns the value associated to the l if it exists, otherwise the maximal value among all labels consistent with l.
getMaxWeight() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Getter for the field maxWeight.
getMaxWeight() - Method in class it.univr.di.cstnu.algorithms.STNU
getMaxWeight() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field maxWeight.
getMaxWeight() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator: Getter for the field maxWeight.
getMaxWeight() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getMinimalDistanceGraph(TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Determines the minimal distance between all pair of vertexes modifying the given consistent graph.
getMinLabeledValue() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getMinLabeledValue() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getMinLabeledValue() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
getMinLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
getMinLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
getMinLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
getMinNegativeWeight() - Method in class it.univr.di.cstnu.algorithms.STN
getMinUpperCaseValue() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
getMinUpperCaseValue() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
getMinValue() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getMinValue() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getMinValue() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
getMinValue() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
getMinValue() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
getMinValueAmongLabelsWOUnknown() - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getMinValueAmongLabelsWOUnknown() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getMinValueAmongLabelsWOUnknown() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
getMinValueConsistentWith(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getMinValueConsistentWith(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getMinValueConsistentWith(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
getMinValueConsistentWith(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Returns the value associated to the l if it exists, otherwise the minimal value among all labels consistent with l.
getMinValueConsistentWith(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Returns the value associated to (l, p) if it exists, otherwise the minimal value among all labels consistent with (l, p).
getMinValueSubsumedBy(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getMinValueSubsumedBy(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getMinValueSubsumedBy(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
getMinValueSubsumedBy(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Returns the minimal value among those associated to labels subsumed by l if it exists, Constants.INT_NULL otherwise.
getMinValueSubsumedBy(Label) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
getModeComboBox() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
getModeMenu() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse: create (if necessary) and return a menu that will change the mode
getName() - Method in class it.univr.di.cstnu.graph.AbstractComponent
getName() - Method in interface it.univr.di.cstnu.graph.Component
getName() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
getName() - Method in class it.univr.di.cstnu.graph.TNGraph
getName() - Method in class it.univr.di.labeledvalue.Literal
getNegated() - Method in class it.univr.di.labeledvalue.Literal: Returns a literal that is the negated of this.
getNegativeScenarios() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
getNeighbors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
getnNodes() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field nNodes.
getnNodesQLoop() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field nNodesQLoop.
getnObsQLoop() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field nObsQLoop.
getNode(String) - Method in class it.univr.di.cstnu.graph.TNGraph: Returns the node associated to the name.
getNode(String) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Return the node associated to the name
getNodeFactory() - Method in class it.univr.di.cstnu.graph.TNGraph
getNodeName() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
getNodeNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator: getNodeNumber.
getNodeNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getNodes() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
getNodesOrdered() - Method in class it.univr.di.cstnu.graph.TNGraph
getNotDCInstanceNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator: getNotDCInstanceNumber.
getNotDCInstanceNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getNotDCInstances() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field notDCInstances.
getNotDCSubDir() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field notDCSubDir.
getNotDCSubDir() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator: Getter for the field notDCSubDir.
getNotDCSubDir() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getnPropositions() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field nPropositions.
getnQLoops() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator: Getter for the field nQLoops.
getObservedAndObserver() - Method in class it.univr.di.cstnu.graph.TNGraph
getObserver(char) - Method in class it.univr.di.cstnu.graph.TNGraph
getObserver2ZEdges() - Method in class it.univr.di.cstnu.graph.TNGraph: Be careful! The returned value is not a copy as the edges contained!
getObserverCount() - Method in class it.univr.di.cstnu.graph.TNGraph
getObservers() - Method in class it.univr.di.cstnu.graph.TNGraph
getObsQLoopNumber() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator: getObsQLoopNumber.
getObsQLoopNumber() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getOrderedSchedule() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
getOutEdges(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
getOutEdgesAndNodes(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph: It is an optimization of TNGraph.getOutEdges(LabeledNode) that returns also the destination node of the outgoing edge.
getPopupEditingPlugin() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
getPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode
getPredecessor() - Method in class it.univr.di.cstnu.graph.LabeledNode
getPredecessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
getPredecessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Returns the list of predecessors (with incoming edge) of the given node.
getPriority(T) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Returns the priority of item if it is or was present in the queue, Constants.INT_POS_INFINITE if the item was never inserted and this is a min queue, Constants.INT_NEG_INFINITE if the item was never inserted and this is a max queue.
It runs in O(alpha) time because the element is searched in a companion hash table.
getPropositionObserved() - Method in class it.univr.di.cstnu.graph.LabeledNode
getPropositions() - Method in class it.univr.di.cstnu.graph.TNGraph: getPropositions.
getPropositions() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
getPropositions() - Method in class it.univr.di.labeledvalue.Label
getPrototypalLink() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: Checks the DC property and, if DC, returns the prototypal link that represents the global temporal behavior of the network.
getReactionTime() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Getter for the field reactionTime.
getReturnedObjectClass() - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier
getRigidComponents() - Method in class it.univr.di.cstnu.algorithms.STN: Determines all the Rigid Components (RC) using the linear time algorithm (w.r.t.
getSchedule() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState
getSecond() - Method in class it.univr.di.cstnu.util.ObjectPair
getSource(E) - Method in class it.univr.di.cstnu.graph.TNGraph
getSource(String) - Method in class it.univr.di.cstnu.graph.TNGraph: Wrapper of TNGraph.getSource(Edge)
getStartingNodeName() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getState() - Method in class it.univr.di.labeledvalue.Literal
getState(byte) - Method in class it.univr.di.labeledvalue.ALabel
getState(char) - Method in class it.univr.di.labeledvalue.Label
getStateLiteralWithSameName(char) - Method in class it.univr.di.labeledvalue.Label
getStateOrdinal(char) - Static method in class it.univr.di.labeledvalue.Literal: Returns the ordinal associate to state.
getStatus() - Method in class it.univr.di.cstnu.graph.LabeledNode
getStatus(T) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Usually, in a priority queue an object is firstly added and, possibly, removed.
This class remembers all objects that have been added in the queue.
Therefore, this method returns the possible state of an element (see ExtendedPriorityQueue.Status).
It runs in O(alpha) time because the element is searched in a companion hash table.
getStraight() - Method in class it.univr.di.labeledvalue.Literal: Returns a literal that is the straight literal of this.
getSubLabelIn(Label, boolean) - Method in class it.univr.di.labeledvalue.Label: Determines the sub label of this that is also present (not present) in label lab.
getSubLabelIn(Label, boolean, boolean) - Method in class it.univr.di.labeledvalue.Label: Determines the sub label of this that is also present (not present) in label lab.
getSuccessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
getSuccessors(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph: Returns the list of successors (with outgoing edge) of the given node.
getTimeOut() - Method in class it.univr.di.cstnu.algorithms.STNU
getType() - Method in exception class it.univr.di.cstnu.algorithms.WellDefinitionException
getType() - Method in class it.univr.di.cstnu.graph.TNGraph
getULCaseLabeledPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode: Returns the map of upper/lower case labeled potential of the node.
getULCaseLabeledUpperPotential() - Method in class it.univr.di.cstnu.graph.LabeledNode: Returns the map of upper/lower case labeled UPPER potential of the node.
getUniqueDifferentLiteral(Label) - Method in class it.univr.di.labeledvalue.Label: Finds and returns the unique different literal between this and lab if it exists.
getUniqueEdgeName(String) - Method in class it.univr.di.cstnu.graph.TNGraph
getUnknown() - Method in class it.univr.di.labeledvalue.Literal: Returns a literal that is the unknown literal of this.
getUpper() - Method in class it.univr.di.cstnu.util.TimeInterval
getUpperBound() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getUpperCaseEdgesMap() - Method in class it.univr.di.cstnu.algorithms.STNU: Returns a map containing the upper-case edges associated to the contingent link of the network if the network was initialized (STNU.initAndCheck() executed successfully); null otherwise.
getUpperCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
getUpperCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
getUpperCaseValueMap() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
getUpperCaseValueMap() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
getUpperGuard() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
getUpperLabeledEdges() - Method in class it.univr.di.cstnu.graph.TNGraph
getValue() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
getValue() - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
getValue() - Method in interface it.univr.di.cstnu.graph.STNEdge
getValue() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
getValue() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
getValue(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
getValue(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
getValue(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN
getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.STN
getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.STNU
getVersionAndCopyright() - Method in class it.univr.di.cstnu.algorithms.STNURTE
getVersionAndCopyright() - Method in class it.univr.di.cstnu.util.CSTNRandomGenerator
getVersionAndCopyright() - Method in class it.univr.di.cstnu.util.OSTNURandomGenerator
getVersionAndCopyright() - Method in class it.univr.di.cstnu.util.STNURandomGenerator
getVersionAndDate() - Static method in class it.univr.di.cstnu.algorithms.STNU
getVertexCount() - Method in class it.univr.di.cstnu.graph.TNGraph
getVertexSupport() - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
getVertices() - Method in class it.univr.di.cstnu.graph.TNGraph
getVerticesArray() - Method in class it.univr.di.cstnu.graph.TNGraph: getVerticesArray.
getX() - Method in class it.univr.di.cstnu.graph.LabeledNode
getY() - Method in class it.univr.di.cstnu.graph.LabeledNode
getZ() - Method in class it.univr.di.cstnu.graph.TNGraph
getZ() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.Checker: Global header
GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: Global header
GLOBAL_HEADER - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: Global header
GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.Checker
GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner
GLOBAL_HEADER_ROW - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner
GlobalStatisticKey(int, int, int) - Constructor for class it.univr.di.cstnu.util.Checker.GlobalStatisticKey: default constructor
GRAPH_NAME_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
GRAPH_nCTG_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
GRAPH_nEDGES_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
GRAPH_nOBS_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
GRAPH_nVERTICES_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
graphInfoLabel - Variable in class it.univr.di.cstnu.visualization.TNEditor: The graph info label
GraphML2Luke - Class in it.univr.di.cstnu.util: Utility class for converting STNU file in GraphML format to Luke format.
GraphML2Luke() - Constructor for class it.univr.di.cstnu.util.GraphML2Luke
graphMouse - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
growFactor - Static variable in class it.univr.di.cstnu.graph.TNGraph: Adjacency grow factor; It represents the multiplication factor to use for increasing the dimension of adjacency matrix.

H

handlePopup(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin
hashCode() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink
hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink: Returns a hash code value for this object.
hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval: Returns a hash code value for this object.
hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence: Returns a hash code value for this object.
hashCode() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval: Returns a hash code value for this object.
hashCode() - Method in class it.univr.di.cstnu.graph.AbstractComponent
hashCode() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
hashCode() - Method in interface it.univr.di.cstnu.graph.Component
hashCode() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
hashCode() - Method in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey
hashCode() - Method in class it.univr.di.cstnu.util.ObjectPair
hashCode() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
hashCode() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
hashCode() - Method in class it.univr.di.labeledvalue.ALabel
hashCode() - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
hashCode() - Method in class it.univr.di.labeledvalue.Label
hashCode() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
hashCode() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
hashCode() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
hashCode() - Method in class it.univr.di.labeledvalue.Literal
hashCode(char, char) - Static method in class it.univr.di.labeledvalue.Literal: Hash code for a literal given as char c and state state.
hasNameEquals(ALabelAlphabet.ALetter) - Method in class it.univr.di.cstnu.graph.LabeledNode
hasSameEdgesOf(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph: Returns true if this graph has the same set of edges of g1.
hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
hasSameValues(Edge) - Method in interface it.univr.di.cstnu.graph.Edge
hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
hasSameValues(Edge) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
hasSameVerticesOf(TNGraph<E>) - Method in class it.univr.di.cstnu.graph.TNGraph
HierarchyNode(Label, int) - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
HOPS - Static variable in class it.univr.di.cstnu.util.STNUDensifier: Default hops
horizon - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: Horizon value.
horizon - Variable in class it.univr.di.cstnu.algorithms.STN: Horizon value.
HunsbergerPosenato18 - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm: Hunsberger Posenato 2018.
HunsbergerPosenato19 - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm: Hunsberger Posenato 2019 It is selected when AbstractCSTN.setPropagationOnlyToZ(boolean) with false value is executed before the execution of CSTN.dynamicConsistencyCheck()
HunsbergerPosenato20 - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm: Hunsberger Posenato 2020.

I

inDegree(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
index(char) - Static method in class it.univr.di.labeledvalue.Literal
index(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet
INFINITY_SYMBOL - Static variable in class it.univr.di.labeledvalue.Constants: Char representing infinity symbol: ∞.
INFINITY_SYMBOLstring - Static variable in class it.univr.di.labeledvalue.Constants
INFO_ICON_FILE - Static variable in class it.univr.di.cstnu.visualization.TNEditor
init() - Method in class it.univr.di.cstnu.visualization.TNEditor: Initialize all others component of the GUI using the parameter values passed by
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Checks and initializes the CSTN instance represented by graph g.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential: Checks and initializes the CSTN instance represented by graph g.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: Calls AbstractCSTN.coreCSTNInitAndCheck() and, then, check all guarded links.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.CSTNU: Checks and initializes the CSTN instance represented by graph g.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.OSTNU: Checks and initializes the CSTN instance represented by graph g.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.PCSTNU: Checks and initializes the CSTN instance represented by graph g.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.STN: Initializes the STN instance represented by graph g.
initAndCheck() - Method in class it.univr.di.cstnu.algorithms.STNU: Makes the STNU check and initialization.
INITIAL_CAPACITY - Static variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: The standard initial capacity of a queue.
initialize() - Method in class it.univr.di.cstnu.visualization.CSTNLayout
initialize() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout: It has been erased.
initialized - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: Becomes true when all data structures have been initialized.
inNegativeCycle() - Method in class it.univr.di.cstnu.graph.AbstractComponent
inNegativeCycle() - Method in interface it.univr.di.cstnu.graph.Component
INPUT_GRAPH_BIG_VIEWER_NAME - Static variable in class it.univr.di.cstnu.visualization.TNEditor: Name of the input graph big viewer
inputGraph - Variable in class it.univr.di.cstnu.visualization.TNEditor: TNGraph structures necessary to represent input graph.
inputGraphBiggerViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor: Button for input network bigger viewer
insertOrUpdate(T, int) - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: Inserts or updates the given item and its priority into this heap.
The update is performed only when the new value is lower/greater than the present one according to the min/max type of the queue.
If the item was present (i.e., already extracted), the method does nothing.
It runs in O(log n) time.
INT_NEG_INFINITE - Static variable in class it.univr.di.labeledvalue.Constants: THe integer value representing the -∞.
INT_NULL - Static variable in class it.univr.di.labeledvalue.Constants: Default value to represent a no valid integer value.
INT_POS_INFINITE - Static variable in class it.univr.di.labeledvalue.Constants: THe integer value representing the +∞.
internal - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType: The edge represents an internal one used to represent high level construct as a WORKFLOW OR JOIN.
InternalEntry(Label, ALabel) - Constructor for class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
intersect(int, int) - Method in class it.univr.di.cstnu.util.TimeInterval
intersect(TimeInterval) - Method in class it.univr.di.cstnu.util.TimeInterval
intersect(ALabel) - Method in class it.univr.di.labeledvalue.ALabel
IR - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics: Instantaneous reaction semantics
isActivationNode(LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNU
isAllMaxMinimalGraphConsistent(TNGraph<OSTNUEdgePluggable>) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Determines the minimal distance between all pairs of vertexes of the given graph if the graph is consistent, i.e., it does not contain any negative cycles.
isAnEndingNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
isAStartingNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
isCleanedOutputRequired() - Method in class it.univr.di.cstnu.algorithms.STNU
isComplement(Literal) - Method in class it.univr.di.labeledvalue.Literal
isConsistentWith(byte, char) - Method in class it.univr.di.labeledvalue.Label: A literal l is consistent with a label if the last one does not contain ¬l.
isConsistentWith(Label) - Method in class it.univr.di.labeledvalue.Label: A label L₁ is consistent with a label L₂ if L₁ ∧ L₂ is satisfiable.
L₁ subsumes L₂ implies L₁ is consistent with L₂ but not vice-versa.
isConsistentWith(Literal) - Method in class it.univr.di.labeledvalue.Label
isContingent - Variable in class it.univr.di.cstnu.graph.LabeledNode: Flag for contingent node.
isContingent() - Method in class it.univr.di.cstnu.graph.LabeledNode
isContingent() - Method in interface it.univr.di.cstnu.graph.Node
isContingentAlsoAsOrdinary() - Method in class it.univr.di.cstnu.algorithms.CSTNU
isContingentAlsoAsOrdinary() - Method in class it.univr.di.cstnu.algorithms.STNU
isContingentEdge() - Method in interface it.univr.di.cstnu.graph.Edge
isControllable() - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus
isControllable() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
isControllable() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus
isCSTNEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
isCSTNEdge() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
isCSTNEdge() - Method in interface it.univr.di.cstnu.graph.Edge: This method is inappropriate here, but it helps to speed up the code.
isCSTNPSUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
isCSTNPSUEdge() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
isCSTNPSUEdge() - Method in interface it.univr.di.cstnu.graph.Edge: This method is inappropriate here, but it helps to speed up the code.
isCSTNUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
isCSTNUEdge() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
isCSTNUEdge() - Method in interface it.univr.di.cstnu.graph.Edge: This method is inappropriate here, but it helps to speed up the code.
isDest(LabeledNode, E) - Method in class it.univr.di.cstnu.graph.TNGraph
isEmpty() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
isEmpty() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
isEmpty() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
isEmpty() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
isEmpty() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
isEmpty() - Method in interface it.univr.di.cstnu.graph.Edge
isEmpty() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
isEmpty() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
isEmpty() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue: It runs in O(1) time.
isEmpty() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
isEmpty() - Method in class it.univr.di.cstnu.util.ObjectPair
isEmpty() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap
isEmpty() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
isEmpty() - Method in class it.univr.di.labeledvalue.ALabel
isEmpty() - Method in class it.univr.di.labeledvalue.ALabelAlphabet
isEmpty() - Method in class it.univr.di.labeledvalue.Label
isEmpty() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: isEmpty.
isEmpty() - Method in interface it.univr.di.labeledvalue.LabeledIntMap
isEmpty() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue
isInNegativeScenarios(Label) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: Checks if the label belongs to the negativeScenarios.
isLower() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
isLowerCase() - Method in interface it.univr.di.cstnu.graph.STNUEdge
isNegated() - Method in class it.univr.di.labeledvalue.Literal
isNodePresent(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph
isObserver() - Method in class it.univr.di.cstnu.graph.LabeledNode
isOrdinaryEdge() - Method in interface it.univr.di.cstnu.graph.STNUEdge
isOSTNUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
isOSTNUEdge() - Method in interface it.univr.di.cstnu.graph.Edge: This method is inappropriate here, but it helps to speed up the code.
isOutputCleaned() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: isOutputCleaned.
isOutputCleaned() - Method in class it.univr.di.cstnu.algorithms.STN
isParameter - Variable in class it.univr.di.cstnu.graph.LabeledNode: Flag for parameter node.
isParameter() - Method in class it.univr.di.cstnu.graph.LabeledNode
isParameter() - Method in interface it.univr.di.cstnu.graph.Node
isPotentialEqual(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.LabeledNode
isPresent - Enum constant in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status: the element is currently in the queue.
isRequirementEdge() - Method in interface it.univr.di.cstnu.graph.Edge
isSave() - Method in class it.univr.di.cstnu.algorithms.STNU
isSource(LabeledNode, E) - Method in class it.univr.di.cstnu.graph.TNGraph
isSTNEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
isSTNEdge() - Method in interface it.univr.di.cstnu.graph.Edge: This method is inappropriate here, but it helps to speed up the code.
isSTNEdge() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
isSTNEdge() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
isSTNUEdge() - Method in class it.univr.di.cstnu.graph.AbstractEdge
isSTNUEdge() - Method in interface it.univr.di.cstnu.graph.Edge: This method is inappropriate here, but it helps to speed up the code.
isSTNUEdge() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
isStraight() - Method in class it.univr.di.labeledvalue.Literal
isUnknown() - Method in class it.univr.di.labeledvalue.Literal
isUpper() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel
isUpperBoundRequested - Variable in class it.univr.di.cstnu.algorithms.CSTNPotential: True if DC checking algorithm must determine also the maximum execution time for each time-point.
isUpperBoundRequested() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential
isUpperCase() - Method in interface it.univr.di.cstnu.graph.STNUEdge
isUpperPotentialEqual(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.LabeledNode
isVersionReq() - Method in class it.univr.di.cstnu.algorithms.STNU
isWait() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTED
isWait() - Method in interface it.univr.di.cstnu.graph.STNUEdge
isWithNodeLabels() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: isWithNodeLabels.
it.univr.di - package it.univr.di: Contains the two packages that realize the framework for verifying the consistency/controllability of temporal constraint networks.
it.univr.di.cstnu.algorithms - package it.univr.di.cstnu.algorithms: Contains all checking algorithms for (C)STN(U)s.
it.univr.di.cstnu.graph - package it.univr.di.cstnu.graph: Contains all classes for representing vertices, edges and graphs related to (C)STN(U) model.
it.univr.di.cstnu.util - package it.univr.di.cstnu.util: Contains all actor classes for the implementation and/or the use of (C)STN(U)s algorithms.
it.univr.di.cstnu.visualization - package it.univr.di.cstnu.visualization: Contains all classes to implement a simple graphical editor for (C)STN(U)s instances.
it.univr.di.labeledvalue - package it.univr.di.labeledvalue: Provides the classes necessary to manage labeled value maps.
iterator() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck
iterator() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
iterator() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
iterator() - Method in class it.univr.di.cstnu.util.ObjectPair
iterator() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel
iterator() - Method in class it.univr.di.labeledvalue.ALabel

J

Johnson - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm: Johnson

K

keySet() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap
keySet() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
keySet() - Method in interface it.univr.di.labeledvalue.LabeledIntMap: A copy of all labels in the map.
keySet() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
keySet() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
keySet(ObjectSet<Label>) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
keySet(ObjectSet<Label>) - Method in interface it.univr.di.labeledvalue.LabeledIntMap
keySet(ObjectSet<Label>) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
keySet(ObjectSet<Label>) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
keyTyped(KeyEvent) - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter

L

label - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry
label - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode
Label - Class in it.univr.di.labeledvalue: Represents an immutable propositional label in the CSTN/CSTNU framework.
LABEL_RE - Static variable in class it.univr.di.labeledvalue.Label: Regular expression representing a Label.
labelCharsRE - Static variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Keyword \w because it is necessary to accept also node names!
LABELED - Enum constant in enum class it.univr.di.cstnu.graph.LabeledNode.Status
LabeledALabelIntTreeMap - Class in it.univr.di.labeledvalue: Allows to manage conjoin-upper-case values that are also associated to propositional labels.
LabeledALabelIntTreeMap(LabeledALabelIntTreeMap, Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Constructor to clone the structure.
LabeledALabelIntTreeMap(Class<? extends LabeledIntMap>) - Constructor for class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Simple constructor.
LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView - Class in it.univr.di.labeledvalue: A read-only view of an object
LabeledALabelIntTreeMapView(LabeledALabelIntTreeMap) - Constructor for class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView
labeledCrossCaseRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Labeled Cross Case Rule
labeledCrossLowerCaseRule(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Labeled Cross-Lower Case (zLc/CC)
labeledCrossLowerCaseRule(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU: Apply B and B-parameter rules of paper about Parameter-CSTNU.
LabeledIntHierarchyMap - Class in it.univr.di.labeledvalue: Simple implementation of LabeledIntMap interface.
LabeledIntHierarchyMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap: Necessary constructor for the factory.
LabeledIntHierarchyMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap: Constructor to clone the structure.
LabeledIntHierarchyMap.HierarchyNode - Class in it.univr.di.labeledvalue: Simple class to represent a labeled value in the hierarchy.
LabeledIntHierarchyMap.LabeledIntHierarchyMapView - Class in it.univr.di.labeledvalue: A read-only view of an object
LabeledIntHierarchyMapView(LabeledIntHierarchyMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntHierarchyMap.LabeledIntHierarchyMapView
LabeledIntMap - Interface in it.univr.di.labeledvalue: Realizes the map Label-->int
LabeledIntMap.LabeledIntMapView - Interface in it.univr.di.labeledvalue: A read-only view of an object
LabeledIntMapSupplier<C> - Class in it.univr.di.labeledvalue: Basic factory of LabeledIntMap objects.
LabeledIntMapSupplier(Class<C>) - Constructor for class it.univr.di.labeledvalue.LabeledIntMapSupplier: Constructor for LabeledIntMapSupplier.
LabeledIntNotMinMapView(LabeledIntSimpleMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap.LabeledIntNotMinMapView
LabeledIntSimpleMap - Class in it.univr.di.labeledvalue: Simple implementation of LabeledIntMap interface without minimization.
LabeledIntSimpleMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap: Necessary constructor for the factory.
LabeledIntSimpleMap(boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap: Necessary constructor for the factory.
LabeledIntSimpleMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap: Constructor to clone the structure.
LabeledIntSimpleMap(LabeledIntMap, boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntSimpleMap: Constructor to clone the structure.
LabeledIntSimpleMap.LabeledIntNotMinMapView - Class in it.univr.di.labeledvalue: A read-only view of an object
LabeledIntTreeMap - Class in it.univr.di.labeledvalue: Simple implementation of LabeledIntMap interface.
LabeledIntTreeMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap: Necessary constructor for the factory.
LabeledIntTreeMap(boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap: Necessary constructor for the factory.
LabeledIntTreeMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap: Constructor to clone the structure.
LabeledIntTreeMap(LabeledIntMap, boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap: Constructor to clone the structure.
LabeledIntTreeMap.LabeledIntTreeMapView - Class in it.univr.di.labeledvalue: A read-only view of an object
LabeledIntTreeMapView(LabeledIntTreeMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeMap.LabeledIntTreeMapView
LabeledIntTreeSimpleMap - Class in it.univr.di.labeledvalue: Extends LabeledIntTreeMap setting optimize field to false.
LabeledIntTreeSimpleMap() - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap: Necessary constructor for the factory.
LabeledIntTreeSimpleMap(boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap: Necessary constructor for the factory.
LabeledIntTreeSimpleMap(LabeledIntMap) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap: Constructor to clone the structure.
LabeledIntTreeSimpleMap(LabeledIntMap, boolean) - Constructor for class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap: Constructor to clone the structure.
labelEditingPlugin - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse
labeledLetterRemovalRule(LabeledNode, LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Labeled Letter Removal (Lr)
labeledLetterRemovalRule(LabeledNode, LabeledNode, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Labeled Letter Removal
labeledLowerCaseRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Labeled Lower Case Rule
LabeledLowerCaseValue - Class in it.univr.di.labeledvalue: Represents an immutable Labeled Lower Case value.
LabeledNode - Class in it.univr.di.cstnu.graph: LabeledNode class.
LabeledNode(LabeledNode) - Constructor for class it.univr.di.cstnu.graph.LabeledNode: Constructor for cloning.
LabeledNode(String) - Constructor for class it.univr.di.cstnu.graph.LabeledNode: Constructor for LabeledNode.
LabeledNode(String, char) - Constructor for class it.univr.di.cstnu.graph.LabeledNode: Standard constructor for an observation node
LabeledNode.Status - Enum Class in it.univr.di.cstnu.graph: Possible status of a node during execution of some visiting algorithms.
LabeledNodeSupplier - Class in it.univr.di.cstnu.graph: LabeledIntEdgePluggable supplier.
LabeledNodeSupplier() - Constructor for class it.univr.di.cstnu.graph.LabeledNodeSupplier
labeledOracleRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Oracle rule.
labeledPotentialCount - Variable in class it.univr.di.cstnu.graph.LabeledNode: Labeled potential count.
labeledPropagationRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Applies 'labeled no case' or 'labeled upper case propagation' rules.
labeledUpperCaseRule(LabeledNode, LabeledNode, LabeledNode, OSTNUEdgePluggable, OSTNUEdgePluggable, OSTNUEdgePluggable) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Applies 'labeled upper case' rules.
labeledValue - Variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Labeled value.
labeledValue - Variable in class it.univr.di.cstnu.graph.STNUEdgeInt: The labeled value associated to the edge when it is a contingent link or a wait constraint.
labeledValueMapImpl - Variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Labeled value class used in the class.
labeledValueMapImpl - Static variable in class it.univr.di.cstnu.graph.LabeledNode: Labeled value class used in the class.
labeledValueMapImpl - Static variable in class it.univr.di.cstnu.graph.TNGraphMLReader: Labeled value class used in the class.
labeledValueMapImpl - Variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Labeled value class used in the class.
labeledValuePropagationCalls - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus: Counters #applications of label propagation rule
labeledValueRE - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap: A labeled value as regular expression.
LabeledValueRE - Static variable in class it.univr.di.labeledvalue.Constants: Regular expression for an acceptable value in a LabeledValue.
labeledValueSetREPattern - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap: Matcher for a set of labeled values.
LabelInconsistent - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
labelModificationqR0(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Implements the zqR0 rule assuming instantaneous reaction and a streamlined network.
This differs from AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, it.univr.di.cstnu.graph.CSTNEdge) in the checking also upper case value
labelModificationqR2(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU: Apply zR2 rule assuming instantaneous reaction and a streamlined network.
labelModificationqR3(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Implements the qR3* rule assuming instantaneous reaction and a streamlined network.
This differs from CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, it.univr.di.cstnu.graph.CSTNEdge) in the checking also upper case value.
labelModificationR0qR0(LabeledNode, LabeledNode, E) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Applies rule R0/qR0: label containing a proposition that can be decided only in the future is simplified removing such proposition.
labelModificationR0qR0Core(LabeledNode, LabeledNode, Label, int) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Execute the core of AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge).
It can be used for applying the rule to a specific pair (w, alpha).
Returns the label to use for storing the new value considering rule R0qR0.
labelModificationR1(LabeledNode, CSTNUEdge, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.PCSTNU: Apply zR1 rule assuming instantaneous reaction and a streamlined network.
labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTN: Rule R3*
Standard DC semantics is assumed.
This method is also valid assuming Instantaneous Reaction semantics.
labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential: Deprecated.
LabelNotSubsumes - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNEdge, CSTNEdge, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTN: Applies the labeled propagation rule:
Standard DC semantics is assumed.
This method is also valid assuming Instantaneous Reaction semantics or epsilon-reaction time.
The rule implements 2018-11 qLP+, submitted to ICAPS19.
labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNEdge, CSTNEdge, CSTNEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential: This version is a restricted version of CSTN.labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNEdge, CSTNEdge, CSTNEdge).
labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Applies 'labeled no case' and 'labeled upper case' and 'forward labeled upper case' and 'labeled conjunct upper case' rules.
labelPropagation(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU: Apply A, A-Parameter, C rules of paper about Parameter-CSTNU.
labelSet() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: labelSet.
labelValidator - Static variable in class it.univr.di.labeledvalue.ALabel: Validator for graphical interface
labelValidator - Static variable in class it.univr.di.labeledvalue.Label: Validator for graphical interface
LANES - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Default lane number
LANES - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Default lane number
last() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue
LATE_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE: Returns the maximum possible execution time, l, with all nodes that have as last possible execution time, i.e., u' == l.
layout - Variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
layoutEditor - Variable in class it.univr.di.cstnu.visualization.TNEditor: Layout for input graph.
layoutToggleButton - Variable in class it.univr.di.cstnu.visualization.TNEditor: Button for re-layout input graph
layoutViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor: Layout for derived graph.
LC_LABEL - Static variable in interface it.univr.di.cstnu.graph.STNUEdge: Constant LC_LABEL="LC"
length - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: The current (cached) length of ObjectArrayFIFOSetQueue.backingArray.
letterRemovalRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus: Counters about the # of application of different rules.
letterRemovalRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: Counters about the # of application of different rules.
Literal - Class in it.univr.di.labeledvalue: An immutable literal.
load(Reader, Class<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraphMLReader: Creates the graph object using the given reader for acquiring the input.
loadGraphG(File) - Method in class it.univr.di.cstnu.visualization.TNEditor: Loads TNGraph stored in file 'fileName' into attribute this.g.
Be careful! The extension of the file name determines the kind of TNGraph.
loadPlugins() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse: create the plugins, and load the plugins for TRANSFORMING mode
LOG - Static variable in class it.univr.di.cstnu.algorithms.PCSTNU: logger
LOG - Static variable in class it.univr.di.cstnu.graph.CSTNEdgePluggable: logger
LOG - Static variable in interface it.univr.di.cstnu.graph.STNUEdge: logger
LOG - Static variable in class it.univr.di.cstnu.graph.TNGraphMLReader: logger
LOG - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter: logger
LOG - Static variable in class it.univr.di.cstnu.util.Checker: class logger
LOG - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: logger
LOG - Static variable in class it.univr.di.cstnu.util.CSTNU2CSTNPSU: logger
LOG - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga: class logger
LOG - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: class logger
LOG - Static variable in class it.univr.di.cstnu.util.GraphML2Luke: class logger
LOG - Static variable in class it.univr.di.cstnu.util.Luke2GraphML: class logger
LOG - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: logger
LOG - Static variable in class it.univr.di.cstnu.util.STNUDensifier: logger
LOG - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: logger
LOG - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: class logger
LOG - Static variable in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin
LOG - Static variable in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin: logger
LOG - Static variable in class it.univr.di.cstnu.visualization.TNEditor: class logger
lowerBound() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink: Returns the value of the lowerBound record component.
lowerCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus: Counters about the # of application of different rules.
lowerCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: Counters about the # of application of different rules.
lowerCaseValue - Variable in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable: Morris Lower case value augmented by a propositional label.
The name of node has to be equal to the original name.
lowerCaseValue - Variable in class it.univr.di.cstnu.graph.CSTNUEdgePluggable: Morris Lower case value augmented by a propositional label.
lowerCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.CSTNU
lowerCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.OSTNU
lowerCaseValuesAsString() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
lowerCaseValuesAsString() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
lowerCaseValuesAsString() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
lowerCaseValueSize() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge
lowerCaseValueSize() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
lowerCaseValueSize() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
lowerContingentEdge - Variable in class it.univr.di.cstnu.algorithms.CSTNU: Utility map that return the edge containing the lower case constraint of a contingent link given the contingent time point.
lowerContingentEdge - Variable in class it.univr.di.cstnu.algorithms.OSTNU: Utility map that return the edge containing the lower case constraint of a contingent link given the contingent time point.
lowerContingentLink - Variable in class it.univr.di.cstnu.algorithms.CSTNPSU: Utility map that return the edge containing the lower case constraint of a contingent link given the contingent time point.
lpMustRestricted2ConsistentLabel(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTN: Returns true if label propagation rule (for example, CSTN.labelPropagation(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.CSTNEdge, it.univr.di.cstnu.graph.CSTNEdge, it.univr.di.cstnu.graph.CSTNEdge) method) has to apply only for consistent labels.
Overriding this method it is possible implement the different semantics in the CSTN.labelPropagation(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.CSTNEdge, it.univr.di.cstnu.graph.CSTNEdge, it.univr.di.cstnu.graph.CSTNEdge) method.
lpMustRestricted2ConsistentLabel(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
lpMustRestricted2ConsistentLabel(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTNIR
Luke2GraphML - Class in it.univr.di.cstnu.util: Utility class for converting (C)STN(U) file in Luke format to GraphML format.
Luke2GraphML() - Constructor for class it.univr.di.cstnu.util.Luke2GraphML

M

main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTN: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTN2CSTN0
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilon: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilon3R: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIR: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIR3R: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNPotential: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU: Reads a CSTNPSU file and determines its prototypal link.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNU: Reads a CSTNU file and checks it.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNU2CSTN
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel: Just for using this class also from a terminal.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.FTNU
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.OSTNU: Reads a CSTNU file and checks it.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.PCSTNU: Reads a PCSTNU file and checks it.
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.STN
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.STNU
main(String[]) - Static method in class it.univr.di.cstnu.algorithms.STNURTE
main(String[]) - Static method in class it.univr.di.cstnu.util.Checker: Allows to check the execution time of DC checking algorithm giving a set of instances.
main(String[]) - Static method in class it.univr.di.cstnu.util.CSTNRandomGenerator: main.
main(String[]) - Static method in class it.univr.di.cstnu.util.CSTNU2CSTNPSU: Allows the modification of a set of input instances.
main(String[]) - Static method in class it.univr.di.cstnu.util.CSTNU2UppaalTiga: Reads a CSTNU file and converts it into UPPAAL TIGA format.
main(String[]) - Static method in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: Allows to check the execution time of algorithms giving a set of instances.
main(String[]) - Static method in class it.univr.di.cstnu.util.GraphML2Luke
main(String[]) - Static method in class it.univr.di.cstnu.util.Luke2GraphML
main(String[]) - Static method in class it.univr.di.cstnu.util.OSTNURandomGenerator
main(String[]) - Static method in class it.univr.di.cstnu.util.STNUDensifier: Allows the modification of a set of input instances.
main(String[]) - Static method in class it.univr.di.cstnu.util.STNURandomGenerator
main(String[]) - Static method in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: Allows to check the execution time of algorithms giving a set of instances.
main(String[]) - Static method in class it.univr.di.cstnu.visualization.TNEditor
main(String[]) - Static method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
mainConditionForRestrictedLP(int, int) - Static method in class it.univr.di.cstnu.algorithms.CSTNU: IR Semantics
mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Returns true if AbstractCSTN.labelModificationR0qR0(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, E) method has to not apply.
Overriding this method it is possible implement the different semantics in the AbstractCSTN.labelModificationR0qR0(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, E) method.
mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.CSTNIR
mainConditionForSkippingInR0qR0(int) - Method in class it.univr.di.cstnu.algorithms.CSTNU: IR Semantics Returns true if AbstractCSTN.labelModificationR0qR0(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, E) method has to not apply.
Overriding this method it is possible implement the different semantics in the AbstractCSTN.labelModificationR0qR0(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, E) method.
mainConditionForSkippingInR3qR3(int, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Returns true if CSTN.labelModificationR3qR3(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.CSTNEdge) method has to not apply.
Overriding this method it is possible implement the different semantics in the CSTN.labelModificationR3qR3(it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.LabeledNode, it.univr.di.cstnu.graph.CSTNEdge) method.
mainConditionForSkippingInR3qR3(int, LabeledNode) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon
mainInt2SetMap - Variable in class it.univr.di.labeledvalue.LabeledIntTreeMap: Design choice: the set of labeled values of this map is organized as a collection of sets each containing labels of the same length.
mainMap - Variable in class it.univr.di.labeledvalue.LabeledIntSimpleMap: Map of label
MAKE_MINIMAL_DISPATCHABLE(TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN: Adds to the given graph the undominated edges and return such added/modified edges as a map ((sourceName, destinationName), edge).
MAKE_NODES_REACHABLE_BY(TNGraph<E>, LabeledNode, int, String) - Static method in class it.univr.di.cstnu.algorithms.STN: Makes each node reachable by source adding an edge between source and each other node with value horizon and name prefixed by prefix, followed by "__", source name, "__", and node name.
The type of edge is Edge.ConstraintType.internal.
makeAllMaxProjection() - Method in class it.univr.di.cstnu.algorithms.OSTNU
makeAlphaBetaGammaPrime4R3(LabeledNode, LabeledNode, LabeledNode, char, Label, Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Simple method to determine the label "αβγ" for rule CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge).
See Table 1 and Table 2 ICAPS 2016 paper.
makeAlphaPrime(LabeledNode, LabeledNode, char, Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Simple method to determine the α' to use in rules R0 and in rule qR0.
Check paper TIME15 and ICAPS 2016 about CSTN sound&complete DC check.
α' is obtained by α removing all children of the observed proposition.
If X==Z, then it is necessary also to remove all children of unknown from α'.
makeBetaGammaDagger4qR3(LabeledNode, LabeledNode, char, Label, Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Simple method to determine the label (β*γ)† to use in rules qR3* CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge).
See Table 1 and Table 2 ICAPS 2016 paper.
makeDispatchable() - Method in class it.univr.di.cstnu.algorithms.STN: Makes the graph dispatchable applying Muscettola et al.
makeMinimalDispatchable() - Method in class it.univr.di.cstnu.algorithms.STN: Makes this network dispatchable where edges are only undominated ones.
This method is equivalent to STN.makeDispatchable() but it uses a different algorithm.
If the network is not initialized (STN.initAndCheck(), it calls STN.initAndCheck() before running.
makeNewEdge(String, Edge.ConstraintType) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Create an edge assuring that its name is unique in the graph 'g'.
makeNewEdge(String, Edge.ConstraintType) - Method in class it.univr.di.cstnu.graph.TNGraph: Creates a new edge proper for this graph using edgeName as a proposed name (it will be modified adding a suffix if there is already another edge with name edgeName) and setting the type to type.
makeOrdinaryConstraintMinimalDispatchable(ObjectSet<E>, ObjectList<E>) - Method in class it.univr.di.cstnu.algorithms.STNU: Adds to the given graph the undominated edges and return such added/modified edges as a map ((sourceName, destinationName), edge).
manageParameters(String[]) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Simple method to manage command line parameters using "args4j" library.
manageParameters(String[]) - Method in class it.univr.di.cstnu.algorithms.STN: Simple method to manage command line parameters using `args4j` library.
manageParameters(String[]) - Method in class it.univr.di.cstnu.visualization.TNEditor: Simple method to manage command line parameters using args4j library.
map - Variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Data structure.
mapInfoLabel - Variable in class it.univr.di.cstnu.visualization.TNEditor
MAX_ALABELALPHABET_SIZE - Static variable in class it.univr.di.labeledvalue.ALabel: Maximum size for the alphabet.
MAX_ALABELALPHABET_SIZE - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet: Maximum size for the alphabet.
MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Maximum checks for a network
MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Maximum checks for a network
MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.STNUDensifier: Maximum checks for a network
MAX_CHECKS - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Maximum checks for a network
MAX_CONTINGENT_RANGE - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Max distance between lower and upper value in a contingent link
MAX_CONTINGENT_RANGE - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Max distance between lower and upper value in a contingent link
MAX_CONTINGENT_WEIGHT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Max weight value
MAX_CONTINGENT_WEIGHT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Max weight value
maxMeterSize - Static variable in class it.univr.di.cstnu.util.RunMeter: A value between 0 and 100
maxMinConstraint - Variable in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus: maxMin constraint added;
maxWeight - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN: Absolute value of the max negative weight determined during initialization phase.
mergeLabeledValue(LabeledIntMap) - Method in interface it.univr.di.cstnu.graph.CSTNEdge
mergeLabeledValue(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
mergeLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
mergeLabeledValue(Label, int) - Method in interface it.univr.di.cstnu.graph.CSTNEdge: Merges the labeled value i to the set of labeled values of this edge.
mergeLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Merges the labeled value i to the set of labeled values of this edge.
mergeLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
mergeLabeledValue(String, int) - Method in interface it.univr.di.cstnu.graph.CSTNEdge: Wrapper method for CSTNEdge.mergeLabeledValue(Label, int).
mergeLabeledValue(String, int) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable: Wrapper method for CSTNEdge.mergeLabeledValue(Label, int).
mergeLowerCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge: Merge a lower label constraint with value i for the node name n with label l.
mergeLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
mergeLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
mergeTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView: Object Read-only.
mergeTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: mergeTriple.
mergeTriple(Label, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView: Object Read-only.
mergeTriple(Label, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Merges a label case value (p,l,i).
mergeTriple(String, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView: Object Read-only.
mergeTriple(String, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Wrapper method.
mergeTriple(String, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView: Object Read-only.
mergeTriple(String, ALabel, int, boolean) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap: Wrapper method to LabeledALabelIntTreeMap.mergeTriple(Label, ALabel, int, boolean).
mergeUpperCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge: Merge an upper label constraint with delay i for the node name n with propositional label l.
If the new value makes other already present values redundant, such values are removed.
mergeUpperCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable
MIDDLE_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE: Returns the middle possible execution time, m, with all nodes that can be executed at that time, i.e., l' ≤ m.
It is assumed that candidates.timeInterval = [l, u], m = (l+u)/2 and each node has a time interval [l',u'] such that l ≤ l' and u ≤ u'.
MIN_MAX_WEIGHT - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Min max weight value
MIN_MAX_WEIGHT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Min max weight value
MIN_MAX_WEIGHT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Min max weight value
MIN_NODES - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Min number of nodes
MIN_NODES - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Min number of nodes
MIN_NODES - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Min number of nodes
MIN_NODES_QLOOP - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Min number of nodes in a qLoop
MIN_PROPOSITIONS - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Min number of propositions
minNegativeWeight - Variable in class it.univr.di.cstnu.algorithms.STN: Absolute value of the max negative weight determined during initialization phase.
modCount - Variable in class it.univr.di.labeledvalue.ALabel: The number of times this ALabel has been structurally modified.
modeBoxIndex - Variable in class it.univr.di.cstnu.visualization.TNEditor: Position of the mode box for the main editor
modeBoxViewerIndex - Variable in class it.univr.di.cstnu.visualization.TNEditor: Position of the mode box for the viewer
ModeKeyAdapter(char, char, char, char, ModalGraphMouse) - Constructor for class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
ModeKeyAdapter(ModalGraphMouse) - Constructor for class it.univr.di.cstnu.visualization.EditingModalGraphMouse.ModeKeyAdapter
modelType() - Method in class it.univr.di.cstnu.visualization.ObservableValidator
Morris2014 - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm: Morris cubic algorithm
Morris2014Dispatchable - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm: Morris cubic algorithm
morrisSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: Filename suffix of STNU checked by MorrisDispatchable algorithm.
mouseClicked(MouseEvent) - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin: For primary modifiers (default, MouseButton1): Pick a single Vertex or Edge that is under the mouse pointer.
If no Vertex or Edge is under the pointer, unselect all picked Vertices and Edges, and set up to draw a rectangle for multiple selection of contained Vertices.
mouseClicked(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
mouseDragged(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin: If startVertex is non-null, stretch an edge shape between startVertex and the mouse pointer to simulate edge creation
mouseEntered(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
mouseEventToolTipFunction - Static variable in class it.univr.di.cstnu.visualization.TNEditor: Tooltip rendering for the mouse movement
mouseExited(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
mouseMoved(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin
mousePressed(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin: If the mouse is pressed in an empty area, create a new vertex there.
mouseReleased(MouseEvent) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin: If startVertex is non-null, and the mouse is released over an existing vertex, create an undirected edge from startVertex to the vertex under the mouse pointer.

N

name - Variable in class it.univr.di.cstnu.graph.AbstractComponent: Possible name
name - Variable in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter
nameCorrespondingEndNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
nameCorrespondingStartNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
nameCorrespondingXOREndNode(String) - Static method in class it.univr.di.cstnu.visualization.CSTNLayout
NEGATED - Static variable in class it.univr.di.labeledvalue.Literal: Constant NEGATED=Constants.NOT
negation() - Method in class it.univr.di.labeledvalue.Label: Since a label is a conjunction of literals, its negation is a disjunction of negative literals (i.e., not a label).
NEGATIVE_INFINITY_SYMBOLstring - Static variable in class it.univr.di.labeledvalue.Constants: Negative infinitive.
negativeCycle - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: The list of LabeledNode representing a negative loop has been found (if the network is not consistent and the algorithm can build it).
negativeLoopNode - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: The node with a negative loop in case that the graph is not consistent and the algorithm can determine only the node with negative loop.
NETWORK_TYPE_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
networkType - Variable in class it.univr.di.cstnu.graph.TNGraphMLWriter: Graph type
neverPresent - Enum constant in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status: the element has never been added in the queue.
newInstance() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
newInstance() - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
newInstance() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
newInstance() - Method in interface it.univr.di.cstnu.graph.Edge: Factory
newInstance() - Method in class it.univr.di.cstnu.graph.LabeledNode
newInstance() - Method in interface it.univr.di.cstnu.graph.Node: Factory
newInstance() - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
newInstance() - Method in class it.univr.di.cstnu.graph.STNEdgeInt
newInstance() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
newInstance() - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Factory
newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
newInstance() - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap: Factory
newInstance(boolean) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Factory
newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap: Factory
newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
newInstance(boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
newInstance(Edge) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
newInstance(Edge) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
newInstance(Edge) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
newInstance(Edge) - Method in interface it.univr.di.cstnu.graph.Edge: Any super-interfaces/implementing classes should assure that such method has edge as argument!
newInstance(Edge) - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
newInstance(Edge) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
newInstance(Edge) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
newInstance(Node) - Method in class it.univr.di.cstnu.graph.LabeledNode
newInstance(Node) - Method in interface it.univr.di.cstnu.graph.Node: Any super-interfaces/implementing classes should assure that such method has Edge node as argument!
newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap
newInstance(LabeledIntMap) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Factory
newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap
newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
newInstance(LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap: Factory
newInstance(LabeledIntMap, boolean) - Method in interface it.univr.di.labeledvalue.LabeledIntMap: Factory
newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap: Factory
newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap
newInstance(LabeledIntMap, boolean) - Method in class it.univr.di.labeledvalue.LabeledIntTreeSimpleMap
newInstance(String) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable
newInstance(String) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable
newInstance(String) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable
newInstance(String) - Method in interface it.univr.di.cstnu.graph.Edge: Factory
newInstance(String) - Method in class it.univr.di.cstnu.graph.LabeledNode
newInstance(String) - Method in interface it.univr.di.cstnu.graph.Node: Factory
newInstance(String) - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable
newInstance(String) - Method in class it.univr.di.cstnu.graph.STNEdgeInt
newInstance(String) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt
newValueInR3qR3(int, int) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN: Determines the new value that rules R3 and qR3 (see Table 1 in ICAPS 2016 paper) must add.
newValueInR3qR3(int, int) - Method in class it.univr.di.cstnu.algorithms.CSTNEpsilon: According to Table 2 paper ICAPS16, it returns max(edgeValue, obsEdgeValue-ɛ).
node - Variable in class it.univr.di.cstnu.visualization.ObservableValidator
node() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval: Returns the value of the node record component.
Node - Interface in it.univr.di.cstnu.graph: Root class for representing nodes in it.univr.di.cstnu package.
NODE_LABEL_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
NODE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Default node name prefix
NODE_NAME_PREFIX - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Default node name prefix
NODE_OBSERVED_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
NODE_PARAMETER_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
NODE_POTENTIAL_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
NODE_X_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
NODE_Y_KEY - Static variable in class it.univr.di.cstnu.graph.TNGraphMLWriter
nodeDrawPaintTransformer(PickedInfo<K>, Paint, Paint, Paint, Paint, Paint, Paint) - Static method in enum class it.univr.di.cstnu.visualization.NodeRendering: Returns a transformer to select the color that is used to draw the node.
NodeEnabledInTimeInterval(TimeInterval, ObjectSet<STNURTE.NodeWithTimeInterval>) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval: Creates an instance of a NodeEnabledInTimeInterval record class.
NodeOccurrence(int, Set<LabeledNode>) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence: Creates an instance of a NodeOccurrence record class.
NodeRendering - Enum Class in it.univr.di.cstnu.visualization: Provides method for LabeledNode rendering in TNEditor GUI application.
nodes - Variable in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey: # of nodes
nodes() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval: Returns the value of the nodes record component.
nodes() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence: Returns the value of the nodes record component.
nodes2check - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck: It must be a queue without replication set because a node may be added more times!
NodesToCheck() - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck
NodesToCheck(Collection<LabeledNode>) - Constructor for class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck: A simple constructor when the initial set of nodes is available.
nodesToExecute - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTED
NodeWithTimeInterval(TimeInterval, LabeledNode) - Constructor for record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval: Creates an instance of a NodeWithTimeInterval record class.
NonNegIntValueRE - Static variable in class it.univr.di.labeledvalue.Constants: Regular expression for an acceptable positive integer.
NOT - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga: Token to represent logic NOT in Tiga expression.
NOT - Static variable in class it.univr.di.labeledvalue.Constants: Char representing logic not symbol: ¬.
NOT_DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator: Name of sub dir containing NOT DC instances
NOT_DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator: Name of sub dir containing NOT DC instances
NOT_DC_SUB_DIR_NAME - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator: Name of sub dir containing NOT DC instances
note - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus: A possible note
NOTstring - Static variable in class it.univr.di.labeledvalue.Constants
NUMBER_OF_POSSIBLE_PROPOSITIONS - Static variable in class it.univr.di.labeledvalue.Label: Maximal number of possible proposition in a network.
numberOfNodes - Variable in class it.univr.di.cstnu.algorithms.CSTNPotential: TNGraph<CSTNEdge> order

O

ObjectArrayFIFOSetQueue<K> - Class in it.univr.di.cstnu.util: A type-specific array-based FIFO queue, supporting also dequeue operations.
ObjectArrayFIFOSetQueue() - Constructor for class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: Creates a new empty queue with standard ObjectArrayFIFOSetQueue.INITIAL_CAPACITY.
ObjectArrayFIFOSetQueue(int) - Constructor for class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue: Creates a new empty queue with given capacity.
ObjectPair<T> - Class in it.univr.di.cstnu.util: An implementation of Collection interface that stores exactly 2 objects and is immutable.
ObjectPair(T, T) - Constructor for class it.univr.di.cstnu.util.ObjectPair: Creates a Pair from the specified elements.
ObservableValidator - Class in it.univr.di.cstnu.visualization: Validator for observable.
ObservableValidator(TNGraph<?>, LabeledNode) - Constructor for class it.univr.di.cstnu.visualization.ObservableValidator
ObservationNodeDoesNotExist - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type
ObservationNodeDoesNotOccurBefore - Enum constant in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type: Deprecated.
occurrenceTime() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence: Returns the value of the occurrenceTime record component.
ON - Static variable in enum class it.univr.di.Debug: set to false to allow compiler to identify and eliminate debug code.
oneStepAgileControllability(AbstractCSTN.EdgesToCheck<OSTNUEdgePluggable>, Instant) - Method in class it.univr.di.cstnu.algorithms.OSTNU: Executes one step of the agile controllability check.
Before the first execution of this method, it is necessary to execute OSTNU.initAndCheck().
oneStepBackGraph - Variable in class it.univr.di.cstnu.visualization.TNEditor: TNGraph structures necessary to represent an auxiliary graph.
oneStepDynamicConsistencyByEdges(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTN: Executes one step of the dynamic consistency check.
oneStepDynamicConsistencyByEdges(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential: Deprecated.
oneStepDynamicConsistencyByEdgesLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTN: Executes one step of the dynamic consistency check.
oneStepDynamicConsistencyByEdgesLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential: Deprecated.
oneStepDynamicConsistencyByNode() - Method in class it.univr.di.cstnu.algorithms.CSTN: Executes one step of the dynamic consistency check.
For each possible triangle of the network, label propagation rule is applied and, on the resulting edge, all other rules, R0, R3 and potential ones, are also applied.
This method is offered for studying the propagation node by node.
oneStepDynamicConsistencyByNode() - Method in class it.univr.di.cstnu.algorithms.CSTNPotential: Deprecated.
oneStepDynamicControllability(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Executes one step of the dynamic controllability check.
Before the first execution of this method, it is necessary to execute CSTNU.initAndCheck().
oneStepDynamicControllability(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.PCSTNU
oneStepDynamicControllabilityLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNPSUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU: Executes one step of the dynamic controllability check.
oneStepDynamicControllabilityLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNU: Executes one step of the dynamic controllability check considering only a pair of edges going to Z, i.e., in the form A-->B-->Z.
Before the first execution of this method, it is necessary to execute CSTNU.initAndCheck().
oneStepDynamicControllabilityLimitedToZ(AbstractCSTN.EdgesToCheck<CSTNUEdge>, Instant) - Method in class it.univr.di.cstnu.algorithms.PCSTNU: Executes one step of the dynamic controllability check considering only a pair of edges going to/from Z or parameter nodes.
The name says limited to Z because it is inherited from CSTNU, but such method calls other that consider also parameter nodes as Z node.
Before the first execution of this method, it is necessary to execute PCSTNU.initAndCheck().
Note: this version is not optimized with respect to the number of times and edge is considered at each call.
onlyToZ - Variable in class it.univr.di.cstnu.visualization.TNEditor: OnlyToZ says if the DC checking has to be made propagating constraints only to time-point Z
onlyToZCB - Variable in class it.univr.di.cstnu.visualization.TNEditor
OPEN_PAIR - Static variable in class it.univr.di.labeledvalue.Constants: String representing labeled-value opening.
OPEN_TUPLE - Static variable in class it.univr.di.labeledvalue.Constants: A tuple opening char
optimize - Variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap: Optimize In same applications it is important to maintain ¬C,0 and C,1.
OR - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga: Token to represent logic OR in Tiga expression.
oracleNode - Variable in class it.univr.di.cstnu.algorithms.OSTNU: Utility map that returns the oracle node O_C associated to a contingent node C.
oracleRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus: Counters about the # of application of different rules.
ostnu - Variable in class it.univr.di.cstnu.visualization.TNEditor: OSTNU checker
OSTNU - Class in it.univr.di.cstnu.algorithms: Represents a Simple Temporal Network with Uncertainty and Oracles (OSTNU).
OSTNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType: STNU with oracles
OSTNU() - Constructor for class it.univr.di.cstnu.algorithms.OSTNU: Default constructor, package use only!
OSTNU(TNGraph<OSTNUEdgePluggable>) - Constructor for class it.univr.di.cstnu.algorithms.OSTNU: Constructor for CSTNU
OSTNU(TNGraph<OSTNUEdgePluggable>, int) - Constructor for class it.univr.di.cstnu.algorithms.OSTNU: Constructor for CSTNU
OSTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.OSTNU: Helper constructor for CSTNU.
OSTNU_SUFFIX - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator
OSTNU.OSTNUCheckStatus - Class in it.univr.di.cstnu.algorithms: Simple class to represent the status of the checking algorithm during an execution.
controllability = super.consistency.
OSTNUCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus
OSTNUEdgePluggable - Class in it.univr.di.cstnu.graph: An implementation of OSTNUEdge where the labeled value set is not optimized for maintain scenarios like ¬c,0 and c,1.
OSTNUEdgePluggable() - Constructor for class it.univr.di.cstnu.graph.OSTNUEdgePluggable
OSTNUEdgePluggable(Edge) - Constructor for class it.univr.di.cstnu.graph.OSTNUEdgePluggable: Constructor to clone the component.
OSTNUEdgePluggable(String) - Constructor for class it.univr.di.cstnu.graph.OSTNUEdgePluggable
OSTNURandomGenerator - Class in it.univr.di.cstnu.util: Allows one to build random OSTNU instances specifying: number of wanted DC/NOT DC instances And the following parameters that characterize each generated instance: number nodes number of contingent nodes number of oracles max weight for each edge max weight for each contingent link (upper value) max in-degree for each node max out-degree for each node probability to have an edge between any pair of nodes
OSTNURandomGenerator(int, int, int, int, double, int, int) - Constructor for class it.univr.di.cstnu.util.OSTNURandomGenerator
ostnuStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor: OSTNU check status
outDegree(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph
OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.Checker: Output file header
OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: Output file header
OUTPUT_HEADER - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: Output file header
OUTPUT_HEADER_CSTN - Static variable in class it.univr.di.cstnu.util.Checker: CSTN header
OUTPUT_HEADER_CSTNPSU - Static variable in class it.univr.di.cstnu.util.Checker: CSTNPSU header
OUTPUT_HEADER_CSTNU - Static variable in class it.univr.di.cstnu.util.Checker: CSTNU header
OUTPUT_HEADER_STNU - Static variable in class it.univr.di.cstnu.util.Checker: Header
OUTPUT_ROW_ALG_STATS - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
OUTPUT_ROW_ALG_STATS - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.Checker
OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner: OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
OUTPUT_ROW_GRAPH - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner: OUTPUT_ROW is split in OUTPUT_ROW_GRAPH + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS + OUTPUT_ROW_ALG_STATS
OUTPUT_ROW_TIME - Static variable in class it.univr.di.cstnu.util.Checker
OUTPUT_ROW_TIME_CSTN - Static variable in class it.univr.di.cstnu.util.Checker
OUTPUT_ROW_TIME_STATS_CSTNPSU - Static variable in class it.univr.di.cstnu.util.Checker: For CSTNPSU statistics
OUTPUT_ROW_TIME_STATS_CSTNU - Static variable in class it.univr.di.cstnu.util.Checker
OUTPUT_ROW_TIME_STNU - Static variable in class it.univr.di.cstnu.util.Checker

P

pairAsString(Label, int) - Static method in class it.univr.di.cstnu.algorithms.AbstractCSTN

pairAsString(Label, int) - Static method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

parameterNodes - Variable in class it.univr.di.cstnu.algorithms.PCSTNU

The set of parameter nodes

parse(String) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap

parse(String) - Static method in class it.univr.di.labeledvalue.Label

Parse a string representing a label and return an equivalent Label object if no errors are found, null otherwise.

parse(String) - Static method in class it.univr.di.labeledvalue.Literal

Parses the string s returning the literal represented.

parse(String, ALabelAlphabet) - Static method in class it.univr.di.labeledvalue.ALabel

Parse a string representing an A-label and return an equivalent A-Label object if no errors are found, null otherwise.

parse(String, ALabelAlphabet) - Static method in class it.univr.di.labeledvalue.LabeledLowerCaseValue

Parses a string representing a labeled lower-case value and returns an object containing the labeled values represented by the string.
The format of the string is given by the method LabeledLowerCaseValue.toString():\{{(&lang;label&rang;, &lang;Alabel&rang;, &lang;value&rang;) }*\}
It also parse the old format: \{{(&lang;Alabel&rang;, &lang;value&rang;, &lang;label&rang;) }*\}

parse(String, ALabelAlphabet, Class<? extends LabeledIntMap>) - Static method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

Parse a string representing a LabeledValueTreeMap and return an object containing the labeled values represented by the string.
The format of the string is given by the method LabeledALabelIntTreeMap.toString().

parse(String, Class<? extends LabeledIntMap>) - Static method in class it.univr.di.labeledvalue.AbstractLabeledIntMap

Parse a string representing a LabeledValueTreeMap and return an object containing the labeled values represented by the string.
The format of the string is given by the method AbstractLabeledIntMap.toString(): {\[(<value>, <key>) \]*} This method is also capable to parse the old format: {\[(<key>, <value>) \]*}

partialExecutionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Another counter for storing an execution time of a part of the process.

patternLabelCharsRE - Static variable in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

Matcher for RE

pcs - Variable in class it.univr.di.cstnu.graph.AbstractComponent

Since Java 9, Observable is no more supported.

pcstnu - Variable in class it.univr.di.cstnu.visualization.TNEditor

PCSTNU checker

PCSTNU - Class in it.univr.di.cstnu.algorithms

Simple class that extends CSTNU for representing and managing also 'parameter nodes'.

PCSTNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType

PCSTNU() - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU

Constructor only for the main and possible extensions.

PCSTNU(TNGraph<CSTNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU

PCSTNU(TNGraph<CSTNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU

PCSTNU(String) - Constructor for class it.univr.di.cstnu.algorithms.PCSTNU

plainSuffix - Static variable in class it.univr.di.cstnu.util.GraphML2Luke

Default extension

popupEditingPlugin - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse

Plugin for editing

positionInitializer - Static variable in class it.univr.di.cstnu.visualization.CSTNLayout

Returns the coordinates of a node as Point2d object.

positionInitializer - Static variable in class it.univr.di.cstnu.visualization.CSTNUStaticLayout

It is used for getting the coordinates of node stored inside LabelNode object.

potentialR3(LabeledNode[], AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential

Apply rule R3 to potentials of each node in nodesToCheck.

potentialUpdate - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus

Counters #applications of potential update

preferredSize - Variable in class it.univr.di.cstnu.visualization.TNEditor

the preferred sizes for the two views

prefix - Static variable in class it.univr.di.cstnu.graph.TNGraphMLReader

present - Enum constant in enum class it.univr.di.labeledvalue.ALabel.State

A negated literal is true if the truth value assigned to its proposition letter is false, false otherwise.

present - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

To fast check if an element is present

printProgress() - Method in class it.univr.di.cstnu.util.RunMeter

printProgress(long) - Method in class it.univr.di.cstnu.util.RunMeter

Each call of method, advance `this.current` and print the meter.

printVersion() - Method in class it.univr.di.cstnu.util.CSTNU2CSTNPSU

Print version of this class in System.out.

printVersion() - Method in class it.univr.di.cstnu.util.STNUDensifier

Print version of this class in System.out.

propagationCalls - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Number of propagations

propagationOnlyToZ - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

Check using full set of rules R0, qR0, R3, qR3, LP, qLP or the reduced set qR0, qR3, LP.

propertyChange(PropertyChangeEvent) - Method in class it.univr.di.cstnu.graph.TNGraph

propertyChange(PropertyChangeEvent) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

PROPOSITION_ARRAY - Static variable in class it.univr.di.labeledvalue.Literal

List of possible proposition managed by this class.
Such list is made concatenating 2 blocks: a-z, and A-F.

PROPOSITION_RANGE - Static variable in class it.univr.di.labeledvalue.Literal

R.E.

propositionObserved - Variable in class it.univr.di.cstnu.graph.LabeledNode

Possible proposition observed.

propositionOfPair - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus

Map (Ctg,Node)-->proposition

propositions - Variable in class it.univr.di.cstnu.util.Checker.GlobalStatisticKey

# of propositions

PROPOSITIONS - Static variable in class it.univr.di.labeledvalue.Literal

R.E.

prototypalLink - Variable in class it.univr.di.cstnu.algorithms.CSTNPSU

Cache of the prototypal link

PrototypalLink(CSTNPSU.PrototypalLink) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink

Copy constructor

PrototypalLink(String, int, int, int, int, int, String) - Constructor for class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink

Creates an immutable prototypal link.

put(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel

put(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabelAlphabet

Puts the element v in the map if not present.

put(ALabel, LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView

Object Read-only.

put(ALabel, LabeledIntMap) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

Put a map associate to key alabel.

put(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

put(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView

Object Read-only.

put(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap

Put a label with value i if label l is not null and there is not a labeled value in the set with label l or it is present but with a value higher than l.

put(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap

put(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap

Put a label with value i if label l is not null and there is not a labeled value in the set with label l or it is present but with a value higher than l.

putAll(LabeledIntMap) - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView

putAll(LabeledIntMap) - Method in interface it.univr.di.labeledvalue.LabeledIntMap

Put all elements of inputMap into the current one without making a defensive copy.

putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

Put the labeled value without any control.

putForcibly(Label, int) - Method in interface it.univr.di.labeledvalue.LabeledIntMap

Put the labeled value without any control.

putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap

Put the labeled value without any control.

putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap.LabeledIntTreeMapView

Object Read-only.

putForcibly(Label, int) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap

putLabeledPotential(Label, int) - Method in class it.univr.di.cstnu.graph.LabeledNode

Puts the labeled value (value, l) into the potential map.

putLabeledUpperPotential(Label, int) - Method in class it.univr.di.cstnu.graph.LabeledNode

Puts the labeled value (value, l) into the upper potential map.

putLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

putLabeledValue(Label, int) - Method in interface it.univr.di.cstnu.graph.CSTNEdge

putLabeledValue(Label, int) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable

putLowerCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge

Put a lower label constraint with value i for the node name n with label l.
Putting does not make any label optimization.

putLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable

putLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable

putTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView

Object Read-only.

putTriple(Label, ALabel, int) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

Put the triple (p,l,i) into the map.

putUpperCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge

Put an upper label constraint with delay i for the node name n with label l.
There is no optimization of the labeled values present after the insertion of this one.

putUpperCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

Q

QLOOP_VALUE - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator

Default negative value of each qLoop

qloopFinder - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType

The edge represents an internal one used by qloop finder

R

r0calls - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus

Counters #applications of r0 rule

r3calls - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus

Counters #applications of r3 rule

RANDOM_EXECUTION_STRATEGY - Static variable in class it.univr.di.cstnu.algorithms.STNURTE

Returns a random execution time, r, in the allowed interval [l, u] with all nodes that can be executed at that time.

reactionTime - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

WD2.2 epsilon value called also reaction time in ICAPS 18.

reactionTime - Variable in class it.univr.di.cstnu.visualization.TNEditor

Reaction time for CSTN

readGraph(File, Class<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraphMLReader

Reads graphFile and returns the corresponding graph as a TNGraph object.

readGraph(String, Class<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraphMLReader

Reads graphXML and returns the corresponding graph as a TNGraph object.

remove(byte) - Method in class it.univr.di.labeledvalue.ALabel

remove(char) - Method in class it.univr.di.labeledvalue.Label

Returns a new label that is a copy of this without proposition if it is present.

remove(LabeledNode) - Method in class it.univr.di.cstnu.util.ActiveWaits

Remove the wait associated to contingent from the queue.

remove(ALabel) - Method in class it.univr.di.labeledvalue.ALabel

It removes all a-letters in aLabel from the current label.

remove(ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

remove.

remove(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel

remove(ALabelAlphabet.ALetter) - Method in class it.univr.di.labeledvalue.ALabel

It removes a-letter if it is present, otherwise it does nothing.

remove(ALabelAlphabet.ALetter[]) - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel

remove(ALabelAlphabet.ALetter[]) - Method in class it.univr.di.labeledvalue.ALabel

It removes all a-letters in inputSet from the current label.

remove(Label) - Method in class it.univr.di.labeledvalue.Label

Returns a new label copy of this where all literals with names in inputLabel are removed.

remove(Label) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

remove(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap.LabeledIntMapView

remove(Label) - Method in interface it.univr.di.labeledvalue.LabeledIntMap

Remove the label l from the map.

remove(Label) - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap

remove(Label) - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap

remove(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView

Object Read-only.

remove(Label, ALabel) - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

remove(Literal) - Method in class it.univr.di.labeledvalue.Label

Returns a new label that is a copy of this where literal is removed if it is present.

remove(Object) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

remove(Object) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

remove(Object) - Method in class it.univr.di.cstnu.util.ObjectPair

removeAll(Collection<?>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

removeAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

removeAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectPair

removeChildrenOfUnknown(Label) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Returns a new label removing all children of possibly present unknown literals in l.

removeEdge(E) - Method in class it.univr.di.cstnu.graph.TNGraph

removeEdge(String) - Method in class it.univr.di.cstnu.graph.TNGraph

Removes edge from this graph and clear all cache data structure that could contain the removed edge.

removeEdge(String) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

removeEdge(K) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

removeEmptyEdges() - Method in class it.univr.di.cstnu.graph.TNGraph

Removes all empty edges in the graph.

removeEmptyEdges() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

removeLabeledPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode

Removes the labeled potential associated to label l, if it exists.

removeLabeledUpperPotential(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode

Removes the labeled upper potential associated to label l, if it exists.

removeLabeledValue(Label) - Method in interface it.univr.di.cstnu.graph.CSTNEdge

Remove the value labeled by l from the map.

removeLabeledValue(Label) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable

Remove the value labeled by l from the map.

removeLabeledValuesBelongingToNegativeScenarios() - Method in class it.univr.di.cstnu.algorithms.OSTNU

Removes all labeled values belonging to negative scenarios.

removeLowerCaseValue() - Method in interface it.univr.di.cstnu.graph.CSTNUEdge

removeLowerCaseValue() - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable

removeLowerCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge

removeLowerCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable

removeObserver(String, PropertyChangeListener) - Method in class it.univr.di.cstnu.graph.AbstractComponent

Removes a specific listener

removeUpperCaseValue(Label, ALabel) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge

Remove the upper label for node name n with label l.

removeUpperCaseValue(Label, ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

removeVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph

Removes the given node and all edges having it as endpoint.

removeVertex(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

removeWeakOrdinaryConstraints(ObjectSet<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU

Remove ordinary weak constraints from the network that were added by STNU.addWeakOrdinaryConstraints(ObjectList) The set of weak constraints to remove are given by weakOrdinaryConstraints.

Represents the behavior of a STNU edge. - Search tag in interface it.univr.di.cstnu.graph.STNUEdge

Section

requirement - Enum constant in enum class it.univr.di.cstnu.graph.Edge.ConstraintType

The edge represents a user requirement

reset() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus

Reset all indexes.

reset() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Resets all internal structures but not g.

reset() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Resets all internal structures

reset() - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus

reset() - Method in class it.univr.di.cstnu.algorithms.CSTNU

Resets all internal structures

reset() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus

reset() - Method in class it.univr.di.cstnu.algorithms.OSTNU

Resets all internal structures

reset() - Method in class it.univr.di.cstnu.algorithms.STN

Resets all internal structures

reset() - Method in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Reset all indexes.

reset() - Method in class it.univr.di.cstnu.algorithms.STNU

Resets all internal structures.

reset() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus

Reset all indexes.

reset() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout

It has been erased.

resetDerivedGraphStatus() - Method in class it.univr.di.cstnu.visualization.TNEditor

resetLabeledValue() - Method in interface it.univr.di.cstnu.graph.STNUEdge

Removes the labeled value and make the edges an ordinary constraint.

resetLabeledValue() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt

Removes the labeled value and make the edges an ordinary constraint if it was contingent.

retainAll(Collection<?>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

retainAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

retainAll(Collection<?>) - Method in class it.univr.di.cstnu.util.ObjectPair

reverse() - Method in class it.univr.di.cstnu.graph.TNGraph

Reverse (transpose) the current graph.

reverse() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

reverse() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph

Transpose the predecessor graph

REWEIGH(TNGraph<E>) - Static method in class it.univr.di.cstnu.algorithms.STN

Re-weights all edge weights using potentials of nodes.

rG1G3(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Applies rules rG1 and rG3 of Table 1 in 'Extending CSTN with partially shrinkable uncertainty' (TIME18).

rG2(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Applies rG2 rule.

rG4(LabeledNode, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Applies rG4 rule.

rG5rG6rG7(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Applies rules rG5 and rG6 and rG7 of Table 2 paper submitted to CP20.

rG8(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU

Updates upper bound of a guarded range.

rG9(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU

Updates lower bound of a guarded range.

rM1(LabeledNode, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Implements the CSTNPSU rM1 rule assuming instantaneous reaction and a streamlined network.
This differs from AbstractCSTN.labelModificationR0qR0(LabeledNode, LabeledNode, CSTNEdge) in the checking also upper case value

rM2(LabeledNode, CSTNPSUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNPSU

Implements the CSTNPSU rM2 rule assuming instantaneous reaction and a streamlined network.
This differs from CSTN.labelModificationR3qR3(LabeledNode, LabeledNode, CSTNEdge) in the checking also upper case value.

root - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

Root of hierarchy Design choice: the set of labeled values of this map is organized as a double linked hierarchy of labeled values.

rowForAppButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor

rowForOSTNUButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor

rowForSTNButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor

rowForSTNUButtons - Variable in class it.univr.di.cstnu.visualization.TNEditor

rte(STNURTE.NodeAndExecutionTimeChoice, STNURTE.NodeAndExecutionTimeChoice) - Method in class it.univr.di.cstnu.algorithms.STNURTE

Real-Time Execution (RTE)

RTED(boolean) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE.RTED

RTED(Set<LabeledNode>, int) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE.RTED

rtedStrategy - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState

Strategy used by RTED to choice a time instant.

RTEState() - Constructor for class it.univr.di.cstnu.algorithms.STNURTE.RTEState

Default constructor

RUL2018 - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm

Cairo, Rizzi and Hunsberger RUL^- algorithm

RUL2021 - Enum constant in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm

Luke's version of RUL^- algorithm

ruleAPlus_AparameterPlus(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU

Apply A^+, or A^+-Parameter of paper about Parameter-CSTNU.

ruleBPlus_BparameterPlus(LabeledNode, LabeledNode, LabeledNode, CSTNUEdge, CSTNUEdge, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.PCSTNU

Apply B^+, or B^+-Parameter of paper about Parameter-CSTNU.

RunMeter - Class in it.univr.di.cstnu.util

Simple class for making a meter in the console.

RunMeter(long, long, long) - Constructor for class it.univr.di.cstnu.util.RunMeter

rUpdateBoundsUsingZ(LabeledNode, LabeledNode, LabeledNode, CSTNPSUEdge, CSTNPSUEdge, CSTNPSUEdge) - Static method in class it.univr.di.cstnu.algorithms.CSTNPSU

Applies the propagation rule only on labeled values in the triangle

S

save(TNGraph<? extends Edge>) - Method in class it.univr.di.cstnu.graph.TNGraphMLWriter

Helper method for making GraphMLWriter.save(Hypergraph, Writer) easier.

save(TNGraph<? extends Edge>, File) - Method in class it.univr.di.cstnu.graph.TNGraphMLWriter

Helper method for making GraphMLWriter.save(Hypergraph, Writer) easier.

save(TNGraph<? extends Edge>, Writer) - Method in class it.univr.di.cstnu.graph.TNGraphMLWriter

saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Helper method for making easier the storing of the resulting graph during a check.

saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.STN

Stores the graph after a check into the file STN.fOutput.

saveGraphToFile() - Method in class it.univr.di.cstnu.algorithms.STNU

Stores the graph after a check to the file.

saveGraphToFile(TNGraph<? extends Edge>, File) - Method in class it.univr.di.cstnu.visualization.TNEditor

saveTNResultButton - Variable in class it.univr.di.cstnu.visualization.TNEditor

Result Save Button

SCANNED - Enum constant in enum class it.univr.di.cstnu.graph.LabeledNode.Status

schedule - Variable in class it.univr.di.cstnu.algorithms.STNURTE.RTEState

Schedule.

SEP_CASE - Static variable in interface it.univr.di.cstnu.graph.STNUEdge

Constant SEP_CASE=":"

serialVersionUID - Static variable in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel

serialVersionUID - Static variable in class it.univr.di.cstnu.graph.STNUEdgeInt

serialVersionUID - Static variable in class it.univr.di.cstnu.visualization.CSTNLayout

serialVersionUID - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap

serialVersionUID - Static variable in class it.univr.di.labeledvalue.ALabelAlphabet

set(int, int) - Method in class it.univr.di.cstnu.util.TimeInterval

Updates the bounds.

setAfter(LabeledNode) - Method in class it.univr.di.cstnu.graph.LabeledNode

setALabel(ALabel) - Method in class it.univr.di.cstnu.graph.LabeledNode

Sets the ALabel of the node.

setAllPotential(int) - Method in class it.univr.di.cstnu.graph.TNGraph

Sets the potential of each node to v.

setBefore(LabeledNode) - Method in class it.univr.di.cstnu.graph.LabeledNode

setCheckAlgorithm(STNU.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus

setConstraintType(Edge.ConstraintType) - Method in class it.univr.di.cstnu.graph.AbstractEdge

setConstraintType(Edge.ConstraintType) - Method in interface it.univr.di.cstnu.graph.Edge

setContingent(boolean) - Method in class it.univr.di.cstnu.graph.LabeledNode

setContingentAlsoAsOrdinary(boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNU

Setter for the field contingentAlsoAsOrdinary.

setContingentAlsoAsOrdinary(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU

setControllability(boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus

Set the controllability value!

setControllability(boolean) - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus

Set the controllability value!

setControllability(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus

Sets the controllability value

setCstnEditor(TNEditor) - Method in class it.univr.di.cstnu.visualization.CSTNUGraphAttributeEditingMousePlugin

setCurrentLayout(AbstractLayout<LabeledNode, ? extends Edge>) - Method in class it.univr.di.cstnu.visualization.CSTNLayout

setDefaultConsistencyCheckAlg(STN.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STN

setDefaultControllabilityCheckAlg(STNU.CheckAlgorithm) - Method in class it.univr.di.cstnu.algorithms.STNU

setDefaultParametersForNetwork(TNGraph.NetworkType) - Method in class it.univr.di.cstnu.visualization.TNEditor

Set all default parameter about the editor according to the input type.

setDifference(char[], char[]) - Static method in class it.univr.di.cstnu.util.CSTNRandomGenerator

setEdgeEditingPlugin(EdgeSupplier<E>) - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse

setEdgeFactory(Supplier<E>) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin

setEdgeFactory.

setEdgeFactory(Supplier<E>) - Method in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin

setEdgeSupport(EdgeSupport<V, E>) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin

Setter for the field edgeSupport.

setEditingMode() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse

setEditingMode.

setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.STN

setfOutput(File) - Method in class it.univr.di.cstnu.algorithms.STNU

setG(TNGraph<E>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Considers the given graph as the graph to check (graph will be modified).

setG(TNGraph<STNEdge>) - Method in class it.univr.di.cstnu.algorithms.STN

Considers the given graph as the graph to check (graph will be modified).

setG(TNGraph<STNUEdge>) - Method in class it.univr.di.cstnu.algorithms.STNU

Considers the given graph as the graph to check (graph will be modified).

setInitialX(int) - Method in class it.univr.di.cstnu.visualization.CSTNLayout

setInitialY(int) - Method in class it.univr.di.cstnu.visualization.CSTNLayout

setInNegativeCycle(boolean) - Method in class it.univr.di.cstnu.graph.AbstractComponent

Sets true if the edge is in a negative cycle

setInNegativeCycle(boolean) - Method in interface it.univr.di.cstnu.graph.Component

Sets true if the edge is in a negative cycle

setInputFile(File) - Method in class it.univr.di.cstnu.graph.TNGraph

setInputFile(File) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

setLabel(Label) - Method in class it.univr.di.cstnu.graph.LabeledNode

setLabel(String) - Method in class it.univr.di.cstnu.graph.LabeledNode

setLabeledPotential(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.LabeledNode

If potential is not null, it is used (not copied) as new potential of the node.

setLabeledPotentialCount(Label, int) - Method in class it.univr.di.cstnu.graph.LabeledNode

Put the value with label l into the map.

setLabeledUpperPotential(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.LabeledNode

If potential is not null, it is used (not copied) as new potential of the node.

setLabeledValue(ALabelAlphabet.ALetter, int, boolean) - Method in interface it.univr.di.cstnu.graph.STNUEdge

Sets the labeled weight to w of a Edge.ConstraintType.contingent edge.

setLabeledValue(ALabelAlphabet.ALetter, int, boolean) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt

setLabeledValue(String) - Method in interface it.univr.di.cstnu.graph.STNUEdge

Parse an upper/case labeled value for determining the new value for this.

setLabeledValueMap(LabeledIntMap) - Method in interface it.univr.di.cstnu.graph.CSTNEdge

Uses inputLabeledValue as internal labeled value map.

setLabeledValueMap(LabeledIntMap) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable

setLowerCaseValue(LabeledALabelIntTreeMap) - Method in interface it.univr.di.cstnu.graph.CSTNPSUEdge

setLowerCaseValue(LabeledALabelIntTreeMap) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable

setLowerCaseValue(LabeledLowerCaseValue) - Method in interface it.univr.di.cstnu.graph.CSTNUEdge

setLowerCaseValue(LabeledLowerCaseValue) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable

setLowerCaseValue(Label, ALabel, int) - Method in interface it.univr.di.cstnu.graph.CSTNUEdge

Set a lower label constraint with delay i for the node n with label l.
If a lower label with label l for node n is already present, it is overwritten.

setLowerCaseValue(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable

setLowerCaseValueAsConsidered(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable

Set the triple as already considered in order to avoid to consider it again in the future.

setMode(ModalGraphMouse.Mode) - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse

setter for the Mode.

setName(String) - Method in class it.univr.di.cstnu.graph.AbstractComponent

Sets the name of the component.

setName(String) - Method in class it.univr.di.cstnu.graph.AbstractEdge

Sets the name of the edge.

setName(String) - Method in class it.univr.di.cstnu.graph.AbstractNode

Sets the name of the node.

setName(String) - Method in interface it.univr.di.cstnu.graph.Component

Set the name of the component.

setName(String) - Method in class it.univr.di.cstnu.graph.TNGraph

setName(String) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

setNodeEdgeRenders(BasicVisualizationServer<LabeledNode, E>, boolean) - Static method in class it.univr.di.cstnu.visualization.TNEditor

Sets up vertex and edges renders.

setObservable(char) - Method in class it.univr.di.cstnu.graph.LabeledNode

Set the proposition to be observed.

setOutputCleaned(boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Set to true for having the result graph cleaned of empty edges and of labeled values having unknown literals.

setOutputCleaned(boolean) - Method in class it.univr.di.cstnu.algorithms.STN

Set to true for having the result graph cleaned of empty edges and labeled values having unknown literals.

setOutputCleaned(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU

Sets to true for having the result graph cleaned of empty edges.

setParameter(boolean) - Method in class it.univr.di.cstnu.graph.LabeledNode

setPotential(int) - Method in class it.univr.di.cstnu.graph.LabeledNode

setPredecessor(LabeledNode) - Method in class it.univr.di.cstnu.graph.LabeledNode

Set the predecessor.

setPropagationOnlyToZ(boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Setter for the field propagationOnlyToZ.

setSave(boolean) - Method in class it.univr.di.cstnu.algorithms.STNU

setStatus(LabeledNode.Status) - Method in class it.univr.di.cstnu.graph.LabeledNode

setTransformingMode() - Method in class it.univr.di.cstnu.visualization.EditingModalGraphMouse

setUpperBoundRequested(boolean) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential

setUpperCaseValueAsConsidered(Label, ALabel, int) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

Set the triple as already considered in order to avoid to consider it again in the future.

setUpperCaseValueMap(LabeledALabelIntTreeMap) - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge

setUpperCaseValueMap(LabeledALabelIntTreeMap) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

setValue(int) - Method in class it.univr.di.cstnu.graph.OSTNUEdgePluggable

Allows the use of values without label because it is possible to have a better algorithm in the future that it avoids labeled values.

setValue(int) - Method in interface it.univr.di.cstnu.graph.STNEdge

Sets the weight to w.

setValue(int) - Method in class it.univr.di.cstnu.graph.STNEdgeInt

setValue(int) - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode

setValue(ALabel) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry

setVertexSupport(VertexSupport<V, E>) - Method in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin

Setter for the field vertexSupport.

setWithNodeLabels(boolean) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN

Setter for the field withNodeLabels.

setX(double) - Method in class it.univr.di.cstnu.graph.LabeledNode

setY(double) - Method in class it.univr.di.cstnu.graph.LabeledNode

setZ(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph

Sets z as first node (Zero node) of the temporal constraint network.

setZ(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

setZ(LabeledNode) - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph

shiftButtonDownMask - Static variable in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin

Mask for button

showCommandRow(TNGraph.NetworkType) - Method in class it.univr.di.cstnu.visualization.TNEditor

In the command panel, only one row of commands is visible.

SIMPLE_LABELEDINTMAP_CLASS - Static variable in class it.univr.di.labeledvalue.LabeledIntMapSupplier

singleSinkShortestPaths(AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential

Executes single-sink BellmanFord algorithm propagating from each in nodesToCheck until no new distances are determined.

singleSourceShortestPaths(AbstractCSTN.NodesToCheck, AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential

Executes the single-source BellmanFord algorithm for each node in nodesToCheck.

size() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck

size() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

size() - Method in interface it.univr.di.cstnu.graph.CSTNEdge

size() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable

size() - Method in class it.univr.di.cstnu.util.ActiveWaits

size() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue

It runs in O(1) time.

size() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

size() - Method in class it.univr.di.cstnu.util.ObjectPair

size() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap

size() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel

size() - Method in class it.univr.di.labeledvalue.ALabel

size() - Method in class it.univr.di.labeledvalue.ALabelAlphabet

size() - Method in class it.univr.di.labeledvalue.Label

size() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

size.

size() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

size() - Method in interface it.univr.di.labeledvalue.LabeledIntMap

size() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap

son - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode

Labeled values that subsume this.

SON_PROBABILITY - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator

Default son probability

SON_PROBABILITY - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator

Default son probability

splitterEntryPattern - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap

Pattern for splitting a set of labeled values.

splitterPair - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap

SSSP_BellmanFord(TNGraph<E>, LabeledNode, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN

Determines the minimal distance from the give source node to each other node (single-source-shortest-paths (SSSP)) using the BellmanFord algorithm.
The minimal distance is stored as potential value in each node.

SSSP_BFCT(TNGraph<E>, LabeledNode, int, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN

Determines the minimal distance of each node from the given source (single-source-shortest-paths (SSSP)) using the Bellman-Ford-Tarjan algorithm.
It is the Bellman-Ford augmented by a cycle detection routine called 'Subtree disassembly' written by Tarjan.
If the STN graph is not consistent and the checkStatus parameter is not null, then the negative cycle is stored in the field STN.STNCheckStatus.negativeCycle.
All node are made reachable by Z adding a constraint (Z,horizon,X) for each node X, where horizon is a given parameter.

start - Variable in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

The start position in ObjectArrayFIFOSetQueue.backingArray.

startTime - Variable in class it.univr.di.cstnu.util.RunMeter

stateAsString(char) - Static method in class it.univr.di.labeledvalue.Literal

Std - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics

Standard semantics

stdDevExecutionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Standard Deviation of execution time if this last one is a mean.

stdDevPartialExecutionTimeNS - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

step() - Method in class it.univr.di.cstnu.visualization.CSTNLayout

step() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout

stn - Variable in class it.univr.di.cstnu.visualization.TNEditor

STN checker

STN - Class in it.univr.di.cstnu.algorithms

Represents a Simple Temporal Network (STN) and it contains some methods to manipulate and to check an STN instance.

STN - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType

STN() - Constructor for class it.univr.di.cstnu.algorithms.STN

Default constructor.

STN(TNGraph<STNEdge>) - Constructor for class it.univr.di.cstnu.algorithms.STN

STN(TNGraph<STNEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.STN

STN.CheckAlgorithm - Enum Class in it.univr.di.cstnu.algorithms

Implemented algorithms for STN.

STN.STNCheckStatus - Class in it.univr.di.cstnu.algorithms

Represents the status of a checking algorithm during its execution and the final result of a check.

stnCheckAlg - Variable in class it.univr.di.cstnu.visualization.TNEditor

Which check alg to use for STN

STNCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Default constructor

STNCheckStatus(STNU.STNUCheckStatus) - Constructor for class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Copy constructor used only in benchmarks

STNEdge - Interface in it.univr.di.cstnu.graph

Represents the behavior of an STN edge.

STNEdgeInt - Class in it.univr.di.cstnu.graph

Implementation of STNEdge using integer for weight.

STNEdgeInt() - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt

Default constructor.

STNEdgeInt(Edge) - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt

Creates a new edge cloning e if not null.

STNEdgeInt(String) - Constructor for class it.univr.di.cstnu.graph.STNEdgeInt

stnStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor

STN check status

stnu - Variable in class it.univr.di.cstnu.visualization.TNEditor

STNU checker

STNU - Class in it.univr.di.cstnu.algorithms

Simple class to represent and consistency-check Simple Temporal Network with Uncertainty (STNU), where the edge weight are signed integer.

STNU - Enum constant in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType

STNU() - Constructor for class it.univr.di.cstnu.algorithms.STNU

Default constructor.

STNU(STNU) - Constructor for class it.univr.di.cstnu.algorithms.STNU

Copy constructor, used only for executing benchmarks.

STNU(TNGraph<STNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.STNU

STNU(TNGraph<STNUEdge>, int) - Constructor for class it.univr.di.cstnu.algorithms.STNU

STNU.CheckAlgorithm - Enum Class in it.univr.di.cstnu.algorithms

Possible DC checking algorithm

STNU.STNUCheckStatus - Class in it.univr.di.cstnu.algorithms

Simple class to represent the status of the checking algorithm during an execution.

stnuCheckAlg - Variable in class it.univr.di.cstnu.visualization.TNEditor

Which check alg to use for STNU

stnuCheckAlgComboSelect - Variable in class it.univr.di.cstnu.visualization.TNEditor

Swing combo select for the stnuCheckAlg.

STNUCheckStatus() - Constructor for class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus

Default constructor

STNUCheckStatus(STNU.STNUCheckStatus) - Constructor for class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus

copy constructor only used in benchmarks

STNUDensifier - Class in it.univr.di.cstnu.util

Reads STNU instances and makes them more dense adding up to d (n (n-1)) edges, where n is the number of nodes and d the density.

STNUEdge - Interface in it.univr.di.cstnu.graph

Represents the behavior of a STNU edge.

STNUEdge.CaseLabel - Class in it.univr.di.cstnu.graph

A lower/upper-case label is represented as pair: (node-name, flag), where flag is a boolean that it is true when the label is an upper-case one, false when the label is a lower-case one.

STNUEdgeInt - Class in it.univr.di.cstnu.graph

Implements STNUEdge interface using signed integer values.

STNUEdgeInt() - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt

Constructor for STNUEdgeInt.

STNUEdgeInt(Edge) - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt

STNUEdgeInt(String) - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt

STNUEdgeInt(String, int) - Constructor for class it.univr.di.cstnu.graph.STNUEdgeInt

STNURandomGenerator - Class in it.univr.di.cstnu.util

Allows one to build random STNU instances specifying: number of wanted DC/NOT DC instances And the following parameters that characterize each generated instance: number nodes number of contingent nodes max weight for each edge max weight for each contingent link (upper value) max in-degree for each node max out-degree for each node probability to have an edge between any pair of nodes

STNURandomGenerator(int, int, int, int, double, int, int) - Constructor for class it.univr.di.cstnu.util.STNURandomGenerator

STNURTE - Class in it.univr.di.cstnu.algorithms

A Real-Time Execution (RTE) algorithm is a scheduling algorithm that preserves maximum flexibility while requiring minimal computation.

STNURTE(TNGraph<STNUEdge>) - Constructor for class it.univr.di.cstnu.algorithms.STNURTE

Default constructor.

STNURTE.ContingentLink - Record Class in it.univr.di.cstnu.algorithms

Represents a contingent link

STNURTE.NodeAndExecutionTimeChoice - Interface in it.univr.di.cstnu.algorithms

Strategy for choosing a node and an instant among a set of possible ones.

STNURTE.NodeEnabledInTimeInterval - Record Class in it.univr.di.cstnu.algorithms

Node enabled in the given time window.

STNURTE.NodeOccurrence - Record Class in it.univr.di.cstnu.algorithms

Node occurrence (t, nodes).
t represent an execution time.

STNURTE.NodeWithTimeInterval - Record Class in it.univr.di.cstnu.algorithms

Node with its time window.

STNURTE.RTED - Class in it.univr.di.cstnu.algorithms

RTE Decision.

STNURTE.RTEState - Class in it.univr.di.cstnu.algorithms

Class to represent the data for an execution of STNURTE.rte(NodeAndExecutionTimeChoice, NodeAndExecutionTimeChoice).

STNURTEBenchmarkRunner - Class in it.univr.di.cstnu.util

Simple class to determine the average execution time (and std dev) of the RTE* STNU algorithm on a given set of STNUs.

STNURTEBenchmarkRunner() - Constructor for class it.univr.di.cstnu.util.STNURTEBenchmarkRunner

stnuStatus - Variable in class it.univr.di.cstnu.visualization.TNEditor

STNU check status

stnuSuffix - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner

Suffix of STNU file

STRAIGHT - Static variable in class it.univr.di.labeledvalue.Literal

Constant STRAIGHT=''

StrictlyPositiveIntValueRE - Static variable in class it.univr.di.labeledvalue.Constants

Regular expression for positive and not 0 integer.

subsumes(Label) - Method in class it.univr.di.labeledvalue.Label

A label L₁ subsumes (entails) a label L₂ if L₁ ⊨ L₂.
In other words, L₁ subsumes L₂ if L₁ contains all literals of L₂ when both they have no unknown literals.

subtreeDisassembly(TNGraph<E>, LabeledNode, LabeledNode, int) - Static method in class it.univr.di.cstnu.algorithms.STN

Subtree Disassembly strategy (Tarjan, 1981).

sumWithOverflowCheck(int, int) - Static method in class it.univr.di.labeledvalue.Constants

Determines the sum of a and b.

T

takeFrom(TNGraph<? extends E>) - Method in class it.univr.di.cstnu.graph.TNGraph

Takes from g all its internal structures.

takeFrom(TNGraph<? extends K>) - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

takeIn(AbstractCSTN.EdgesToCheck<E>) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.EdgesToCheck

Copy fields reference of into this.

takeIn(Component) - Method in class it.univr.di.cstnu.graph.AbstractComponent

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.AbstractEdge

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.CSTNPSUEdgePluggable

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.CSTNUEdgePluggable

takeIn(Edge) - Method in interface it.univr.di.cstnu.graph.Edge

A copy by reference of internal structure of edge e.

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.STNEdgeInt

takeIn(Edge) - Method in class it.univr.di.cstnu.graph.STNUEdgeInt

takeIn(Node) - Method in class it.univr.di.cstnu.graph.AbstractNode

takeIn(Node) - Method in interface it.univr.di.cstnu.graph.Node

A copy by reference of internal structure of node e.

timeInterval() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval

Returns the value of the timeInterval record component.

timeInterval() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval

Returns the value of the timeInterval record component.

TimeInterval - Class in it.univr.di.cstnu.util

Represents a time interval where lower bound is guarantee to be ≤ upper bound.

TimeInterval(int) - Constructor for class it.univr.di.cstnu.util.TimeInterval

Fix the lower bound to l, and the upper bound to +∞.

TimeInterval(int, int) - Constructor for class it.univr.di.cstnu.util.TimeInterval

TimeInterval(TimeInterval) - Constructor for class it.univr.di.cstnu.util.TimeInterval

Constructor by copy

timeout - Variable in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

Becomes true if check has been interrupted because a given time-out has occurred.

timeOut - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

Timeout in seconds for the check.

timeOut - Variable in class it.univr.di.cstnu.algorithms.STN

Timeout in seconds for the check.

TNEditor - Class in it.univr.di.cstnu.visualization

A simple graphical application for creating/loading/modifying/saving/checking CSTNs.

TNEditor() - Constructor for class it.univr.di.cstnu.visualization.TNEditor

Initializes the fundamental fields.

tnGraph - Variable in class it.univr.di.cstnu.visualization.ObservableValidator

TNGraph<E> - Class in it.univr.di.cstnu.graph

Represents (dense) temporal network graphs where nodes are LabeledNode and edges are (an extension of) Edge.

TNGraph(TNGraph<E>, Class<E1>) - Constructor for class it.univr.di.cstnu.graph.TNGraph

A constructor that copy a given graph g using copy constructor for internal structures.
If g is null, this new graph will be empty.

TNGraph(String, Class<E1>) - Constructor for class it.univr.di.cstnu.graph.TNGraph

Constructor for TNGraph.

TNGraph(String, Class<E1>, ALabelAlphabet) - Constructor for class it.univr.di.cstnu.graph.TNGraph

Constructor for TNGraph.

TNGraph.NetworkType - Enum Class in it.univr.di.cstnu.graph

Types of network that can be represented by this class.

TNGraph.UnmodifiableTNGraph<K> - Class in it.univr.di.cstnu.graph

Unmodifiable version of this graph.

TNGraphMLReader<E> - Class in it.univr.di.cstnu.graph

Allows the reading of a Temporal Network (TM) graph from a file or a string in GraphML format.

TNGraphMLReader() - Constructor for class it.univr.di.cstnu.graph.TNGraphMLReader

A TNGraphMLReader object can be now used many times for reading different graphs.

TNGraphMLWriter - Class in it.univr.di.cstnu.graph

Allows the writing of a Temporal Network graph to a file or a string in GraphML format.

TNGraphMLWriter(AbstractLayout<LabeledNode, ? extends Edge>) - Constructor for class it.univr.di.cstnu.graph.TNGraphMLWriter

Constructor for TNGraphMLWriter.

TNPredecessorGraph<E> - Class in it.univr.di.cstnu.graph

Optimized representation of immutable predecessor graphs.

TNPredecessorGraph() - Constructor for class it.univr.di.cstnu.graph.TNPredecessorGraph

Default constructor

toArray() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

toArray() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

toArray() - Method in class it.univr.di.cstnu.util.ObjectPair

toArray(S[]) - Method in class it.univr.di.cstnu.util.ObjectPair

toArray(T[]) - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

toArray(T[]) - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

toChars(int, char) - Static method in class it.univr.di.labeledvalue.Literal

toLogicalExpr(boolean, String, String, String) - Method in class it.univr.di.labeledvalue.Label

Return a string representing the label as logical expression using logical 'not', 'and', and 'or'.

toLowerCase() - Method in class it.univr.di.labeledvalue.ALabel

toString() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.CSTNCheckStatus

toString() - Method in class it.univr.di.cstnu.algorithms.AbstractCSTN.NodesToCheck

toString() - Method in class it.univr.di.cstnu.algorithms.CSTNPSU.PrototypalLink

toString() - Method in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus

toString() - Method in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus

toString() - Method in class it.univr.di.cstnu.algorithms.STN.STNCheckStatus

toString() - Method in class it.univr.di.cstnu.algorithms.STNU.STNUCheckStatus

toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink

Returns a string representation of this record class.

toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeEnabledInTimeInterval

Returns a string representation of this record class.

toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeOccurrence

Returns a string representation of this record class.

toString() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.NodeWithTimeInterval

Returns a string representation of this record class.

toString() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTED

toString() - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState

toString() - Method in class it.univr.di.cstnu.graph.AbstractComponent

Return a string representation of labeled values.

toString() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable.InternalEntry

toString() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

Return a string representation of labeled values.h

toString() - Method in interface it.univr.di.cstnu.graph.Component

Return a string representation of labeled values.

toString() - Method in class it.univr.di.cstnu.graph.CSTNEdgePluggable

toString() - Method in class it.univr.di.cstnu.graph.EdgeSupplier

toString() - Method in class it.univr.di.cstnu.graph.LabeledNode

toString() - Method in class it.univr.di.cstnu.graph.STNEdgeInt

toString() - Method in class it.univr.di.cstnu.graph.STNUEdge.CaseLabel

toString() - Method in class it.univr.di.cstnu.graph.STNUEdgeInt

toString() - Method in class it.univr.di.cstnu.graph.TNGraph

toString() - Method in class it.univr.di.cstnu.graph.TNPredecessorGraph

A simple string representation.

toString() - Method in class it.univr.di.cstnu.util.ActiveWaits

toString() - Method in class it.univr.di.cstnu.util.ExtendedPriorityQueue

toString() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

toString() - Method in class it.univr.di.cstnu.util.ObjectPair

toString() - Method in class it.univr.di.cstnu.util.TimeInterval

toString() - Method in class it.univr.di.cstnu.visualization.CSTNLayout

toString() - Method in class it.univr.di.cstnu.visualization.CSTNUStaticLayout

toString() - Method in class it.univr.di.labeledvalue.AbstractLabeledIntMap

toString() - Method in class it.univr.di.labeledvalue.ALabel.EmptyLabel

toString() - Method in enum class it.univr.di.labeledvalue.ALabel.State

toString() - Method in class it.univr.di.labeledvalue.ALabel

toString() - Method in class it.univr.di.labeledvalue.ALabelAlphabet.ALetter

toString() - Method in class it.univr.di.labeledvalue.ALabelAlphabet

toString() - Method in class it.univr.di.labeledvalue.Label

toString() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

Returns a string representing the content of the map, i.e., "{[⟨entry⟩ ]*}", where each ⟨entry⟩ is written by LabeledALabelIntTreeMap.entryAsString(Label, int, ALabel).

toString() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode

toString() - Method in class it.univr.di.labeledvalue.LabeledIntMapSupplier

toString() - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue

toString() - Method in class it.univr.di.labeledvalue.Literal

toString(boolean) - Method in class it.univr.di.labeledvalue.LabeledLowerCaseValue

total - Variable in class it.univr.di.cstnu.util.RunMeter

toUpperCase() - Method in class it.univr.di.labeledvalue.ALabel

transform() - Method in class it.univr.di.cstnu.algorithms.CSTN2CSTN0

Returns the corresponding CSTN having each observation node P? is replaced with a pair of nodes P? and P?0.

transform() - Method in class it.univr.di.cstnu.algorithms.CSTNU2CSTN

Returns the corresponding CSTN of the given CSTNU g.

translate() - Method in class it.univr.di.cstnu.util.CSTNU2UppaalTiga

Convert a CSTNU TNGraph g into a Timed Game Automata in the UPPAAL TIGA format.

transpose() - Method in class it.univr.di.cstnu.graph.TNGraph

Transposes this inverting only the source/destination of each edge.

transpose() - Method in class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Unsupported.

trim() - Method in class it.univr.di.cstnu.util.ObjectArrayFIFOSetQueue

Trims the queue to the smallest possible size.

U

UC_LABEL - Static variable in interface it.univr.di.cstnu.graph.STNUEdge

Constant UC_LABEL="UC"

UNKNOWN - Static variable in class it.univr.di.labeledvalue.Constants

Char representing logic not know symbol: ¿.

UNKNOWN - Static variable in class it.univr.di.labeledvalue.Literal

Constant UNKNOWN=Constants.UNKNOWN

UNKNOWNstring - Static variable in class it.univr.di.labeledvalue.Constants

unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledALabelIntTreeMap

unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

unmodifiable() - Method in interface it.univr.di.labeledvalue.LabeledIntMap

unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap

unmodifiable() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap

unmodifiable(TNGraph<K>) - Static method in class it.univr.di.cstnu.graph.TNGraph

Returns an unmodifiable TNGraph backed by the given TNGraph.

UnmodifiableTNGraph(TNGraph<K>) - Constructor for class it.univr.di.cstnu.graph.TNGraph.UnmodifiableTNGraph

Default constructor

UNREACHED - Enum constant in enum class it.univr.di.cstnu.graph.LabeledNode.Status

updateCount - Variable in class it.univr.di.labeledvalue.LabeledIntSimpleMap

Counter of labeled value updates.

updateLowerBound(LabeledNode, int) - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState

Updates the lower bound of the time window of the given node to lower value.

updateNodePositions() - Method in class it.univr.di.cstnu.visualization.TNEditor

Update node positions in derived graph.

updatePotentialCount(LabeledNode, Label, boolean) - Static method in class it.univr.di.cstnu.algorithms.CSTNPotential

Updates the count associated to the pair (node, label) adding 1 unless reset is true.

updateUpperBound(LabeledNode, int) - Method in class it.univr.di.cstnu.algorithms.STNURTE.RTEState

Updates the upper bound of the time window of the given node to upper.
If the node is already executed, it checks that the execution time is ≤ the given upper as sanity check.

updateValue(int) - Method in interface it.univr.di.cstnu.graph.STNEdge

Sets the ordinary value if v is smaller than the current one.

updateValue(int) - Method in class it.univr.di.cstnu.graph.STNEdgeInt

Sets the ordinary value if v is smaller than the current one.

updateValue(int) - Method in interface it.univr.di.cstnu.graph.STNUEdge

If the edge is not a wait, it sets the ordinary value if v is smaller than the current one.

updatevvViewer() - Method in class it.univr.di.cstnu.visualization.TNEditor

Update the vvViewer after a check making some common operations.

updateWait(int, ALabelAlphabet.ALetter) - Method in interface it.univr.di.cstnu.graph.STNUEdge

If the edge is a wait, it sets the wait value if v is smaller than the current wait value.

upperBound() - Method in record class it.univr.di.cstnu.algorithms.STNURTE.ContingentLink

Returns the value of the upperBound record component.

upperCaseRuleCalls - Variable in class it.univr.di.cstnu.algorithms.OSTNU.OSTNUCheckStatus

Counters about the # of application of different rules.

upperCaseValue - Variable in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

Morris Upper case value augmented by a propositional label.

upperCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.CSTNU

upperCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.algorithms.OSTNU

upperCaseValueAsString(ALabel, int, Label) - Static method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

upperCaseValuesAsString() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge

upperCaseValuesAsString() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

upperCaseValueSize() - Method in interface it.univr.di.cstnu.graph.BasicCSTNUEdge

upperCaseValueSize() - Method in class it.univr.di.cstnu.graph.BasicCSTNUEdgePluggable

upperPotentialR3(AbstractCSTN.NodesToCheck, AbstractCSTN.NodesToCheck, Instant) - Method in class it.univr.di.cstnu.algorithms.CSTNPotential

Apply R3 to the upper potential of each node in nodesToCheck.

userWantsToStayWithCurrentNetworkInEditor() - Method in class it.univr.di.cstnu.visualization.TNEditor

Shows a ConfirmDialog to ask user if he wants to stay or not with the current input network.

V

validate(Problems, String, String) - Method in class it.univr.di.cstnu.visualization.ObservableValidator

validationPanelCSTN - Variable in class it.univr.di.cstnu.visualization.TNEditor

Validation panel for CSTN row

validationPanelCSTNPSU - Variable in class it.univr.di.cstnu.visualization.TNEditor

Validation panel for CSTNPSU row

validationPanelCSTNU - Variable in class it.univr.di.cstnu.visualization.TNEditor

Validation panel for CSTNU row

value - Variable in class it.univr.di.cstnu.graph.STNEdgeInt

the value associated to the edge

value - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode

valueOf(char) - Static method in class it.univr.di.labeledvalue.Literal

Returns the positive literal of v.

valueOf(char, char) - Static method in class it.univr.di.labeledvalue.Label

valueOf(char, char) - Static method in class it.univr.di.labeledvalue.Literal

Return the literal having the given state of v.

valueOf(Literal, char) - Static method in class it.univr.di.labeledvalue.Literal

Returns a new literal having same proposition of v but with state given by state.

valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.graph.Edge.ConstraintType

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.graph.LabeledNode.Status

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.cstnu.visualization.NodeRendering

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.Debug

Returns the enum constant of this class with the specified name.

valueOf(String) - Static method in enum class it.univr.di.labeledvalue.ALabel.State

Returns the enum constant of this class with the specified name.

valueRE - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap

Admissible values as regular expression.

valueREPattern - Static variable in class it.univr.di.labeledvalue.AbstractLabeledIntMap

Pattern of valueREString

values() - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.CheckAlgorithm

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.algorithms.STNU.CheckAlgorithm

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.algorithms.WellDefinitionException.Type

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.graph.Edge.ConstraintType

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.graph.LabeledNode.Status

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.graph.TNGraph.NetworkType

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.visualization.EdgeRendering

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.cstnu.visualization.NodeRendering

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.Debug

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Static method in enum class it.univr.di.labeledvalue.ALabel.State

Returns an array containing the constants of this enum class, in the order they are declared.

values() - Method in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

values() - Method in interface it.univr.di.labeledvalue.LabeledIntMap

values() - Method in class it.univr.di.labeledvalue.LabeledIntSimpleMap

values() - Method in class it.univr.di.labeledvalue.LabeledIntTreeMap

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTN

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTN2CSTN0

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon3R

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilon3RwoNodeLabels

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNEpsilonwoNodeLabels

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIR

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIR3R

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIR3RwoNodeLabels

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNIRwoNodeLabels

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNPotential

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNPSU

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNU

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNU2CSTN

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.CSTNwoNodeLabel

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.OSTNU

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.PCSTNU

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.STN

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.STNU

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.algorithms.STNURTE

Version of the class.

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.Checker

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.CSTNU2CSTNPSU

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.CSTNU2UppaalTiga

Gives the version of the file

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.DispatchabilityBenchmarkRunner

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.GraphML2Luke

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.Luke2GraphML

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.STNUDensifier

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator

Version of the class

VERSIONandDATE - Static variable in class it.univr.di.cstnu.util.STNURTEBenchmarkRunner

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.visualization.CSTNLayout

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.visualization.CSTNUStaticLayout

Version

VERSIONandDATE - Static variable in class it.univr.di.cstnu.visualization.ObservableValidator

Version

versionReq - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

Software Version.

versionReq - Variable in class it.univr.di.cstnu.algorithms.STN

Software Version.

vertexFactory - Variable in class it.univr.di.cstnu.visualization.EditingModalGraphMouse

vertexFactory - Variable in class it.univr.di.cstnu.visualization.EditingPopupGraphMousePlugin

vertexLabelFunction - Static variable in enum class it.univr.di.cstnu.visualization.NodeRendering

Used to show the node name.

vertexSupport - Variable in class it.univr.di.cstnu.visualization.EditingGraphMousePlugin

Helper for creating a node

vertexToolTipFunction - Static variable in enum class it.univr.di.cstnu.visualization.NodeRendering

Transformer object to show the tooltip of node: the label is print.

viewerMessageArea - Variable in class it.univr.di.cstnu.visualization.TNEditor

Message area above the derived (no input) graph.

visit - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap.HierarchyNode

To manage visit

vvEditor - Variable in class it.univr.di.cstnu.visualization.TNEditor

The BasicVisualizationServer<V,E> for input graph.

vvViewer - Variable in class it.univr.di.cstnu.visualization.TNEditor

The BasicVisualizationServer<V,E> for derived graph.

W

WARN_ICON_FILE - Static variable in class it.univr.di.cstnu.visualization.TNEditor

wasPresent - Enum constant in enum class it.univr.di.cstnu.util.ExtendedPriorityQueue.Status

the element has been added and removed from this queue.

WEIGHT - Static variable in class it.univr.di.cstnu.util.STNUDensifier

Weight for a redundant edge.

WEIGHT_MODIFICATION_FACTOR - Static variable in class it.univr.di.cstnu.util.CSTNRandomGenerator

Default factor for modifying an edge

WEIGHT_MODIFICATION_FACTOR - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator

Default factor for modifying an edge

WEIGHT_MODIFICATION_FACTOR - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator

Default factor for modifying an edge

WellDefinitionException - Exception Class in it.univr.di.cstnu.algorithms

Some common types of unsatisfied property for well-defined CSTN.

WellDefinitionException() - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException

WellDefinitionException(String) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException

WellDefinitionException(String, WellDefinitionException.Type) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException

WellDefinitionException(String, Throwable) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException

WellDefinitionException(String, Throwable, boolean, boolean) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException

WellDefinitionException(Throwable) - Constructor for exception class it.univr.di.cstnu.algorithms.WellDefinitionException

WellDefinitionException.Type - Enum Class in it.univr.di.cstnu.algorithms

Kinds of possible errors in checking well-definition property.

wellFormatCheck - Variable in class it.univr.di.labeledvalue.LabeledIntHierarchyMap

Just to force the control that, after each put, the format of hierarchy is still valid.

withNodeLabels - Variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

If false, node labels are ignored during the check.

X

X_SHIFT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator

Default x shift for node position

X_SHIFT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator

Default x shift for node position

Y

Y_SHIFT - Static variable in class it.univr.di.cstnu.util.OSTNURandomGenerator

Default y shift for node position

Y_SHIFT - Static variable in class it.univr.di.cstnu.util.STNURandomGenerator

Default y shift for node position

Yen - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm

Yen

yenAlgorithm(TNGraph<E>, boolean, boolean, int, STN.STNCheckStatus) - Static method in class it.univr.di.cstnu.algorithms.STN

Algorithm 4: Yen's algorithm (adaptive version with early termination)

YenSingleSink - Enum constant in enum class it.univr.di.cstnu.algorithms.STN.CheckAlgorithm

Yen

Z

ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.AbstractCSTN

The name for the initial node.

ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.STN

The name for the initial node.

ZERO_NODE_NAME - Static variable in class it.univr.di.cstnu.algorithms.STNU

The name for the initial node.

zExclamationRuleCalls - Variable in class it.univr.di.cstnu.algorithms.CSTNU.CSTNUCheckStatus

Counters about the # of application of different rules.

zLabeledLetterRemovalRule(LabeledNode, CSTNUEdge) - Method in class it.univr.di.cstnu.algorithms.CSTNU

Labeled LetterRemoval (zLr) and (zLr*)

Ε

ε - Enum constant in enum class it.univr.di.cstnu.algorithms.AbstractCSTN.DCSemantics

ε-reaction semantics

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Ε
All Classes and Interfaces|All Packages|Constant Field Values|Serialized Form