Class BreadthFirstSimulationStrategy<B extends Bigraph<? extends Signature<?>>>

java.lang.Object
org.bigraphs.framework.simulation.modelchecking.ModelCheckingStrategySupport<B>
org.bigraphs.framework.simulation.modelchecking.BreadthFirstSimulationStrategy<B>
All Implemented Interfaces:
ModelCheckingStrategy<B>

@Deprecated public class BreadthFirstSimulationStrategy<B extends Bigraph<? extends Signature<?>>> extends ModelCheckingStrategySupport<B>
Deprecated.
The algorithm implemented here is a variant of the BreadthFirstSimulationStrategy without cycle checking. Thus, graph isomorphism checks are not conducted.

Leads to higher state-spaces than BFS with cycle checking but less expensive because canonical label is not computed.

Author:
Dominik Grzelak
  • Constructor Details

    • BreadthFirstSimulationStrategy

      public BreadthFirstSimulationStrategy(BigraphModelChecker<B> modelChecker)
      Deprecated.
  • Method Details

    • synthesizeTransitionSystem

      public void synthesizeTransitionSystem()
      Deprecated.
      Compute the transition system of a bigraph with all added reaction rules so far.