Package org.bigraphs.framework.simulation.equivalence

Class StrongBisimulationMixinImpl<R extends AbstractTransitionSystem<Bigraph<? extends Signature<?>>>>

java.lang.Object
org.bigraphs.framework.simulation.equivalence.StrongBisimulationMixinImpl<R>
Type Parameters:
R - type of the transition system
All Implemented Interfaces:
BehavioralEquivalenceMixin<R>
public class StrongBisimulationMixinImpl<R extends AbstractTransitionSystem<Bigraph<? extends Signature<?>>>> extends Object implements BehavioralEquivalenceMixin<R>
This class provides the implementation of the interface BehavioralEquivalenceMixin for the bisimulation equivalence relation. It's a mixin implementation essentially providing the implementation of isEquivalentTo(AbstractTransitionSystem). "Wrapper" classes of implementations of AbstractTransitionSystem can introduce this new behavior via this mixin.

Bisimulation is an equivalence between two systems, which 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.

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"