Trait

util.analyzers

PhiCutEnumerationBDD

Related Doc: package analyzers

Permalink

trait PhiCutEnumerationBDD extends PhiCutEnumeration[InstBoolIdent] with BDDAnalyzer

Trait for BDD based cutsets enumeration on phi

Self Type
PhiCutEnumerationBDD with Phi
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PhiCutEnumerationBDD
  2. BDDAnalyzer
  3. PhiCutEnumeration
  4. PhiAnalyzer
  5. Analyser
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract val BDDFactory: BDDFactory with Z3BoolExprToBDDTranslator

    Permalink

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. def _computeBDD(max: Option[Int]): (BDD, Map[Int, InstBoolIdent])

    Permalink

    Truncated computation of the BDD of phi

    Truncated computation of the BDD of phi

    max

    optional bound on cutset cardinality

    returns

    the BDD of phi and a mapping of BDD Node to system events

  5. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def computeAllCuts(): Set[Set[InstBoolIdent]]

    Permalink

    Compute cutsets on the classic BDD of Phi

    Compute cutsets on the classic BDD of Phi

    returns

    cutsets

    Definition Classes
    PhiCutEnumerationBDDPhiCutEnumeration
  8. 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
  9. 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
  10. 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
  11. def computeCutsUntil(max: Int): Set[Set[InstBoolIdent]]

    Permalink

    Compute cutsets on the truncated BDD of Phi

    Compute cutsets on the truncated BDD of Phi

    max

    cutset cardinality bound

    returns

    cutsets

    Definition Classes
    PhiCutEnumerationBDDPhiCutEnumeration
  12. 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
  13. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  22. val phiCutEnumerationProfiler: Profiler[Option[Int], Iterable[Set[InstBoolIdent]]]

    Permalink
  23. 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
  24. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from BDDAnalyzer

Inherited from PhiAnalyzer

Inherited from Analyser

Inherited from AnyRef

Inherited from Any

Ungrouped