Higher-level synchronising devices in Meije-SCCS, Theoretical Computer Science, vol.37, pp.245-267, 1985. ,
DOI : 10.1016/0304-3975(85)90093-3
A context dependent equivalence between processes, Theoretical Computer Science, vol.49, pp.184-215, 1987. ,
Symbolic bisimulations, Theoretical Computer Science, vol.138, issue.2, pp.353-389, 1995. ,
DOI : 10.1016/0304-3975(94)00172-F
Symbolic transition graph with assignment, Concur'96, pp.50-65, 1996. ,
DOI : 10.1007/3-540-61604-7_47
Bisimulations for a calculus of broadcasting systems, Theoretical Computer Science, vol.200, issue.1-2, pp.225-260, 1998. ,
DOI : 10.1016/S0304-3975(97)00261-2
Synchronised behaviours of processes and rational relations, Acta Informatica, vol.17, pp.21-29, 1982. ,
pNets: An Expressive Model for Parameterised Networks of Processes, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing ,
DOI : 10.1109/PDP.2015.70
URL : https://hal.archives-ouvertes.fr/hal-01139432
Specification and Verification for Grid Component-Based Applications: From Models to Tools, Number 5751 in LNCS, 2008. ,
DOI : 10.1007/11589976_6
Integrated Environment for Verifying and??Running Distributed Components, of the 19th Int. Conf. on Fundamental Approaches to Software Engineering (FASE'16), 2016. ,
DOI : 10.1007/978-3-642-35743-5_17
URL : https://hal.archives-ouvertes.fr/hal-01303557
Bisimilarity of open terms, Expressiveness in Languages for Concurrency, 1997. ,
Algorithm for verifying strong open bisimulation in ? calculus, Journal of Shanghai Jiaotong University, vol.2, pp.147-152, 2001. ,
Symbolic model checking of infinite state systems using presburger arithmetic, LNCS, vol.1254, issue.11, pp.400-411, 1997. ,
DOI : 10.1007/3-540-63166-6_39
Verifying parameterized networks, ACM Transactions on Programming Languages and Systems, vol.19, issue.5, pp.726-750, 1997. ,
DOI : 10.1145/265943.265960
Communication and Concurrency. Int. Series in Computer Science, 1989. ,