Class

com.ing.baker.petrinet.api

PetriNet

Related Doc: package api

Permalink

class PetriNet[P, T] extends AnyRef

Petri net class.

Backed by a graph object from scala-graph (https://github.com/scala-graph/scala-graph)

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

Instance Constructors

  1. new PetriNet(innerGraph: PetriNetGraph[P, T])

    Permalink

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. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(obj: Any): Boolean

    Permalink
    Definition Classes
    PetriNet → AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. def findPTEdge(from: P, to: T): Option[Any]

    Permalink

    Returns the (optional) edge for a given place -> transition pair.

    Returns the (optional) edge for a given place -> transition pair.

    from

    The source place.

    to

    The target transition.

  10. def findTPEdge(from: T, to: P): Option[Any]

    Permalink

    Returns the (optional) edge for a given transition -> place pair.

    Returns the (optional) edge for a given transition -> place pair.

    from

    The source transition.

    to

    The target place.

  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  12. val hashCode: Int

    Permalink

    We override the hashCode function since the scalax.collections.Graph hashCode is non deterministic

    We override the hashCode function since the scalax.collections.Graph hashCode is non deterministic

    Definition Classes
    PetriNet → AnyRef → Any

  13. def inMarking(t: T): MultiSet[P]

    Permalink

    Returns the in-marking of a transition.

    Returns the in-marking of a transition. That is; a map of place -> arc weight

    t

    transition

  14. def incomingPlaces(t: T): Set[P]

    Permalink

    The in-adjacent places of a transition.

    The in-adjacent places of a transition.

    t

    transition

  15. def incomingTransitions(p: P): Set[T]

    Permalink

    The in-adjacent transitions of a place.

    The in-adjacent transitions of a place.

    p

    place

  16. val innerGraph: PetriNetGraph[P, T]

    Permalink

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  19. def nodes: Set[Either[P, T]]

    Permalink

    The set of nodes (places + transitions) in the petri net.

    The set of nodes (places + transitions) in the petri net.

    returns

    The set of nodes.

  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  22. def outMarking(t: T): MultiSet[P]

    Permalink

    The out marking of a transition.

    The out marking of a transition. That is; a map of place -> arc weight

    t

    transition

  23. def outgoingPlaces(t: T): Set[P]

    Permalink

    The out-adjecent places of a transition.

    The out-adjecent places of a transition.

    t

    transition

  24. def outgoingTransitions(p: P): Set[T]

    Permalink

    The out-adjacent transitions of a place.

    The out-adjacent transitions of a place.

    p

    place

  25. val places: Set[P]

    Permalink

    The set of places of the petri net

    The set of places of the petri net

    returns

    The set of places

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

    Permalink
    Definition Classes
    AnyRef

  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  28. val transitions: Set[T]

    Permalink

    The set of transitions of the petri net

    The set of transitions of the petri net

    returns

    The set of transitions.

  29. final def wait(): Unit

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

  30. final def wait(arg0: Long, arg1: Int): Unit

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

  31. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped