Trait

util.analyzers

BDDAnalyzer

Related Doc: package analyzers

Permalink

trait BDDAnalyzer extends AnyRef

Created by kdelmas on 04/11/16.

Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BDDAnalyzer
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. 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

  7. 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

  8. 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

  9. 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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  19. 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

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

    Permalink
    Definition Classes
    AnyRef
  21. def toString(): String

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped