All Classes and Interfaces
Class
Description
Abstract component as a base class for nodes and edges.
Core class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Only for stating which kind of DC checking algorithms have been implemented so far.
Represents the status of a CSTN-checking algorithm during an execution.
Value for dcSemantics
A simple class to maintain the set of edges to check in the following phase.
Acts as a queue and a set.
Base class for implementing LabeledIntEdge.
Abstract class for
LabeledIntMap interface.Base class for implementing Node.
Active wait for a timepoint.
Simple class to represent a ALabel in the CSTNU framework.
An unmodifiable empty label.
Possible state of a
ALabelAlphabet.ALetter in an alphabetic label.A customizable alphabet, where elements are strings.
ALetter makes it simpler to check if a node name is appropriate.
Represents the common behavior of an edge that can have upper-case value(s) and a lower-case one.
An abstract implementation of BasicCSTNUEdge where the type to represent the labeled value set can be plugged during the creation.
Represents a pair (Label, String).
Simple class to determine the average execution time (and standard dev) of the (C)STN(U) DC checking algorithm on a given set of (C)STN(U)s.
Utility internal class to store #contingent, #nodes, and #propositions and allows the ordering among objects of this class.
Component interface.
Some useful constants for the package.
Represents a Conditional Simple Temporal Network (CSTN), and it contains a method to check the dynamic consistency of the instance.
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.
Represents the behavior of a CSTN edge.
An implementation of CSTNEdge where the kind of labeled value map can be configured at initialization (new) time.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Simple class to represent and check Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Allows the layout of a CSTN(U) determined by transforming a workflow generated by the 'Atapis Random generator tool'.
Represents a Conditional Simple Temporal Network (CSTN), and it contains a method to check the dynamic consistency of the instance.
Represents and checks streamlined Conditional Simple Temporal Network with Partial Shrinkable Uncertainty (CSTNPSU).
Represents a prototypal link.
Represents the behavior of a CSTNPSU edge.
An implementation of CSTNPSUEdge.
Allows one to build random CSTN instances specifying:
Represents a Conditional Simple Temporal Network with Uncertainty (CSTNU).
A simple class to represent the status of the checking algorithm during an execution.
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.
Reads CSTNU instances and converts them into CSTNPSU (==FTNU) instances, transforming each contingent link into a guarded one.
Actor class that transforms a CSTNU instance into a UppaalTiga Time Game Automate schema.
Represents the behavior of a CSTNU edge.
An implementation of CSTNUEdge where the type to represent a labeled value set can be plugged during the creation.
Allows editing of vertex or edge attributes.
Extends CSTNUStaticLayout, retrieving initial node positions from node attributes.
A simple class is used to represent and check a Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
Contains the static final boolean for enabling/disabling debug logging in all it.univr.di subpackages.
Simple class to determine the average execution time (and standard dev) of the STN(U) dispatchability algorithms on a given set of STNUs.
Root class for representing edges in the 'it.univr.di.cstnu package'.
Possible types of an edge.
Edge rendering.
This supplier requires as E a class that implements
Edge interface and that
contains the following three constructors:
E(Class<?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 are made.
I modified the source to use a local EditingGraphMousePlugin and remove some extra useless features.
Personalization of the key adapter.
2017-10-23 I added a menu item to manage the export of a graph.
Simple implementation priority queue where elements are T objects and priorities are integers.
The possible state of an element with respect to a
ExtendedPriorityQueue.The FTNU model was introduced as an evolution of the CSTNPSU one, having a simpler name and a DC checking algorithm able to determine the guarded bounds correctly.
Utility class containing some graph algorithm implementations.
This interface defines the methods for managing distances between nodes in a graph.
Implementation based on two nested hash maps.
Utility class for converting STNU file in GraphML format to Luke format.
Represents an immutable propositional label in the CSTN/CSTNU framework.
Allows managing conjoined upper-case values that are also associated with propositional labels.
A read-only view of a LabeledALabelIntTreeMap object.
Simple implementation of
LabeledIntMap interface.Simple class to represent a labeled value in the hierarchy.
A read-only view of an object
Realizes the map
Label-->intA read-only view of an object
Basic factory of LabeledIntMap objects.
Deprecated.
Deprecated.
Simple implementation of
LabeledIntMap interface.A read-only view of an object
Extends LabeledIntTreeMap, setting optimize field to false.
In this way, labeled values where labels are not shortened.
This class is useful for the OSTNUPluggableEdge class.
In this way, labeled values where labels are not shortened.
This class is useful for the OSTNUPluggableEdge class.
Represents an immutable Labeled Lower Case value.
LabeledNode class.
Possible status of a node during the execution of some visiting algorithms.
LabeledIntEdgePluggable supplier.
An immutable literal.
Log-normal distribution.
Utility class for converting a (C)STN(U) file in Luke format to GraphML format.
Root class for representing nodes in it.univr.di.cstnu package.
Provides a method for LabeledNode rendering in the TNEditor GUI application.
A type-specific array-based FIFO queue, supporting also dequeue operations.
An implementation of
Collection interface that stores exactly two objects and is immutable.Validator for observable.
Represent a minimal interface to an optimization engine that can solve non-linear optimization problems.
Records the result of a call to the
OptimizationEngine.nonLinearOptimization(double[], double[][], double[], double[], double[]) method.Represents a Simple Temporal Network with Uncertainty and Oracles (OSTNU).
A simple class to represent the status of the checking algorithm during an execution.
An implementation of OSTNUEdge where the labeled value set is not optimized for maintaining scenarios like ¬c,0, and c,1.
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
Simple class that extends CSTNU for representing and managing 'parameter nodes'.
Simple class to represent a Probabilistic Simple Temporal Constraint Networks (PSTN), where the edge weights are signed integers.
Extends STNCheckStatus to represent the result of the approximating STNU.
A simple class to determine some statistics about the execution of PSTNs
The possible exit of an RTE
Maintains the map (contingent node, chosen duration of its contingent link), the number of chosen durations outside the bounds of the relative contingent link, and the conjunct probability mass of the contingent ranges with respect to the probability distribution functions of the contingent durations.
Simple class for making a meter in the console.
Determines the average execution time and some statistics of the STNU SRNCycleFinder on a given set of STNUs.
Represents a Simple Temporal Network (STN), and it contains some methods to manipulate and check an STN instance.
Implemented algorithms for STN.
Represents the status of a checking algorithm during its execution and the final result of a check.
Represents the behavior of an STN edge.
Functional interface to retrieve the edge value of interest.
Implementation of STNEdge using an integer for weight.
Simple class to represent and consistency-check Simple Temporal Network with Uncertainty (STNU), where the edge weights are signed integers.
4-tuple to represent the negative distance between two activation nodes and the range in which such distance can be considered.
Possible DC checking algorithm
Helper record for
getPCinfo methodRepresents the immutable triple (sourceNode, weight, destinationNode) necessary for generating an STNUEdge.
Status for 1) negative nodes in Morris 2014 algorithm or 2) contingent edges in RUL2020.
Data structure for RUL algorithm.
Data structure for RUL algorithm.
A simple class to represent the status of the checking algorithm during an execution.
Indicates which kind of edges determine a Semi-Reducible Negative Cycle (SRNC)
Represents some statistics about a Semi-Reducible Negative Cycle (SRNC)
Kinds of negative cycles
Represents a path of the STNU edge
Reads STNU instances and makes them denser, adding up to d (n (n-1)) edges, where n is the number of nodes and d the density.
Represents the behavior of an STNU edge.
A lower/upper-case label is represented as a pair: (node-name, flag).
Implements
STNUEdge interface using signed integer values.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.
A Real-Time Execution (RTE) algorithm is a scheduling algorithm that preserves maximum flexibility while requiring minimal computation.
Represents a contingent link
Strategy for choosing a node and an instant among a set of possible ones.
Node enabled in the given time window.
Node occurrence
(t, nodes).Node with its time window.
RTE Decision.
Class to represent the data for an execution of
STNURTE.rte(Strategy, Strategy).This interface allows the use of an enum of predefined strategies and the possibility of defining new ones.
An enum of predefined strategies allows the specification of a strategy as an input parameter.
An enum of predefined strategies allows the specification of a strategy as an input parameter.
Allows the specification of a predefined strategy as an input parameter.
Simple class to determine the average execution time (and standard deviation) of the RTE* STNU algorithm on a given set of STNUs.
Represents a time interval where the lower bound is guaranteed to be ≤ the upper bound.
A simple graphical application for creating/loading/modifying/saving/checking CSTNs.
Represents (dense) temporal network graphs where nodes are
LabeledNode and edges are (an extension of)
Edge.Types of networks that this class can represent.
Unmodifiable version of this graph.
Allows the reading of a Temporal Network (TM) graph from a file or a string in GraphML format.
Allows the writing of a Temporal Network graph to a file or a string in GraphML format.
Optimized representation of immutable predecessor graphs.
Some common types of unsatisfied property for well-defined CSTN.
Kinds of possible errors in checking well-definition property.