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). Volume LNCS-9688 of Formal Techniques for Distributed Objects, Components, and Systems, pp.175-194, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01432917

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.

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.

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.

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

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.

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

R. Paige and R. E. Tarjan, Three partition refinement algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.

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

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.