Implementation of Algorithms for Bisimulation Equivalence

In this thesis, I describe three algorithms, and their implementation using the Scala programming language, for computing strong bisimulation equivalence on finite labeled transition systems. Moreover, I introduce the BPP nets, a sublclass of finite Place/transitions Petri nets, and a bisimulation-based, behavioral equivalence for BPP nets, called team bisimulation equivalence. I have also implemented two algorithms for computing the team bisimulation equivalence on BPP nets.