Trait

analyzers

SubstitutionAnalyzerSim

Related Doc: package analyzers

Permalink

trait SubstitutionAnalyzerSim extends SubstitutionAnalyzer with BDDAnalyzer

Analysis of the substitutions given in the design space of the DSE problem by using the interpreter

Self Type
SubstitutionAnalyzerSim with Parsing with SMTTranslation with TraceInterpreter
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SubstitutionAnalyzerSim
  2. BDDAnalyzer
  3. SubstitutionAnalyzer
  4. ConfigurationAnalyzer
  5. Analyser
  6. AnyRef
  7. 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

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. def analyseSub(s: CompSubstitution): Map[(SubstitutionAnalyzerSim.this)#OrderedCompTrace, (Array[InfInt], Array[Real])]

    Permalink

    Compute the order and probability arrays for a given substitution

    Compute the order and probability arrays for a given substitution

    s

    an AST node ofr component substitution

    returns

    the order and probability arrays

  8. final def asInstanceOf[T0]: T0

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

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

    Permalink

    Order over flow identifiers

    Order over flow identifiers

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

    Permalink

    Order over constants

    Order over constants

    Definition Classes
    ConfigurationAnalyzer
  12. 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
  13. def computeCardBDD(bdd: BDD): InfInt

    Permalink

    Compute the order of a BDD ie the minimal number of event needed to reach one terminal

    Compute the order of a BDD ie the minimal number of event needed to reach one terminal

    bdd

    the BDD

    returns

    the order of the BDD

    Definition Classes
    BDDAnalyzer
  14. def computeCutsBDD(bdd: BDD): Set[Set[Int]]

    Permalink

    Compute the minimal cutsets in a BDD thanks to Rauzy algorithm

    Compute the minimal cutsets in a BDD thanks to Rauzy algorithm

    bdd

    the BDD

    returns

    the cutsets as set of sets of index

    Definition Classes
    BDDAnalyzer
  15. def computeCutsBDDUntil(bdd: BDD, max: Int): Set[Set[Int]]

    Permalink

    Compute minimal cutsets up to a given cardinality thanks to Rauzy algorithm

    Compute minimal cutsets up to a given cardinality thanks to Rauzy algorithm

    bdd

    BDD

    max

    bound of cutsets cardinality

    returns

    cutsets

    Definition Classes
    BDDAnalyzer
  16. def computeProbaBDD(bdd: BDD, unrMap: ProbabilityMapType): Real

    Permalink

    Compute the probability to reach one terminal from root ie

    Compute the probability to reach one terminal from root ie

    bdd

    BDD

    unrMap

    probability of each event attached to a BDD node

    returns

    Probability to reach one terminal from root

    Definition Classes
    BDDAnalyzer
  17. val computeTraceCard: (BDD) ⇒ InfInt

    Permalink

    Memoized computation of the order of a BDD

  18. val computeTraceUnr: ((BDD, ProbabilityMapType)) ⇒ Real

    Permalink

    Memoized computation of the probability of a BDD

  19. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit

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

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

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

    Permalink
    Definition Classes
    Any
  25. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  28. def printSymbProbaBDD(bdd: BDD, unrMap: Map[Int, String], ps: PrintStream): String

    Permalink

    Compute symbolic probability to reach one terminal from root

    Compute symbolic probability to reach one terminal from root

    bdd

    BDD

    unrMap

    probability of each event attached to a BDD node

    returns

    symbolic probability to reach one terminal from root

    Definition Classes
    BDDAnalyzer
  29. lazy val substitutions: Map[(SubstitutionAnalyzerSim.this)#OrderedCompInstIdent, Map[(SubstitutionAnalyzerSim.this)#OrderedCompTrace, (Array[InfInt], Array[Real])]]

    Permalink

    Associate to each component instance of the system and each of its trace, the local safety indicator arrays

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

    Permalink
    Definition Classes
    AnyRef
  31. implicit def toOSymb(s: Symbol): (SubstitutionAnalyzerSim.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
  32. def toString(): String

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

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

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

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

Inherited from BDDAnalyzer

Inherited from SubstitutionAnalyzer

Inherited from ConfigurationAnalyzer

Inherited from Analyser

Inherited from AnyRef

Inherited from Any

Ungrouped