1. Branching bisimilarity is an equivalence indeed!;Basten;Information Processing Letters,1996
2. Verification of infinite structures;Burkart,2001
3. Christensen, S., “Decidability and Decomposition in process algebras,” Ph.D. thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)
4. Petri nets, commutative context-free grammars, and basic parallel processes;Esparza;Fundamenta Informaticae,1997
5. Bisimulation trees and the decidability of weak bisimulations;Hirshfeld;Electr. Notes Theor. Comput. Sci.,1996