P. Baldan, A. Corradini, H. Ehrig, and R. Heckel, Compositional modeling of reactive systems using open nets, International Conference on Concurrency Theory, pp.502-518, 2001.

F. Bonchi and U. Montanari, Minimization algorithm for symbolic bisimilarity, European Symposium on Programming, pp.267-284, 2009.

J. Borgström, S. Briais, and U. Nestmann, Symbolic bisimulation in the spi calculus, International Conference on Concurrency Theory, pp.161-176, 2004.

G. Maria, U. Buscemi, and . Montanari, Open bisimulation for the concurrent constraint pi-calculus, European Symposium on Programming, pp.254-268, 2008.

M. Calder and C. Shankland, A symbolic semantics and bisimulation for full LOTOS, International Conference on Formal Techniques for Networked and Distributed Systems, pp.185-200, 2001.

L. De-moura and N. Bjørner, Z3: An efficient SMT solver, International conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.337-340, 2008.

S. Delaune, S. Kremer, and M. Ryan, Symbolic bisimulation for the applied pi calculus, International Conference on Foundations of Software Technology and Theoretical Computer Science, pp.133-145, 2007.

A. Dovier, R. Gentilini, C. Piazza, and A. Policriti, Rank-based symbolic bisimulation:(and model checking), 2002.

, Electronic Notes in Theoretical Computer Science, vol.67, pp.166-183, 2002.

L. Dâ??antoni and M. Veanes, Forward bisimulations for nondeterministic symbolic finite automata, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.518-534, 2017.

Y. Feng, Y. Deng, and M. Ying, Symbolic bisimulation for quantum processes, ACM Transactions on Computational Logic (TOCL), vol.15, p.14, 2014.

L. Henrio, E. Madelaine, and M. Zhang, pnets: An expressive model for parameterised networks of processes, 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, pp.492-496, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01139432

L. Henrio, E. Madelaine, and M. Zhang, A Theory for the Composition of Concurrent Processes, 36th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE) (Formal Techniques for Distributed Objects, Components, and Systems), p.9688, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01432917

G. Heraklion, , pp.175-194

Z. Hou, E. Madelaine, and J. Liu, Symbolic Bisimulation for Open and Parameterized Systems -Extended version, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02376147

H. Lin, Symbolic transition graphs with assignment, International Conference on Concurrency Theory, pp.50-65, 1996.

H. Lin, â??On-the-fly instantiationâ?? of value-passing processes, Formal Description Techniques and Protocol Specification, Testing and Verification, pp.215-230, 1998.

J. Liu and H. Lin, A complete symbolic bisimulation for full applied pi calculus, International Conference on Current Trends in Theory and Practice of Computer Science, pp.552-563, 2010.

R. Paige and . Robert-e-tarjan, Three partition refinement algorithms, SIAM J. Comput, vol.16, pp.973-989, 1987.

R. Wimmer, M. Herbstritt, H. Hermanns, K. Strampp, and B. Becker, Sigref-a symbolic bisimulation tool box, International Symposium on Automated Technology for Verification and Analysis, pp.477-492, 2006.