T. Basten, Branching bisimilarity is an equivalence indeed!, Information Processing Letters, vol.58, issue.3, pp.141-147, 1996.
DOI : 10.1016/0020-0190(96)00034-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7366

S. C. Blom, W. J. Fokkink, J. F. Groote, I. Van-langevelde, B. Lisser et al., ??CRL: A Toolset for Analysing Algebraic Specifications, Proc. CAV'01, pp.250-254, 2001.
DOI : 10.1007/3-540-44585-4_23

P. E. Bulychev, I. V. Konnov, and V. A. Zakharov, Computing (bi)simulation relations preserving CTL*-X for ordinary and fair Kripke structures, Inst. for Syst. Progr., Russian Acad. of Sci., Math. Meth. and Algor, vol.12, 2007.

S. Cranen, J. F. Groote, J. J. Keiren, F. P. Stappers, E. P. De-vink et al., An Overview of the mCRL2 Toolset and Its Recent Advances, Proc. TACAS'13, pp.199-213, 2013.
DOI : 10.1007/978-3-642-36742-7_15

H. Garavel, F. Lang, R. Mateescu, and W. Serwe, CADP 2011: a toolbox for the construction and analysis of distributed processes, International Journal on Software Tools for Technology Transfer, vol.1, issue.1/2, pp.89-107, 2013.
DOI : 10.1007/s10009-012-0244-z
URL : https://hal.archives-ouvertes.fr/hal-00715056

R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A partial order approach to branching time logic model checking, Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp.132-152, 1999.
DOI : 10.1109/ISTCS.1995.377038
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5275

J. F. Groote and F. W. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, ICALP'90, pp.626-638, 1990.
DOI : 10.1007/BFb0032063
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.1834

J. F. Groote and A. Wijs, An $$O(m\log n)$$ Algorithm for Stuttering Equivalence and Branching Bisimulation, Proc. TACAS'16, pp.607-624, 2016.
DOI : 10.1007/978-3-662-49674-9_40
URL : http://arxiv.org/abs/1601.01478

M. Hennessy and R. Milner, On observing nondeterminism and concurrency, Proc. ICALP'80, pp.299-309, 1980.
DOI : 10.1007/3-540-10003-2_79

H. Korver, Computing distinguishing formulas for branching bisimulation, Proc. CAV'92, pp.13-23, 1992.
DOI : 10.1007/3-540-55179-4_3

K. S. Namjoshi, A simple characterization of stuttering bisimulation, Proc. FSTTCS'97, pp.284-296, 1997.
DOI : 10.1007/BFb0058037

D. Park, Concurrency and automata on infinite sequences, Proc. TCS'81, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

M. A. Reniers, R. Schoren, and T. A. Willemse, Results on Embeddings Between State-Based and Event-Based Systems, The Computer Journal, vol.57, issue.1, pp.73-92, 2014.
DOI : 10.1093/comjnl/bxs156
URL : http://comjnl.oxfordjournals.org/cgi/content/short/bxs156v1

P. Stevens and C. Stirling, Practical model-checking using games, Proc. TACAS'98, pp.85-101, 1998.
DOI : 10.1007/BFb0054166
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.5200

C. Stirling, Modal and temporal logics for processes. Logics for concurrency: structure versus automata, pp.149-237, 1996.
DOI : 10.1007/3-540-60915-6_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.9078

W. Thomas, On the Ehrenfeucht-Fra¨?sséFra¨?ssé game in theoretical computer science, Proc. TAPSOFT'93, pp.559-568, 1993.

R. J. Van-glabbeek, S. P. Luttik, and N. Trçka, Branching bisimilarity with explicit divergence, Fundam. Inform, vol.93, issue.4, pp.371-392, 2009.

R. J. Van-glabbeek and W. P. Weijland, Branching time and abstraction in bisimulation semantics, Journal of the ACM, vol.43, issue.3, pp.555-600, 1996.
DOI : 10.1145/233551.233556

Q. Yin, Y. Fu, C. He, M. Huang, and X. Tao, Branching Bisimilarity Checking for PRS, Proc. ICALP'14, pp.363-374, 2014.
DOI : 10.1007/978-3-662-43951-7_31
URL : http://arxiv.org/abs/1402.0050