Package org.bigraphs.framework.simulation.equivalence

Class StrongBisimulationMixinImpl<B extends Bigraph<? extends Signature<?>>,AST extends ReactionGraph<B>>

java.lang.Object
org.bigraphs.framework.simulation.equivalence.StrongBisimulationMixinImpl<B,AST>
Type Parameters:
B - type of the states of AST
AST - type of the transition system (states are bigraphs of type B, transition of type BMatchResult)
All Implemented Interfaces:
BehavioralEquivalenceMixin<AST>
public class StrongBisimulationMixinImpl<B extends Bigraph<? extends Signature<?>>,AST extends ReactionGraph<B>> extends Object implements BehavioralEquivalenceMixin<AST>
Mixin Infrastructure-related class.

This class provides the implementation of the interface BehavioralEquivalenceMixin for the bisimulation equivalence checking routine. It's a mixin implementation essentially providing the implementation of isEquivalentTo(AST). Via this mixin this new behavior can be introduced into specific sub-classes of AbstractTransitionSystem by extending them like a "wrapper" and adding the new method isEquivalentTo(AST).

Checking bisimulation between two systems states "that whatever series of visible actions one LTS may perform, the other may match." [1] Bisimilar systems have equal behavior, thus, can be replaced with each other.

Strong: All actions are visible.

This mixin implementation delegates the computation to the BisimulationCheckerSupport class, which contains several algorithms.

Author:
Dominik Grzelak
See Also:
  • "[1] [DaKT07] Danos, Vincent; Krivine, Jean; Tarissan, Fabien: Self-assembling Trees. In: Electronic Notes in Theoretical Computer Science, Proceedings of the Third Workshop on Structural Operational Semantics (SOS 2006). Bd. 175 (2007), Nr. 1, S. 19–32"