A B C D E F G H I K L M N O P R S T V W 

C

cellChanged(BinaryWord, int) - Method in class fr.inria.aoste.kpassa.graph.impl.MGVertexImpl
 
cellChanged(BinaryWord, int) - Method in interface fr.inria.aoste.kpassa.util.BinaryWordListener
 
cellRemoved(BinaryWord, int) - Method in class fr.inria.aoste.kpassa.graph.impl.MGVertexImpl
 
cellRemoved(BinaryWord, int) - Method in interface fr.inria.aoste.kpassa.util.BinaryWordListener
 
CheckAMGLivenessAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.markedgraph
To check the liveness of an AsynchMG.
CheckAMGLivenessAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.markedgraph.CheckAMGLivenessAlgorithm
 
checkBalancedEquation() - Method in class fr.inria.aoste.kpassa.core.KPassa
This method checks the balanced equation on the SDF graph
CheckFlowPreservationAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.sdf
To check the flow preservation of an SDF graph.
CheckFlowPreservationAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.sdf.CheckFlowPreservationAlgorithm
 
CheckKRGFlowPreservation - Class in fr.inria.aoste.kpassa.algorithm.krg
To check the flow preservation of a KRG graph.
CheckKRGFlowPreservation() - Constructor for class fr.inria.aoste.kpassa.algorithm.krg.CheckKRGFlowPreservation
 
CheckKRGLivenessAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.krg
To check the liveness of a KRG graph.
CheckKRGLivenessAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.krg.CheckKRGLivenessAlgorithm
 
CheckKRGMaximumBufferSizeAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.krg
To check the maximum place usage during a period of execution of a KRG.
CheckKRGMaximumBufferSizeAlgorithm(FireableStrategy, FiringStrategy) - Constructor for class fr.inria.aoste.kpassa.algorithm.krg.CheckKRGMaximumBufferSizeAlgorithm
 
checkLiveness() - Method in class fr.inria.aoste.kpassa.core.KPassa
Check wether the graph is live or not i.e.
CheckLivenessAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.sdf
To check the liveness of an SDF graph.
CheckLivenessAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.sdf.CheckLivenessAlgorithm
 
CheckMaximumBufferSizeAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.sdf
To check the maximum place usage during a period of execution of an SDF graph.
CheckMaximumBufferSizeAlgorithm(FireableStrategy, FiringStrategy) - Constructor for class fr.inria.aoste.kpassa.algorithm.sdf.CheckMaximumBufferSizeAlgorithm
 
checkSymbolsInRoute(String) - Method in class fr.inria.aoste.kpassa.util.NaryWord
 
clone() - Method in interface fr.inria.aoste.kpassa.graph.digraph.Path
 
clone() - Method in class fr.inria.aoste.kpassa.graph.impl.PathImpl
To clone the path
clone() - Method in class fr.inria.aoste.kpassa.util.BinaryWord
To clone the binary word.
clone() - Method in class fr.inria.aoste.kpassa.util.NaryWord
 
closing_box_text - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
closing_box_text_new - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
closing_box_text_open - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
closing_box_title - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
compareTo(Rational) - Method in class fr.inria.aoste.kpassa.util.Rational
compare two rationals
complement() - Method in class fr.inria.aoste.kpassa.util.BinaryWord
To get the complement of the word.
computeASAPExecution() - Method in class fr.inria.aoste.kpassa.core.KPassa
To compute the ASAP schedule of a graph.
ComputeBalancedScheduleAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling
This class is the main algorithm to compute the balanced scheduling of the given MG.
ComputeBalancedScheduleAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.ComputeBalancedScheduleAlgorithm
 
computeBalancedScheduling() - Method in class fr.inria.aoste.kpassa.core.KPassa
Perform the balanced scheduling algorithm.
ComputeDAGSchedulingAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph
To compute the schedule of Directed Acyclic Synchronous Marked graph.
ComputeDAGSchedulingAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.ComputeDAGSchedulingAlgorithm
 
ComputeEqualization - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.equalization
This algorithm does the equalization by adding extra latencies on arcs of non critical cycles in order to minimize the throughput difference between the critical cycles and the others.
ComputeEqualization() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.equalization.ComputeEqualization
 
ComputeGuidedInitializationAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator
 
ComputeGuidedInitializationAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator.ComputeGuidedInitializationAlgorithm
 
ComputeInitialization - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
This algorithm finds the initialization sequence leading to the first balanced marking.
ComputeInitialization() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step.ComputeInitialization
 
ComputeInitializationFireableStrategy - Class in fr.inria.aoste.kpassa.algorithm.krg
This algorithm simulates a KRG until every routing vertex has terminated its initialization sequence.
ComputeInitializationFireableStrategy(FireableStrategy) - Constructor for class fr.inria.aoste.kpassa.algorithm.krg.ComputeInitializationFireableStrategy
 
ComputeInitialSchedule - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator
 
ComputeInitialSchedule() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator.ComputeInitialSchedule
 
ComputeIOCycleAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
This algorithm adds a circuit relating the global inputs and outputs of the graph in order to convert DAG of SCCs in a single SSC.
ComputeIOCycleAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step.ComputeIOCycleAlgorithm
 
ComputeIORateAdaptationAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
This algorithm increases the number of tokens on the IOCycle to be sure that the throughput of the graph remains unchanged.
ComputeIORateAdaptationAlgorithm(MGCycle) - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step.ComputeIORateAdaptationAlgorithm
 
ComputeMarking - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
This algorithm finds the balanced marking from the given schedule computed by FillUpTheSchedulesSimpleVersion or FillUpTheSchedules algorithms.
ComputeMarking() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step.ComputeMarking
 
computeMaxBuffer(FireableStrategy, FiringStrategy) - Method in class fr.inria.aoste.kpassa.core.KPassa
This algorithm runs a single period of execution of a graph and returns the required size of the places for this execution.
computePeriodicity() - Method in class fr.inria.aoste.kpassa.core.KPassa
Find the periodicity of the marked graph The result can be accessed from MarkedGraphImpl.getPeriod() and MarkedGraphImpl.getPeriodicity()
ComputePeriodicityAdaptationAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
 
ComputePeriodicityAdaptationAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step.ComputePeriodicityAdaptationAlgorithm
 
computeSSC() - Method in class fr.inria.aoste.kpassa.core.KPassa
Find the strongly connected components in the marked graph
ComputeSteadyScheduleAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
This algorithm tags each vertex with a balanced schedule according to the k-periodicity of the graph.
ComputeSteadyScheduleAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step.ComputeSteadyScheduleAlgorithm
 
concat(Arc) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Path
To add an arc to the path
concat(Arc) - Method in class fr.inria.aoste.kpassa.graph.impl.PathImpl
 
confirmation_box_text - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
confirmation_box_text_reset - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
confirmation_box_title - Static variable in class fr.inria.aoste.kpassa.util.KPassaLabel
 
consume() - Method in class fr.inria.aoste.kpassa.graph.impl.AsynchMGArcImpl
 
consume() - Method in class fr.inria.aoste.kpassa.graph.impl.KRGArcImpl
 
consume() - Method in interface fr.inria.aoste.kpassa.graph.markedgraph.MGArc
To consume a token into the place of the arc
contains(Vertex) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Cycle
To test whether a vertex is contained in the path.
contains(Arc) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Cycle
To test whether an arc is contained in the path.
contains(Vertex) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Path
To test whether a vertex is contained in the path.
contains(Arc) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Path
To test whether an arc is contained in the path.
contains(Vertex) - Method in interface fr.inria.aoste.kpassa.graph.digraph.StronglyConnectedComponent
To check whether a vertex is contained in the scc.
contains(Vertex) - Method in class fr.inria.aoste.kpassa.graph.impl.PathImpl
 
contains(Arc) - Method in class fr.inria.aoste.kpassa.graph.impl.PathImpl
 
contains(Vertex) - Method in class fr.inria.aoste.kpassa.graph.impl.StronglyConnectedComponentImpl
 
contains(boolean) - Method in class fr.inria.aoste.kpassa.util.BinaryWord
To check whether the word contains at least one bit with the value of b.
Cycle - Interface in fr.inria.aoste.kpassa.graph.digraph
 
CycleImpl - Class in fr.inria.aoste.kpassa.graph.impl
A cycle is a path where the source vertex of the first arc is equals to the destination vertex of the last arc.
CycleImpl(Path, Arc) - Constructor for class fr.inria.aoste.kpassa.graph.impl.CycleImpl
The arc closes the path.
cycleListChanged(List<MGCycle>) - Method in interface fr.inria.aoste.kpassa.graph.markedgraph.MarkedGraphListener
 
A B C D E F G H I K L M N O P R S T V W