On-the-fly analysis of systems with unbounded, lossy FIFO channels, Proc. CAV'98, pp.305-318, 1998. ,
DOI : 10.1007/BFb0028754
Choreography conformance via synchronizability, Proceedings of the 20th international conference on World wide web, WWW '11, pp.795-804, 2011. ,
DOI : 10.1145/1963405.1963516
Deciding Choreography Realizability, Proc. of POPL'12, pp.191-202, 2012. ,
DOI : 10.1145/2103656.2103680
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6722
Interface Theories for (A)synchronously Communicating Modal I/O-Transition Systems, Proc. of FIT'10, pp.1-8, 2010. ,
DOI : 10.4204/EPTCS.46.1
On Weak Modal Compatibility, Refinement, and the MIO Workbench, Proc. of TACAS'10, pp.175-189, 2010. ,
DOI : 10.1007/978-3-642-12002-2_15
Web service interfaces, Proceedings of the 14th international conference on World Wide Web , WWW '05, pp.148-159, 2005. ,
DOI : 10.1145/1060745.1060770
Interface decomposition for service compositions, Proceeding of the 33rd international conference on Software engineering, ICSE '11, pp.501-510, 2011. ,
DOI : 10.1145/1985793.1985862
When are Two Web Services Compatible?, Proc. of TES'04, pp.15-28, 2004. ,
DOI : 10.1007/978-3-540-31811-8_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.464.6884
Bounded Phase Analysis of Message-Passing Programs, Proc. of TACAS'12, pp.451-465, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00653085
On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983. ,
DOI : 10.1145/322374.322380
Testing Service Composition, Proc. of ASSE'07, 2007. ,
Compatibility and inheritance in software architectures, Science of Computer Programming, vol.41, issue.2, pp.105-138, 2001. ,
DOI : 10.1016/S0167-6423(01)00002-8
Quasi-Static Scheduling of Communicating Tasks, Proc. CONCUR'08, pp.310-324, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00591759
Interface Automata, Proc. of ESEC/FSE'01, pp.109-120, 2001. ,
Buffered Communication Analysis in Distributed Multiparty Sessions, Proc. CONCUR'10, pp.343-357, 2010. ,
DOI : 10.1007/978-3-642-15375-4_24
A generic framework for <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>n</mml:mi></mml:math>-protocol compatibility checking, Science of Computer Programming, vol.77, issue.7-8, pp.870-886, 2012. ,
DOI : 10.1016/j.scico.2011.03.009
Compatibility verification for Web service choreography, Proceedings. IEEE International Conference on Web Services, 2004., 2004. ,
DOI : 10.1109/ICWS.2004.1314806
CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes, Proc. of TACAS'11, pp.372-387, 2011. ,
DOI : 10.1007/BFb0054166
URL : https://hal.archives-ouvertes.fr/inria-00583776
An efficient algorithm for branching bisimulation and stuttering equivalence, Proc. of ICALP'90, pp.626-638, 1990. ,
DOI : 10.1007/BFb0032063
Counterexample Guided Synthesis of Monitors for Realizability Enforcement, Proc. of ATVA'12, pp.238-253, 2012. ,
DOI : 10.1007/978-3-642-33386-6_20
Channel Properties of Asynchronously Composed Petri Nets, Proc. of Petri Nets 2013, pp.369-388, 2013. ,
DOI : 10.1007/978-3-642-38697-8_20
URL : https://hal.archives-ouvertes.fr/hal-00926200
LOTOS ? A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, International Standard, vol.8807, 1989. ,
Testing for unboundedness of fifo channels, Theoretical Computer Science, vol.113, issue.1, pp.93-117, 1993. ,
DOI : 10.1016/0304-3975(93)90212-C
Set Algebra for Service Behavior: Applications and Constructions, Proc. of BPM'09, pp.193-210, 2009. ,
DOI : 10.1109/TC.1986.1676819
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models, Proc. SPIN'04, pp.216-233, 2004. ,
DOI : 10.1007/978-3-540-24732-6_16
Why Does My Service Have No Partners?, Proc. of WS-FM'08, pp.191-206, 2008. ,
DOI : 10.1016/j.datak.2007.06.006
Analyzing Compatibility of BPEL Processes, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06), pp.147-156, 2006. ,
DOI : 10.1109/AICT-ICIW.2006.48
A Model Checking Language for Concurrent Value-Passing Systems, Proc. of FM'08, 2008. ,
DOI : 10.1007/978-3-540-68237-0_12
URL : https://hal.archives-ouvertes.fr/inria-00315312
Describing and reasoning on Web services using process algebra, Proceedings. IEEE International Conference on Web Services, 2004., pp.116-128, 2006. ,
DOI : 10.1109/ICWS.2004.1314722
Service Interaction: Patterns, Formalization, and Analysis, Proc. of SFM'09, pp.42-88, 2009. ,
DOI : 10.1007/978-3-642-01918-0_2
Branching time and abstraction in bisimulation semantics, Journal of the ACM, vol.43, issue.3, pp.555-600, 1996. ,
DOI : 10.1145/233551.233556
Verifying Business Process Compatibility, Proc. of QSIC'08, pp.126-131, 2008. ,
Protocol specifications and component adaptors, ACM Transactions on Programming Languages and Systems, vol.19, issue.2, pp.292-333, 1997. ,
DOI : 10.1145/244795.244801