Package it.univr.di.cstnu.algorithms


package it.univr.di.cstnu.algorithms
Contains all checking algorithms for (C)STN(U)s.
Author:
posenato
  • Class
    Description
    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.
    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.
    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.
    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 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.
    A simple class is used to represent and check a Conditional Simple Temporal Network (CSTN) where the edge weights are signed integers.
    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.
    Represents a Simple Temporal Network with Uncertainty and Oracles (OSTNU).
    A simple class to represent the status of the checking algorithm during an execution.
    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.
    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.
    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 method
    Represents 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
    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.
    Allows the specification of a predefined strategy as an input parameter.
    Some common types of unsatisfied property for well-defined CSTN.
    Kinds of possible errors in checking well-definition property.