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

F

Filter - Interface in fr.inria.aoste.kpassa.util
 
filterOutLocalInputLoops() - Method in interface fr.inria.aoste.kpassa.graph.asynchmarkedgraph.AsynchMG
To get the list of arcs without the local input loops added by the system to allow simulation.
filterOutLocalInputLoops() - Method in class fr.inria.aoste.kpassa.graph.impl.AsynchMGImpl
 
filterOutLocalInputLoops() - Method in class fr.inria.aoste.kpassa.graph.impl.KRGGraphImpl
 
filterOutLocalInputLoops() - Method in class fr.inria.aoste.kpassa.graph.impl.MarkedGraphImpl
 
filterOutLocalInputLoops() - Method in class fr.inria.aoste.kpassa.graph.impl.SDFGraphImpl
 
filterOutLocalInputLoops() - Method in class fr.inria.aoste.kpassa.graph.impl.SynchronousMarkedGraphImpl
 
filterOutLocalInputLoops() - Method in interface fr.inria.aoste.kpassa.graph.krg.KRGGraph
To get the list of arcs without the local input loops added by the system to allow simulation.
filterOutLocalInputLoops() - Method in interface fr.inria.aoste.kpassa.graph.markedgraph.MarkedGraph
To get the list of arcs without the local input loops added by the system to allow simulation.
filterOutLocalInputLoops() - Method in interface fr.inria.aoste.kpassa.graph.sdf.SDFGraph
To get the list of arcs without the local input loops added by the system to allow simulation.
filterOutLocalInputLoops() - Method in interface fr.inria.aoste.kpassa.graph.synchronousmarkedgraph.SynchronousMarkedGraph
To get the list of arcs without the local input loops added by the system to allow simulation.
findByName(String) - Method in interface fr.inria.aoste.kpassa.graph.asynchmarkedgraph.AsynchMG
 
findByName(String) - Method in interface fr.inria.aoste.kpassa.graph.digraph.DiGraph
 
findByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.AsynchMGImpl
 
findByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.HashDiGraph
 
findByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.KRGGraphImpl
 
findByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.MarkedGraphImpl
 
findByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.SDFGraphImpl
 
findByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.SynchronousMarkedGraphImpl
 
findByName(String) - Method in interface fr.inria.aoste.kpassa.graph.krg.KRGGraph
 
findByName(String) - Method in interface fr.inria.aoste.kpassa.graph.markedgraph.MarkedGraph
 
findByName(String) - Method in interface fr.inria.aoste.kpassa.graph.sdf.SDFGraph
 
findByName(String) - Method in interface fr.inria.aoste.kpassa.graph.synchronousmarkedgraph.SynchronousMarkedGraph
 
FindCriticalSCCsAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.markedgraph
To find the critical strongly connected components of a SMG.
FindCriticalSCCsAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.markedgraph.FindCriticalSCCsAlgorithm
 
FindCycleAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.digraph
This algorithm searches for all the cycle of the graph and computes their throughput.
FindCycleAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.digraph.FindCycleAlgorithm
 
FindCycleRateAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.markedgraph
This algorithm computes the rate of every cycle and determine if it is critical or not.
FindCycleRateAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.markedgraph.FindCycleRateAlgorithm
 
FindCycleThroughAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.digraph
This algorithm searches for all the cycles going through any of the arcs given as parameter of the constructor.
FindCycleThroughAlgorithm(Set<? extends Arc>) - Constructor for class fr.inria.aoste.kpassa.algorithm.digraph.FindCycleThroughAlgorithm
 
FindDelayPlacement - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator
 
FindDelayPlacement() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator.FindDelayPlacement
 
FindIntersectionAlgorithm<T> - Class in fr.inria.aoste.kpassa.algorithm.digraph
This class implements the intersection operation between two homogeneous sets.
FindIntersectionAlgorithm(Set<T>, Set<T>) - Constructor for class fr.inria.aoste.kpassa.algorithm.digraph.FindIntersectionAlgorithm
 
FindIsSteadyMarkingAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator
 
FindIsSteadyMarkingAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator.FindIsSteadyMarkingAlgorithm
 
FindPeriodicityAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.markedgraph
This algorithm find the periodicity and the period of the graph using FindStronglyConnectedComponents algorithm and MinimumCycleMeanRatioAlgorithm algorithm.
FindPeriodicityAlgorithm() - Constructor for class fr.inria.aoste.kpassa.algorithm.markedgraph.FindPeriodicityAlgorithm
 
findPortByName(String) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Vertex
To find port in the vertex using its name.
findPortByName(String) - Method in class fr.inria.aoste.kpassa.graph.impl.SDFVertexImpl
 
findPortByName(String) - Method in interface fr.inria.aoste.kpassa.graph.sdf.SDFVertex
To find port in the vertex using its name.
findPortBySymbol(char) - Method in interface fr.inria.aoste.kpassa.graph.digraph.Vertex
To find port in the vertex using its symbol.
FindReachableVerticesAlgorithm - Class in fr.inria.aoste.kpassa.algorithm.digraph
This algorithm finds all the vertices reachable from a given source vertex.
FindReachableVerticesAlgorithm(Vertex, boolean) - Constructor for class fr.inria.aoste.kpassa.algorithm.digraph.FindReachableVerticesAlgorithm
 
FindStronglyConnectedComponents<T extends Vertex,U extends Arc> - Class in fr.inria.aoste.kpassa.algorithm.digraph
This algorithm is the implementation of Tarjan's algorithm to find the strongly connected components of a graph.
FindStronglyConnectedComponents() - Constructor for class fr.inria.aoste.kpassa.algorithm.digraph.FindStronglyConnectedComponents
 
fire(List<MGVertex>) - Method in class fr.inria.aoste.kpassa.algorithm.MG.simulator.firedStrategy.AsynchronousFiredStrategy
 
fire(List<MGVertex>) - Method in interface fr.inria.aoste.kpassa.algorithm.MG.simulator.firedStrategy.FiredStrategy
This methods defines the way marking evolves when the vertices are fired.
fire(List<MGVertex>) - Method in class fr.inria.aoste.kpassa.algorithm.MG.simulator.firedStrategy.SMGFiredStrategy
 
fire() - Method in class fr.inria.aoste.kpassa.graph.impl.MGVertexImpl
 
fire() - Method in interface fr.inria.aoste.kpassa.graph.markedgraph.MGVertex
To fire it.
FireableStrategy - Interface in fr.inria.aoste.kpassa.algorithm.MG.simulator.fireableStrategy
This interface defines the fireable strategy to determine which vertices of the graph are fireable.
FiredStrategy - Interface in fr.inria.aoste.kpassa.algorithm.MG.simulator.firedStrategy
This interface defines the strategy to actually fire a graph
FiringStrategy - Interface in fr.inria.aoste.kpassa.algorithm.MG.simulator.firingStrategy
To get the vertices to be fired from the list of fireable vertices.
formatSchedule() - Method in class fr.inria.aoste.kpassa.graph.impl.SynchronousMarkedGraphImpl
 
formatSchedule() - Method in interface fr.inria.aoste.kpassa.graph.synchronousmarkedgraph.SynchronousMarkedGraph
To format the schedule as an initial part followed by a steady part At the end of the automatic simulation, the full schedule is contained in initialSchedule so this method cut it in two and put the second part in steadySchedule.
ForNStepsFireableStrategyDecorator - Class in fr.inria.aoste.kpassa.algorithm.MG.simulator.fireableStrategy
To simulate the graph for a limited number of steps
ForNStepsFireableStrategyDecorator(FireableStrategy, int) - Constructor for class fr.inria.aoste.kpassa.algorithm.MG.simulator.fireableStrategy.ForNStepsFireableStrategyDecorator
This constructor takes as parameter a delegate to decide when a vertex is fireable.
For example: AllPossibleVerticesStrategy
fr.inria.aoste.kpassa.algorithm - package fr.inria.aoste.kpassa.algorithm
 
fr.inria.aoste.kpassa.algorithm.digraph - package fr.inria.aoste.kpassa.algorithm.digraph
 
fr.inria.aoste.kpassa.algorithm.krg - package fr.inria.aoste.kpassa.algorithm.krg
 
fr.inria.aoste.kpassa.algorithm.markedgraph - package fr.inria.aoste.kpassa.algorithm.markedgraph
 
fr.inria.aoste.kpassa.algorithm.MG.simulator - package fr.inria.aoste.kpassa.algorithm.MG.simulator
 
fr.inria.aoste.kpassa.algorithm.MG.simulator.fireableStrategy - package fr.inria.aoste.kpassa.algorithm.MG.simulator.fireableStrategy
 
fr.inria.aoste.kpassa.algorithm.MG.simulator.firedStrategy - package fr.inria.aoste.kpassa.algorithm.MG.simulator.firedStrategy
 
fr.inria.aoste.kpassa.algorithm.MG.simulator.firingStrategy - package fr.inria.aoste.kpassa.algorithm.MG.simulator.firingStrategy
 
fr.inria.aoste.kpassa.algorithm.sdf - package fr.inria.aoste.kpassa.algorithm.sdf
 
fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph - package fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph
 
fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling - package fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling
 
fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step - package fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.balancedScheduling.step
 
fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.equalization - package fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.equalization
 
fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator - package fr.inria.aoste.kpassa.algorithm.synchronousMarkedGraph.simulator
 
fr.inria.aoste.kpassa.core - package fr.inria.aoste.kpassa.core
 
fr.inria.aoste.kpassa.core.annotation - package fr.inria.aoste.kpassa.core.annotation
 
fr.inria.aoste.kpassa.exception - package fr.inria.aoste.kpassa.exception
 
fr.inria.aoste.kpassa.graph.asynchmarkedgraph - package fr.inria.aoste.kpassa.graph.asynchmarkedgraph
 
fr.inria.aoste.kpassa.graph.digraph - package fr.inria.aoste.kpassa.graph.digraph
 
fr.inria.aoste.kpassa.graph.impl - package fr.inria.aoste.kpassa.graph.impl
 
fr.inria.aoste.kpassa.graph.krg - package fr.inria.aoste.kpassa.graph.krg
 
fr.inria.aoste.kpassa.graph.markedgraph - package fr.inria.aoste.kpassa.graph.markedgraph
 
fr.inria.aoste.kpassa.graph.sdf - package fr.inria.aoste.kpassa.graph.sdf
 
fr.inria.aoste.kpassa.graph.synchronousmarkedgraph - package fr.inria.aoste.kpassa.graph.synchronousmarkedgraph
 
fr.inria.aoste.kpassa.graph.visitors - package fr.inria.aoste.kpassa.graph.visitors
 
fr.inria.aoste.kpassa.util - package fr.inria.aoste.kpassa.util
 
frUsagePerPeriodChanged(Arc, short, short) - Method in class fr.inria.aoste.kpassa.graph.impl.SynchronousMarkedGraphImpl
 
frUsagePerPeriodChanged(Arc, short, short) - Method in interface fr.inria.aoste.kpassa.graph.synchronousmarkedgraph.SMGArcListener
 
frValueChanged(Arc, short, short) - Method in class fr.inria.aoste.kpassa.graph.impl.SynchronousMarkedGraphImpl
 
frValueChanged(Arc, short, short) - Method in interface fr.inria.aoste.kpassa.graph.synchronousmarkedgraph.SMGArcListener
 
A B C D E F G H I K L M N O P R S T V W