All Classes and Interfaces

Class	Description
AbstractComponent	Abstract component as base class for nodes and edges.
AbstractCSTN<E>	Core class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
AbstractCSTN.CheckAlgorithm	Only for stating which kind of DC checking algorithms have been implemented so far.
AbstractCSTN.CSTNCheckStatus	Represents the status of a CSTN-checking algorithm during an execution.
AbstractCSTN.DCSemantics	Value for dcSemantics
AbstractCSTN.EdgesToCheck<E>	Simple class to maintain the set of edges to check in the following phase.
AbstractCSTN.NodesToCheck	Acts as a queue and a set.
AbstractEdge	Base class for implementing LabeledIntEdge.
AbstractLabeledIntMap	Abstract class for LabeledIntMap interface.
AbstractNode	Base class for implementing Node.
ActiveWaits	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.
ALabel	Simple class to represent a A-label in the CSTNU framework.
ALabel.EmptyLabel	An unmodifiable empty label.
ALabel.State	Possible state of a ALabelAlphabet.ALetter in an alphabetic label.
ALabelAlphabet	A customizable alphabet, where elements are strings.
ALabelAlphabet.ALetter	ALetter makes simpler to check if a node name is appropriate.
BasicCSTNUEdge	Represents the common behavior of an edge that can have upper-case value(s) and a lower-Case one.
BasicCSTNUEdgePluggable	An abstract implementation of BasicCSTNUEdge where the type to represent labeled value set can be plugged during the creation.
BasicCSTNUEdgePluggable.InternalEntry	Represents a pair (Label, String).
Checker	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.GlobalStatisticKey	Utility internal class to store #contingent, #nodes, and #propositions and allows the ordering among objects of this class.
Component	Component interface.
Constants	Some useful constants for the package.
CSTN	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.
CSTN2CSTN0	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.
CSTNEdge	Represents the behavior of a CSTN edge.
CSTNEdgePluggable	An implementation of CSTNEdge where the kind of labeled value map can be configured at initialization (new) time.
CSTNEpsilon	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilon3R	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilon3RwoNodeLabels	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNEpsilonwoNodeLabels	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIR	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIR3R	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIR3RwoNodeLabels	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNIRwoNodeLabels	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
CSTNLayout	Allows the layout of a CSTN(U) determined by transforming a workflow generated by Atapis Random generator tool.
CSTNPotential	Represents a Conditional Simple Temporal Network (CSTN) and it contains a method to check the dynamic consistency of the instance.
CSTNPSU	Represents and checks streamlined Conditional Simple Temporal Network with Partial Shrinkable Uncertainty (CSTNPSU).
CSTNPSU.PrototypalLink	Represents a prototypal link.
CSTNPSUEdge	Represents the behavior of a CSTNPSU edge.
CSTNPSUEdgePluggable	An implementation of CSTNPSUEdge.
CSTNRandomGenerator	Allows one to build random CSTN instances specifying:
CSTNU	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.CSTNUCheckStatus	Simple class to represent the status of the checking algorithm during an execution. controllability = super.consistency.
CSTNU2CSTN	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().
CSTNU2CSTNPSU	Reads CSTNU instances and converts them into CSTNPSU (==FTNU) instances transforming each contingent link into a guarded one.
CSTNU2UppaalTiga	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.
CSTNUEdge	Represents the behavior of a CSTNU edge.
CSTNUEdgePluggable	An implementation of CSTNUEdge where the type to represent labeled value set can be plugged during the creation.
CSTNUGraphAttributeEditingMousePlugin<V,E>	Allows to edit vertex or edge attributes.
CSTNUStaticLayout<E>	Extends CSTNUStaticLayout retrieving initial node positions from node attributes.
CSTNwoNodeLabel	Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.
Debug	Contains the static final boolean for enable/disable debug logging in all it.univr.di subpackages.
DispatchabilityBenchmarkRunner	Simple class to determine the average execution time (and std dev) of the STN(U) dispatchability algorithms on a given set of STNUs.
Edge	Root class for representing edges in it.univr.di.cstnu package.
Edge.ConstraintType	Possible types of an edge.
EdgeRendering	Edge rendering.
EdgeSupplier<E>	This supplier requires as E a class that implements Edge interface and that contains the following 3 constructors: E(Class<?
EditingGraphMousePlugin<V,E>	A plugin that can create vertices, undirected edges, and directed edges using mouse gestures. vertexSupport and edgeSupport member classes are responsible for actually creating the new graph elements, and for repainting the view when changes were made.
EditingModalGraphMouse<V,E>	I modified the source to use a local EditingGraphMousePlugin and to remove some extra useless features.
EditingModalGraphMouse.ModeKeyAdapter	Personalization of key adapter.
EditingPopupGraphMousePlugin<V,E>	2017-10-23 I added a menu item to manage the export of a graph.
ExtendedPriorityQueue<T>	Simple implementation priority queue where elements are T objects and priorities are integers.
ExtendedPriorityQueue.Status	The possible state of an element with respect to a ExtendedPriorityQueue.
FTNU	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.
GraphML2Luke	Utility class for converting STNU file in GraphML format to Luke format.
Label	Represents an immutable propositional label in the CSTN/CSTNU framework.
LabeledALabelIntTreeMap	Allows to manage conjoin-upper-case values that are also associated to propositional labels. Labeled values are grouped by alphabetic labels ALabel.
LabeledALabelIntTreeMap.LabeledALabelIntTreeMapView	A read-only view of a LabeledALabelIntTreeMap object.
LabeledIntHierarchyMap	Simple implementation of LabeledIntMap interface.
LabeledIntHierarchyMap.HierarchyNode	Simple class to represent a labeled value in the hierarchy.
LabeledIntHierarchyMap.LabeledIntHierarchyMapView	A read-only view of an object
LabeledIntMap	Realizes the map Label-->int
LabeledIntMap.LabeledIntMapView	A read-only view of an object
LabeledIntMapSupplier<C>	Basic factory of LabeledIntMap objects.
LabeledIntSimpleMap	Deprecated.
LabeledIntSimpleMap.LabeledIntNotMinMapView	Deprecated.
LabeledIntTreeMap	Simple implementation of LabeledIntMap interface.
LabeledIntTreeMap.LabeledIntTreeMapView	A read-only view of an object
LabeledIntTreeSimpleMap	Extends LabeledIntTreeMap setting optimize field to false. In this way, labeled values where labels not shorten. This class is useful for OSTNUPluggableEdge class.
LabeledLowerCaseValue	Represents an immutable Labeled Lower Case value.
LabeledNode	LabeledNode class.
LabeledNode.Status	Possible status of a node during execution of some visiting algorithms.
LabeledNodeSupplier	LabeledIntEdgePluggable supplier.
Literal	An immutable literal.
LogNormalDistributionParameter	Log-normal distribution.
Luke2GraphML	Utility class for converting (C)STN(U) file in Luke format to GraphML format.
Node	Root class for representing nodes in it.univr.di.cstnu package.
NodeRendering	Provides method for LabeledNode rendering in TNEditor GUI application.
ObjectArrayFIFOSetQueue<K>	A type-specific array-based FIFO queue, supporting also dequeue operations.
ObjectPair<T>	An implementation of Collection interface that stores exactly 2 objects and is immutable.
ObservableValidator	Validator for observable.
OptimizationEngine	Represent a minimal interface to an optimization engine that can solve non-linear optimization problems.
OptimizationEngine.OptimizationResult	Records the result of a call to the OptimizationEngine.nonLinearOptimization(double[], double[][], double[], double[], double[]) method.
OSTNU	Represents a Simple Temporal Network with Uncertainty and Oracles (OSTNU).
OSTNU.OSTNUCheckStatus	Simple class to represent the status of the checking algorithm during an execution. controllability = super.consistency.
OSTNUEdgePluggable	An implementation of OSTNUEdge where the labeled value set is not optimized for maintain scenarios like ¬c,0 and c,1.
OSTNURandomGenerator	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
PCSTNU	Simple class that extends CSTNU for representing and managing also 'parameter nodes'.
PSTN	Simple class to represent a Probabilistic Simple Temporal Constraint Networks (PSTN), where the edge weight are signed integer.
PSTN.PSTNCheckStatus	Extends STNCheckStatus to represent result of the approximating STNU.
PSTNRTEBenchmarkRunner	Simple class to determine some statistics about the execution of PSTNs
PSTNRTEBenchmarkRunner.ExitExecution	The possible exit of an RTE
PSTNRTEBenchmarkRunner.PSTNSituation	Maintains the map (contingent node, chosen duration of its contingent link), the number of chosen duration outside the bounds of the relative contingent link, and the conjunct probability mass of the contingent ranges w.r.t. the probability distribution functions of the contingent durations.
RunMeter	Simple class for making a meter in the console.
SRNCFinderBenchmarkRunner	Determines the average execution time and some statistics of the STNU SRNCycleFinder on a given set of STNUs.
STN	Represents a Simple Temporal Network (STN) and it contains some methods to manipulate and to check an STN instance.
STN.CheckAlgorithm	Implemented algorithms for STN.
STN.EdgeValue	Functional interface to retrieve the edge value of interest. It is made available for generalizing some static method that could be used on derived classes like STNU.
STN.STNCheckStatus	Represents the status of a checking algorithm during its execution and the final result of a check.
STNEdge	Represents the behavior of an STN edge.
STNEdgeInt	Implementation of STNEdge using integer for weight.
STNU	Simple class to represent and consistency-check Simple Temporal Network with Uncertainty (STNU), where the edge weight are signed integer.
STNU.CheckAlgorithm	Possible DC checking algorithm
STNU.STNUCheckStatus	Simple class to represent the status of the checking algorithm during an execution.
STNU.STNUCheckStatus.SRNCEdges	Indicates which kind of edges determine a Semi Reducible Negative Cycle (SRNC)
STNU.STNUCheckStatus.SRNCInfo	Represents some statistics about a Semi Reducible Negative Cycle (SRNC)
STNU.STNUCheckStatus.SRNCKind	Kinds of negative cycles
STNUDensifier	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	Represents the behavior of a STNU edge.
STNUEdge.CaseLabel	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	Implements STNUEdge interface using signed integer values.
STNURandomGenerator	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
STNURTE	A Real-Time Execution (RTE) algorithm is a scheduling algorithm that preserves maximum flexibility while requiring minimal computation.
STNURTE.ContingentLink	Represents a contingent link
STNURTE.NodeAndExecutionTimeChoice	Strategy for choosing a node and an instant among a set of possible ones.
STNURTE.NodeEnabledInTimeInterval	Node enabled in the given time window.
STNURTE.NodeOccurrence	Node occurrence (t, nodes). t represent an execution time.
STNURTE.NodeWithTimeInterval	Node with its time window.
STNURTE.RTED	RTE Decision.
STNURTE.RTEState	Class to represent the data for an execution of STNURTE.rte(Strategy, Strategy).
STNURTE.Strategy	This interface allows the use of an enum of predefined strategies and the possibility of defining new ones. Enum of predefined strategies allows the specification of a strategy as input parameter.
STNURTE.StrategyEnum	Allows the specification of a predefined strategy as an input parameter.
STNURTEBenchmarkRunner	Simple class to determine the average execution time (and std dev) of the RTE* STNU algorithm on a given set of STNUs.
TimeInterval	Represents a time interval where lower bound is guarantee to be ≤ upper bound.
TNEditor	A simple graphical application for creating/loading/modifying/saving/checking CSTNs.
TNGraph<E>	Represents (dense) temporal network graphs where nodes are LabeledNode and edges are (an extension of) Edge.
TNGraph.NetworkType	Types of network that can be represented by this class.
TNGraph.UnmodifiableTNGraph<K>	Unmodifiable version of this graph.
TNGraphMLReader<E>	Allows the reading of a Temporal Network (TM) graph from a file or a string in GraphML format.
TNGraphMLWriter	Allows the writing of a Temporal Network graph to a file or a string in GraphML format.
TNPredecessorGraph<E>	Optimized representation of immutable predecessor graphs.
WellDefinitionException	Some common types of unsatisfied property for well-defined CSTN.
WellDefinitionException.Type	Kinds of possible errors in checking well-definition property.