A General Approach to Deadlock Freedom Verification for Software Architectures, FME, vol.2805, pp.658-677, 2003. ,
DOI : 10.1007/978-3-540-45236-2_36
Synthesis of large concurrent programs via pairwise composition, CONCUR'99, number 1664 in LNCS, 1999. ,
Efficiently Verifiable Conditions for Deadlockfreedom of Large Concurrent Programs, VMCAI, France, 2005. ,
Synthesis of Concurrent Systems with Many Similar Processes, TOPLAS, vol.20, issue.1, pp.51-115, 1998. ,
Fairness and hyperfairness in multi-party interactions, Distributed Computing, vol.13, issue.8, pp.245-254, 1993. ,
DOI : 10.1007/BF02242712
Modeling Heterogeneous Realtime Components in BIP, In SEFM, pp.3-12, 2006. ,
DOI : 10.1109/sefm.2006.27
URL : https://hal.archives-ouvertes.fr/hal-00375298
Compositional verification for component-based systems and application, pp.181-193, 2010. ,
DOI : 10.1049/iet-sen.2009.0011
URL : https://hal.archives-ouvertes.fr/hal-00568866
D-Finder 2: Towards Efficient Correctness of Incremental Design, NASA Formal Methods, pp.453-458, 2011. ,
DOI : 10.1109/MS.1985.230351
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.6953
From high-level component-based models to distributed implementations, Proceedings of the tenth ACM international conference on Embedded software, EMSOFT '10, pp.209-218, 2010. ,
DOI : 10.1145/1879021.1879049
URL : https://hal.archives-ouvertes.fr/hal-00557792
Modeling Dynamic Architectures Using Dy-BIP, Software Composition, pp.1-16, 2012. ,
DOI : 10.1007/978-3-642-30564-1_1
URL : https://hal.archives-ouvertes.fr/hal-00722481
Deadlock analysis in networks of communicating processes, Distributed Computing, vol.75, issue.3, pp.209-230, 1991. ,
DOI : 10.1007/BF01784721
Component-Based Construction of Deadlock-Free Systems, FSTTCS, pp.420-433, 2003. ,
DOI : 10.1007/978-3-540-24597-1_36
Debugging Ada tasking programs. Software, IEEE, vol.2, issue.2, pp.47-57, 1985. ,
DOI : 10.1109/ms.1985.230351
Deadlock-freedom in component systems with architectural constraints. FMSD, pp.129-177, 2012. ,
DOI : 10.1007/s10703-012-0160-6
Computational complexity, 1994. ,