Trait

old

DesignSpaceExplorationKCR

Related Doc: package old

Permalink

trait DesignSpaceExplorationKCR extends DesignSpaceExploration with CardinalityTheory with STMDDBuilder with UnreliabilityTheory

Self Type
DesignSpaceExplorationKCR with Parsing with SMTTranslation
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DesignSpaceExplorationKCR
  2. UnreliabilityTheory
  3. STMDDBuilder
  4. CardinalityTheory
  5. DesignSpaceExploration
  6. ConfigurationAnalyzer
  7. Analyser
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class OrderedCompInstIdent extends Ordered[(ConfigurationAnalyzer.this)#OrderedCompInstIdent]

    Permalink

    Class encoding instance identifiers which can be ordered

    Class encoding instance identifiers which can be ordered

    Definition Classes
    ConfigurationAnalyzer
  2. class OrderedCompTrace extends Ordered[(ConfigurationAnalyzer.this)#OrderedCompTrace]

    Permalink

    Class encoding of component traces which can be ordered

    Class encoding of component traces which can be ordered

    Definition Classes
    ConfigurationAnalyzer
  3. class OrderedSymbol extends Ordered[(ConfigurationAnalyzer.this)#OrderedSymbol]

    Permalink

    Class encoding scala Symbol that can be compared

    Class encoding scala Symbol that can be compared

    Definition Classes
    ConfigurationAnalyzer
  4. case class STMDDEdgeLabel extends Ordered[(STMDDBuilder.this)#STMDDEdgeLabel] with Product with Serializable

    Permalink

    Case class encoding the label on the STMDD edges

    Case class encoding the label on the STMDD edges

    Definition Classes
    STMDDBuilder

Abstract Value Members

  1. abstract val STMDDD: ((DesignSpaceExplorationKCR.this)#mddFactory)#MDD

    Permalink

    the STMDD of the system

    the STMDD of the system

    Definition Classes
    STMDDBuilder
  2. abstract def generateDecisionVars(): List[SubstitutionVar]

    Permalink
    Attributes
    protected
  3. abstract val mddFactory: GenMDDFactory[(DesignSpaceExplorationKCR.this)#OrderedCompInstIdent, Set, (DesignSpaceExplorationKCR.this)#STMDDEdgeLabel, (DesignSpaceExplorationKCR.this)#OrderedSymbol, Set[(DesignSpaceExplorationKCR.this)#STMDDEdgeLabel]] with MDDPrinter[(DesignSpaceExplorationKCR.this)#OrderedCompInstIdent, Set, (DesignSpaceExplorationKCR.this)#STMDDEdgeLabel, (DesignSpaceExplorationKCR.this)#OrderedSymbol, Set[(DesignSpaceExplorationKCR.this)#STMDDEdgeLabel]]

    Permalink

    the MDD factory used to build the STMDD

    the MDD factory used to build the STMDD

    Definition Classes
    STMDDBuilder

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object OrderedCompInstIdent

    Permalink

    Companion object for ordered instance identifiers

    Companion object for ordered instance identifiers

    Definition Classes
    ConfigurationAnalyzer
  5. object OrderedCompTrace

    Permalink

    Companion object of component traces

    Companion object of component traces

    Definition Classes
    ConfigurationAnalyzer
  6. object OrderedSymbol

    Permalink

    Companion object for ordered symbols

    Companion object for ordered symbols

    Definition Classes
    ConfigurationAnalyzer
  7. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. implicit object compBasicFlow extends Ordering[BasicFlowIdent]

    Permalink

    Order over flow identifiers

    Order over flow identifiers

    Definition Classes
    ConfigurationAnalyzer
  10. implicit object compFlowConst extends Ordering[FlowConst]

    Permalink

    Order over constants

    Order over constants

    Definition Classes
    ConfigurationAnalyzer
  11. implicit object compOrder extends Ordering[CompInstanceIdent]

    Permalink

    Order over instance identifiers in a system component

    Order over instance identifiers in a system component

    Definition Classes
    ConfigurationAnalyzer
  12. def computeCard(choice: Map[CompInstanceIdent, CompAlternative]): CardMeasure

    Permalink

    compute the cardinality of a substitution choice

    compute the cardinality of a substitution choice

    choice

    the substitution choice

    returns

    the over, under and exact cardinality (if computable)

    Definition Classes
    CardinalityTheory
  13. def computeCardRec(node: ((DesignSpaceExplorationKCR.this)#mddFactory)#MDD, choice: Map[CompInstanceIdent, CompAlternative]): CardMeasure

    Permalink

    Recursively compute the cardinality of a mdd node according to a substitution choice which is card(node)=min_{s \in node.kids} (card(s.tr,choice(node))+card(s.son))

    Recursively compute the cardinality of a mdd node according to a substitution choice which is card(node)=min_{s \in node.kids} (card(s.tr,choice(node))+card(s.son))

    node

    mdd node

    choice

    substitution chocie

    returns

    the over, under and exact cardinality (if computable)

    Definition Classes
    CardinalityTheory
  14. def computeUnrWithMemo(choice: Map[CompInstanceIdent, CompAlternative]): ProbMeasure

    Permalink

    Calcul une surapprox, sous approx et valeur reel (si le choix est complet) de la defiabilite

    Calcul une surapprox, sous approx et valeur reel (si le choix est complet) de la defiabilite

    choice

    choix de selection de substiution

    returns

    une mesure de la defibailite

    Definition Classes
    UnreliabilityTheory
  15. def computeUnrWithoutMemo(choice: Map[CompInstanceIdent, CompAlternative]): ProbMeasure

    Permalink
    Definition Classes
    UnreliabilityTheory
  16. val designSpaceExplorationProfilerKCR: Profiler[Unit, Option[Map[CompInstanceIdent, CompAlternative]]]

    Permalink
  17. val enumVarSafeCardCache: HashMap[PathIdentType, SubstitutionVar]

    Permalink
    Definition Classes
    CardinalityTheory
  18. val enumVarSafeUnrCache: HashMap[PathIdentType, SubstitutionVar]

    Permalink

    Theorie de la defiabilite qui renvoi pour un choix donnee le status et la clause de conflit si status est UNSAT sinon le choix initial.

    Theorie de la defiabilite qui renvoi pour un choix donnee le status et la clause de conflit si status est UNSAT sinon le choix initial. On parcours l'arbre des traces avec un budget de defiabilite a depenser, on calcul donc les long des chemins une borne min, max et si possible reel de la defiabilite. Si au bout de l'evaluation d'un groupe de chemins la reponse est UNSAT alors on sait que le modele n'est pas satisfaisant. Dans le cas d'une valuation incomplete Si la surapprox est correcte le modele est correct, la sous approx est incorrect le modele est incorrect, sinon on ne sait pas.

    returns

    si le modele satisfait ou non les contrainte et une clause de conflit (CNF)

    Definition Classes
    UnreliabilityTheory
  19. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  21. def explore(RObj: Option[Real], cardObj: Option[Int]): Option[Map[CompInstanceIdent, CompAlternative]]

    Permalink
  22. def explore(): Option[Map[CompInstanceIdent, CompAlternative]]

    Permalink
  23. def exploreSimple(RObj: Option[Real], cardObj: Option[Int]): Option[Map[CompInstanceIdent, CompAlternative]]

    Permalink
  24. def exploreWithoutXplain(RObj: Option[Real], cardObj: Option[Int]): Option[Map[CompInstanceIdent, CompAlternative]]

    Permalink
  25. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  26. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  27. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  28. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  29. def isSafeCard(obj: Int, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink

    cardinality theory which returns for a given substitution choice, the status and the propogation and conflicts.

    cardinality theory which returns for a given substitution choice, the status and the propogation and conflicts. The theory try to dispatch on the trace tree a budget corresponding to the cardinality requirement. For cardinality since card(node)=min_{s \in node.kids} (card(s)+card(tr_{node \to s})), then if one path does not fulfill the requirement then the candidate does not fill the requirement. Since the substitution choice is not always complete, an over and under approximations of the budget are computed at each step.

    obj

    cardinality requirement

    model

    subsitution choice

    returns

    the status of the dispatch operation and the conflicts/propagations

    Definition Classes
    CardinalityTheory
  30. def isSafeUnr(objective: Real, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink
    Definition Classes
    UnreliabilityTheory
  31. def isSafeUnrQuickXplain(objective: Real, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink
    Definition Classes
    UnreliabilityTheory
  32. def isSafeUnrSimple(objective: Real, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink
    Definition Classes
    UnreliabilityTheory
  33. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  34. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  36. def quickExplain(model: Traversable[(SubstitutionVar, Expr)], solver: (Seq[(PathIdentType, Option[Int])]) ⇒ Status): (Status, Traversable[(SubstitutionVar, Expr)])

    Permalink
    Definition Classes
    UnreliabilityTheory
  37. def resolvePb(theoriesFunc: List[(Seq[(SubstitutionVar, Expr)]) ⇒ (Status, Seq[Seq[BoolExpr]])]): Option[Map[CompInstanceIdent, CompAlternative]]

    Permalink
    Attributes
    protected
  38. lazy val solution: Option[Map[CompInstanceIdent, CompAlternative]]

    Permalink
  39. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  40. implicit def toOSymb(s: Symbol): (DesignSpaceExplorationKCR.this)#OrderedSymbol

    Permalink

    implicit transformation from Symbol to Ordered Symbol

    implicit transformation from Symbol to Ordered Symbol

    s

    Scala Symbol

    returns

    ordered symbol

    Definition Classes
    ConfigurationAnalyzer
  41. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  42. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from UnreliabilityTheory

Inherited from STMDDBuilder

Inherited from CardinalityTheory

Inherited from DesignSpaceExploration

Inherited from ConfigurationAnalyzer

Inherited from Analyser

Inherited from AnyRef

Inherited from Any

Ungrouped