Package it.univr.di.cstnu.algorithms
package it.univr.di.cstnu.algorithms
Contains all checking algorithms for (C)STN(U)s.
- Author:
- posenato
-
ClassDescriptionAbstractCSTN<E extends CSTNEdge>Core class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.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 dcSemanticsAbstractCSTN.EdgesToCheck<E extends Edge>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.
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.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 DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.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).
This class implementation considers instantaneous reactions and uses only rules qR0, and qR3 as label modification rules.
Edge values are integers.Simple class to represent the status of the checking algorithm during an execution.
controllability = super.consistency.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 invokingCSTN.dynamicConsistencyCheck().Simple class to represent and DC check Conditional Simple Temporal Network (CSTN) where the edge weight are signed integer.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.Represents a Simple Temporal Network with Uncertainty and Oracles (OSTNU).Simple class to represent the status of the checking algorithm during an execution.
controllability = super.consistency.Simple class that extends CSTNU for representing and managing also 'parameter nodes'.Simple class to represent a Probabilistic Simple Temporal Constraint Networks (PSTN), where the edge weight are signed integer.Extends STNCheckStatus to represent result of the approximating STNU.Represents a Simple Temporal Network (STN) and it contains some methods to manipulate and to check an STN instance.Implemented algorithms for STN.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.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 weight are signed integer.Possible DC checking algorithmSimple 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 cyclesA Real-Time Execution (RTE) algorithm is a scheduling algorithm that preserves maximum flexibility while requiring minimal computation.Represents a contingent linkStrategy for choosing a node and an instant among a set of possible ones.Node enabled in the given time window.Node occurrence(t, nodes).
trepresent an execution time.Node with its time window.RTE Decision.Class to represent the data for an execution ofSTNURTE.rte(Strategy, 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.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.