Class Placings<S extends AbstractEcoreSignature<? extends Control<?,?>>>

java.lang.Object
org.bigraphs.framework.core.impl.elementary.Placings<S>
All Implemented Interfaces:
Serializable

public class Placings<S extends AbstractEcoreSignature<? extends Control<?,?>>> extends Object implements Serializable
A placing is a node-free bigraph. The three elementary placing exist:
  • A barren root: 1
  • join
  • gammam,n

By that a special placing called merge_m: m -> 1 can be derived and is implemented here for convenience. merge_0 = 1, merge_1 = id_1, merge_2 = join, hence, merge_{m+1} = join o (id_1 + merge_m).

See Also:
  • Constructor Details

    • Placings

      public Placings(SignatureBuilder signatureBuilder)
      Parameters:
      signatureBuilder - to create an empty signature of the appropriate type for working with user-defined bigraphs of the same type created with the same factory
    • Placings

      public Placings(S signature)
    • Placings

      public Placings(S signature, EMetaModelData metaModelData)
    • Placings

      public Placings(S signature, org.eclipse.emf.ecore.EPackage bigraphMetaModel)
  • Method Details

    • barren

      public Placings<S>.Barren barren()
    • identity1

      public Placings<S>.Identity1 identity1()
    • symmetry11

      public Placings<S>.Symmetry symmetry11()
    • symmetry

      public Placings<S>.Symmetry symmetry(int n)
    • merge

      public Placings<S>.Merge merge(int m)
    • join

      public Placings<S>.Join join()
    • permutation

      public Placings<S>.Permutation permutation(int n)
      Create a bijection from sites to roots, similar to an identity place graph. Each site will be mapped exactly to one root where the indices match.
      Parameters:
      n - number of sites/roots that are mapped to each other: n_i -> n_i, i in 0...n-1
      Returns:
      an "equally distributed permutation"
    • getLoadedModelPackage

      public org.eclipse.emf.ecore.EPackage getLoadedModelPackage()