R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, Alternating refinement relations, Proceedings of CONCUR'98, pp.163-178, 1998.
DOI : 10.1007/BFb0055622

F. Arbab, Reo: a channel-based coordination model for component composition, Mathematical Structures in Computer Science, vol.14, issue.3, 2004.
DOI : 10.1017/S0960129504004153

R. Bagrodia, Synchronization of asynchronous processes in CSP, ACM Transactions on Programming Languages and Systems, vol.11, issue.4
DOI : 10.1145/69558.69561

A. Basu, P. Bidinger, M. Bozga, and J. Sifakis, Distributed Semantics and Implementation for Systems with Interaction and Priority, Proceedings of FORTE'08, pp.116-133, 2008.
DOI : 10.1007/978-3-540-30101-1_15
URL : https://hal.archives-ouvertes.fr/hal-00359261

M. Bensalem, S. Bozga, D. Graf, S. Peled, and . Quinton, Methods for Knowledge Based Controlling of Distributed Systems, Proceedings of ATVA'10, pp.52-66, 2010.
DOI : 10.1007/978-3-642-15643-4_6
URL : https://hal.archives-ouvertes.fr/hal-00557799

M. Bonakdarpour, M. Bozga, J. Jaber, J. Quilbeuf, and . Sifakis, Automated conflict-free distributed implementation of component-based models, International Symposium on Industrial Embedded System (SIES)
DOI : 10.1109/SIES.2010.5551377
URL : https://hal.archives-ouvertes.fr/hal-00558046

M. Bbj-+-b-]-borzoo-bonakdarpour, M. Bozga, J. Jaber, J. Quilbeuf, and . Sifakis, From high-level component-based models to distributed implementations

[. Bensalem, M. Bozga, T. Nguyen, and J. Sifakis, D-Finder: A Tool for Compositional Deadlock Detection and Verification, Proceedings of CAV'09, pp.614-619, 2009.
DOI : 10.1007/978-3-642-02658-4_45
URL : https://hal.archives-ouvertes.fr/hal-00722550

A. Basu, S. Bensalem, D. Peled, and J. Sifakis, Priority scheduling of distributed systems based on model checking, Proceedings of CAV'09, pp.79-93, 2009.

A. Basu, M. Bozga, and J. Sifakis, Modeling Heterogeneous Real-time Components in BIP, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06), pp.3-12, 2006.
DOI : 10.1109/SEFM.2006.27
URL : https://hal.archives-ouvertes.fr/hal-00375298

[. Bensalem, M. Bozga, J. Sifakis, and T. Nguyen, Compositional verification for component-based systems and application, Proceedings of ATVA'08, pp.64-79, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00568866

A. Benveniste, B. Caillaud, A. Ferrari, L. Mangeruca, R. Passerone et al., Multiple Viewpoint Contract-Based Specification and Design, Proceedings of FMCO'07, pp.200-225, 2007.
DOI : 10.1109/43.736561

[. Beyer, A. Chakrabarti, and T. A. Henzinger, Web service interfaces, Proceedings of the 14th international conference on World Wide Web , WWW '05, pp.148-159, 2005.
DOI : 10.1145/1060745.1060770

A. Benveniste, B. Caillaud, and R. Passerone, A generic model of contracts for embedded systems, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00153477

A. Benvenuti, L. Ferrari, E. Mangeruca, R. Mazzi, C. Passerone et al., A contract-based formalism for the specification of heterogeneous systems, 2008 Forum on Specification, Verification and Design Languages, pp.142-147, 2008.
DOI : 10.1109/FDL.2008.4641436

A. Benveniste, P. L. Guernic, and C. Jacquemot, Synchronous programming with events and relations: the SIGNAL language and its semantics, Science of Computer Programming, vol.16, issue.2, pp.103-149, 1991.
DOI : 10.1016/0167-6423(91)90001-E

[. Bensalem, S. Graf, and Y. Lakhnech, Abstraction as the Key for Invariant Verification, Verification: Theory and Practice, pp.67-99, 2003.
DOI : 10.1007/978-3-540-39910-0_4

M. Bozga, S. Graf, and I. Ober, Iulian Ober, and Joseph Sifakis. The IF toolset, Proceedings of SFM'04, pp.237-267, 2004.

[. Barringer, D. Giannakopoulou, and C. S. Pasareanu, Proof rules for automated compositional verification, Proceedings of ESEC/FSE'03, 2003.

I. Ben-hafaiedh, S. Graf, and S. Quinton, Building Distributed Controllers for Systems with Priorities, The Journal of Logic and Algebraic Programming, vol.80, issue.3-5, 2010.
DOI : 10.1016/j.jlap.2010.10.001

I. Ben-hafaiedh, S. Quinton, and S. Graf, A contract approach for reasoning about progress: Application to resource-sharing in a network, 2010.

I. Ben-hafaiedh, S. Quinton, and S. Graf, A contract framework for reasoning about safety and progress, 2010.

I. Ben-hafaiedh, S. Quinton, and S. Graf, Reasoning about Safety and Progress Using Contracts, 2010.
DOI : 10.1007/978-3-642-16901-4_29

[. Beyer, T. A. Henzinger, and V. Singh, Algorithms for Interface Synthesis, Proceedings of CAV'07, pp.4-19, 2007.
DOI : 10.1007/978-3-540-73368-3_4

[. Bozga, M. Jaber, and J. Sifakis, Source-to-source architecture transformation for performance optimization in BIP, SIES, pp.152-160, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00722520

[. Bloom, Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages, 1993.

[. Bensalem, Y. Lakhnech, and S. Owre, Computing abstractions of infinite state systems compositionally and automatically, Proceedings of CAV'98, pp.319-331, 1998.
DOI : 10.1007/BFb0028755

S. Robert, J. Boyer, and . Strother-moore, A computational logic, 1979.

T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani, Automatic predicate abstraction of C programs, Proceedings of PLDI'01, pp.203-213, 2001.

N. Gael, A. Buckley, and . Silberschatz, An effective implementation for the generalized input-output construct of CSP, ACM Trans. Program. Lang. Syst, vol.5, issue.2, pp.223-235, 1983.

P. Bidinger and J. Stefani, The Kell Calculus: Operational Semantics and Type System, Proc. of FMOODS'03, 2003.
DOI : 10.1007/3-540-47959-7_3

S. Bliudze and J. Sifakis, The Algebra of Connectors—Structuring Interaction in BIP, IEEE Transactions on Computers, vol.57, issue.10, pp.1315-1330, 2008.
DOI : 10.1109/TC.2008.26

S. Bliudze and J. Sifakis, A notion of glue expressiveness for componentbased systems, Proceedings of CONCUR'08, pp.508-522, 2008.

M. Bravetti and G. Zavattaro, Towards a Unifying Theory for Choreography Conformance and Contract Compliance, Software Composition, pp.34-50, 2007.
DOI : 10.1007/978-3-540-77351-1_4

M. Jamieson, G. S. Cobleigh, L. A. Avrunin, and . Clarke, Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning, ACM Trans. Softw. Eng. Methodol, vol.17, issue.2, pp.1-52, 2008.

E. M. Chen, A. Clarke, M. Farzan, Y. Tsai, B. Tsay et al., Automated assume-guarantee reasoning through implicit learning Automated assume-guarantee reasoning for simulation conformance, Proceedings of CAV'10 Proceedings of CAV'05, pp.511-526, 2005.

A. Chakrabarti, T. A. Luca-de-alfaro, M. Henzinger, and . Stoelinga, Resource Interfaces, Proceedings of EMSOFT'03, pp.117-133, 2003.
DOI : 10.1007/978-3-540-45212-6_9

E. M. Clarke and E. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, Proceedings of Logic of Pro- grams'82, pp.52-71, 1981.

E. M. Clarke, O. Grumberg, and D. E. Long, Model checking and abstraction, ACM Transactions on Programming Languages and Systems, vol.16, issue.5, pp.1512-1542, 1994.
DOI : 10.1145/186025.186051

E. M. Clarke, Orna Grumberg, and Doron Peled. Model Checking, 2000.

M. Jamieson, D. Cobleigh, C. S. Giannakopoulou, and . Pasareanu, Learning assumptions for compositional verification, Proceedings of TACAS'03, pp.331-346, 2003.

G. Castagna, N. Gesbert, and L. Padovani, A theory of contracts for web services, Proceedings of POPL'08, pp.261-272, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00152547

[. Chatterjee and T. A. Henzinger, Assume-Guarantee Synthesis, Proceedings of TACAS'07, pp.261-275, 2007.
DOI : 10.1007/978-3-540-71209-1_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.625.9279

E. M. Clarke, D. E. Long, and K. L. Mcmillan, Compositional model checking, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, pp.353-362, 1989.
DOI : 10.1109/LICS.1989.39190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.7245

F. Pablo, T. S. Castro, and . Maibaum, A complete and compact propositional deontic logic, Proceedings of ICTAC'07, pp.109-123, 2007.

P. Caspi, D. Pilaud, N. Halbwachs, and J. Plaice, Lustre: A declarative language for programming synchronous systems, Proceedings of POPL'87, pp.178-188, 1987.

T. A. Luca-de-alfaro and . Henzinger, Interface automata, ESEC / SIGSOFT FSE, pp.109-120, 2001.

T. A. Luca-de-alfaro and . Henzinger, Interface theories for component-based design [dAH05] Luca de Alfaro and Thomas Henzinger. Interface-based design, Proceedings of EMSOFT'01 Engineering Theories of Software-intensive Systems NATO Science Series: Mathematics, Physics, and Chemistry, pp.148-165, 2001.

T. A. Luca-de-alfaro, F. Y. Henzinger, and . Mang, Detecting Errors Before Reaching Them, Proceedings of CAV'00dAHS02] Luca de Alfaro, Thomas A. Henzinger, and Mariëlle Stoelinga. Timed interfaces Proceedings of EMSOFT'02, pp.186-201, 2000.
DOI : 10.1007/10722167_17

W. Damm, Controlling Speculative Design Processes Using Rich Component Models, Fifth International Conference on Application of Concurrency to System Design (ACSD'05), pp.118-119, 2005.
DOI : 10.1109/ACSD.2005.35

A. Kumar-datta, S. Devismes, F. Horn, and L. L. Larmore, Selfstabilizing k-out-of-exclusion on tree networks, Proceedings of IPDPS'09, pp.1-8, 2009.

L. Doyen, T. A. Henzinger, B. Jobstmann, and T. Petrov, Interface theories with component reuse, Proceedings of the 7th ACM international conference on Embedded software, EMSOFT '08, pp.79-88
DOI : 10.1145/1450058.1450070

W. P. De-roever, F. S. De-boer, U. Hannemann, J. Hooman, and Y. Lakhnech, Concurrency Verification: Introduction to Compositional and Noncompositional Methods, volume 54 of Cambridge Tracts in Theoretical Computer Science, Mannes Poel, and Job Zwiers, 2001.

[. Emerson and E. M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, Proceedings of ICALP', pp.169-181, 1980.
DOI : 10.1007/3-540-10003-2_69

J. Eker, J. W. Janneck, E. A. Lee, J. Liu, X. Liu et al., Taming heterogeneity - the Ptolemy approach, Proceedings of the IEEE, pp.127-144, 2003.
DOI : 10.1109/JPROC.2002.805829

R. Fagin, J. Y. Halpern, M. Y. Vardi, and Y. Moses, Reasoning about knowledge, 1995.

G. Gößler, S. Graf, M. E. Majster-cederbaum, M. Martens, and J. Sifakis, Ensuring Properties of Interaction Systems, Program Analysis and Compilation, pp.201-224, 2006.
DOI : 10.1007/978-3-540-71322-7_10

J. Hartmann, K. Genrich, and . Lautenbach, System modelling with high-level petri nets, Theor. Comput. Sci, vol.13, pp.109-136, 1981.

[. Grumberg and D. E. Long, Model checking and modular verification, Proceedings of CONCUR'95, pp.250-265, 1991.

A. Girault, B. Lee, and E. A. Lee, Hierarchical finite state machines with multiple concurrency models, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.18, issue.6, pp.742-760, 1999.
DOI : 10.1109/43.766725

A. Gupta, K. L. Mcmillan, and Z. Fu, Automated assumption generation for compositional verification, Proceedings of CAV'07, pp.420-432, 2007.

[. Giannakopoulou, C. S. Pasareanu, and H. Barringer, Component Verification with Automatically Generated Assumptions, Automated Software Engineering, vol.9, issue.2, pp.297-320, 2005.
DOI : 10.1007/s10515-005-2641-y

[. Giannakopoulou, C. S. Pasareanu, and J. M. Cobleigh, Assumeguarantee verification of source code with design-level assumptions, Proceedings of ICSE'04, pp.211-220, 2004.

S. Graf, D. Peled, and S. Quinton, Achieving distributed control through model checking, Proceedings of CAV'10, pp.396-409, 2010.

S. Graf and S. Quinton, Contracts for BIP: Hierarchical Interaction Models for Compositional Verification, Proceedings of FORTE'07, pp.1-18, 2007.
DOI : 10.1007/978-3-540-73196-2_1

[. Grumberg, Abstraction and Refinement in Model Checking, Proceedings of
DOI : 10.1007/11804192_11

S. Graf and H. Saïdi, Construction of abstract state graphs with PVS, Proceedings of CAV'97, pp.72-83, 1997.
DOI : 10.1007/3-540-63166-6_10

G. Gößler and J. Sifakis, Component-Based Construction of Deadlock-Free Systems, Proceedings of FSTTCS'03, pp.420-433, 2003.
DOI : 10.1007/978-3-540-24597-1_36

G. Gößler and J. Sifakis, Priority Systems, Proceedings of FMCO'03, pp.314-329, 2003.
DOI : 10.1145/353323.353382

G. Gößler and J. Sifakis, Composition for component-based modeling

S. Graf, B. Steffen, and G. Lüttgen, Compositional minimisation of finite state systems using interface specifications, Formal Aspects of Computing, vol.17, issue.5, pp.607-616, 1996.
DOI : 10.1007/BF01211911

M. Huth, R. Jagadeesan, and D. A. Schmidt, Modal Transition Systems: A Foundation for Three-Valued Program Analysis, Proceedings of ESOP'01, pp.155-169, 2001.
DOI : 10.1007/3-540-45309-1_11

Y. Joseph, Y. Halpern, and . Moses, A guide to completeness and complexity for modal logics of knowledge and belief, Hoa85] C. A. R. Hoare. Communicating Sequential Processes, pp.319-379, 1985.

A. Thomas, S. Henzinger, S. K. Qadeer, and . Rajamani, Decomposing refinement proofs using assume-guarantee reasoning, Proceedings of ICCAD'00, pp.245-252, 2000.

A. Thomas, S. Henzinger, S. K. Qadeer, S. Rajamani, and . Tasiran, An assume-guarantee rule for checking simulation, Proceedings of FMCAD'98, pp.421-432, 1998.

A. Thomas, J. Henzinger, and . Sifakis, The discipline of embedded systems design, IEEE Computer, vol.40, issue.10, pp.32-40, 2007.

E. John, J. D. Hopcroft, and . Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

Y. Joseph, L. D. Halpern, and . Zuck, A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols, J. ACM, vol.39, issue.3, pp.449-478, 1992.

C. B. Jones, Tentative steps toward a development method for interfering programs, ACM Transactions on Programming Languages and Systems, vol.5, issue.4
DOI : 10.1145/69575.69577

G. Katz and D. Peled, Code Mutation in Verification and Automatic Code Correction, Proceedings of TACAS'10, pp.435-450, 2010.
DOI : 10.1007/978-3-642-12002-2_36

[. Larsen, Modal specifications In Automatic Verification Methods for Finite State Systems, LNCS, vol.407, pp.232-246, 1989.

C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem, Property preserving abstractions for the verification of concurrent systems, Formal Methods in System Design, vol.55, issue.1, pp.11-44, 1995.
DOI : 10.1007/BF01384313

[. Lee and E. A. Lee, Hierarchical concurrent finite state machines in ptolemy Concurrent models of computation for embedded software, Proceedings of ACSD'98 Computers and Digital Techniques, pp.34-40, 1998.

U. Kim-guldstrand-larsen, A. Nyman, and . Wasowski, Interface input/output automata, Proceedings of FM'06, pp.82-97, 2006.

U. Kim-guldstrand-larsen, A. Nyman, and . Wasowski, Modal I/O automata for interface and product line theories, Proceedings of ESOP'07, pp.64-79, 2007.

E. David and . Long, Model checking, abstraction and compositional reasoning, 1993.

[. Laneve and L. Padovani, The Must Preorder Revisited, Proceedings of CONCUR'07, pp.212-225, 2007.
DOI : 10.1007/978-3-540-74407-8_15

B. Kim-guldstrand-larsen, C. Steffen, and . Weise, A constraint oriented proof methodology based on modal transition systems, Proceedings of TACAS'95, pp.17-40, 1995.

[. Liskov and J. M. Wing, A behavioral notion of subtyping, ACM Transactions on Programming Languages and Systems, vol.16, issue.6
DOI : 10.1145/197320.197383

K. Larsen and L. Xinxin, Equation solving using modal transition systems, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.108-117, 1990.
DOI : 10.1109/LICS.1990.113738

. A. Edward, H. Lee, Y. Zheng, and . Zhou, Causality interfaces and compositional causality analysis, Proceedings of FIT'05, 2005.

P. Maier, A Set-Theoretic Framework for Assume-Guarantee Reasoning, Proceedings of ICALP'01, pp.821-834, 2001.
DOI : 10.1007/3-540-48224-5_67

P. Maier, Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete, Proceedings of FoSSaCS'03, pp.343-357
DOI : 10.1007/3-540-36576-1_22
URL : http://hdl.handle.net/11858/00-001M-0000-000F-2C93-6

P. Maier, A Lattice-Theoretic Framework for Circular Assume-Guarantee Reasoning, 2003.
DOI : 10.1007/3-540-48224-5_67
URL : http://hdl.handle.net/11858/00-001M-0000-000F-31E2-E

F. Maraninchi and T. Bouhadiba, 42, Proceedings of the 6th international conference on Generative programming and component engineering , GPCE '07, pp.53-62, 2007.
DOI : 10.1145/1289971.1289981
URL : https://hal.archives-ouvertes.fr/hal-00294153

J. Misra and K. M. Chandy, Proofs of Networks of Processes, IEEE Transactions on Software Engineering, vol.7, issue.4
DOI : 10.1109/TSE.1981.230844

L. Kenneth, L. Mcmillan-kenneth, and . Mcmillan, Symbolic Model Checking Circular compositional reasoning about liveness, Proceedings of CHARME'99, pp.342-345, 1993.

E. Mila, M. Majster-cederbaum, and . Martens, Compositional analysis of deadlockfreedom for tree-like component architectures, Proceedings of EMSOFT'08, pp.199-206, 2008.

B. Meyer and . Applying, Applying 'design by contract', Mil80] Robin Milner. A Calculus of Communicating Systems, pp.40-51, 1980.
DOI : 10.1109/2.161279

[. Milner, Calculi for synchrony and asynchrony, Theoretical Computer Science, vol.25, issue.3, pp.267-310, 1983.
DOI : 10.1016/0304-3975(83)90114-7
URL : http://doi.org/10.1016/0304-3975(83)90114-7

G. J. Milne, CIRCAL and the representation of communication, concurrency, and time, ACM Transactions on Programming Languages and Systems, vol.7, issue.2, pp.270-298, 1985.
DOI : 10.1145/3318.3322

[. Manna and A. Pnueli, How to cook a temporal proof system for your pet language, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '83, pp.141-154, 1983.
DOI : 10.1145/567067.567082

A. [. Manna and . Pnueli, The temporal logic of reactive and concurrent systems: Specification, 1991.
DOI : 10.1007/978-1-4612-0931-7

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, 1989.
DOI : 10.1109/5.24143

J. B. Orlin, Contentment in graph theory: Covering graphs with cliques, Indagationes Mathematicae (Proceedings), vol.80, issue.5, pp.406-424, 1977.
DOI : 10.1016/1385-7258(77)90055-5

[. Padovani, Contract-Directed Synthesis of Simple Orchestrators, Proceedings of CONCUR'08, pp.131-146, 2008.
DOI : 10.1007/978-3-540-85361-9_13

J. Antonio-pérez, R. Corchuelo, and M. Toro, An order-based algorithm for implementing multiparty synchronization. Concurrency -Practice and Experience, pp.1173-1206, 2004.

A. Pnueli and R. Rosner, On the synthesis of a reactive module, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.179-190, 1989.
DOI : 10.1145/75277.75293

A. Pnueli and R. Rosner, Distributed reactive systems are hard to synthesize, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.746-757, 1990.
DOI : 10.1109/FSCS.1990.89597

C. Prisacariu and G. Schneider, A Formal Language for Electronic Contracts, Proceedings of FMOODS'07, pp.174-189, 2007.
DOI : 10.1111/1467-9337.00106
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.7108

S. Quinton, I. Ben-hafaiedh, and S. Graf, From orchestration to choreography: Memoryless and distributed orchestrators, Proceedings of FLACOS'09, 2009.

S. Quinton and S. Graf, Contract-Based Verification of Hierarchical Systems of Components, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods, pp.377-381, 2008.
DOI : 10.1109/SEFM.2008.28

S. Quinton and S. Graf, A framework for contract-based reasoning: Motivation and application, Proceedings of FLACOS'08, pp.77-84, 2008.

S. Quinton, S. Graf, and R. Passerone, Contract-based reasoning for component systems with complex interactions, 2010.

J. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, Proceedings of Symposium on Programming'82, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

J. Raclet, Residual for Component Specifications, Electronic Notes in Theoretical Computer Science, vol.215
DOI : 10.1016/j.entcs.2008.06.023
URL : https://hal.archives-ouvertes.fr/inria-00141898

E. Jean-baptiste-raclet, A. Badouel, B. Benveniste, A. Caillaud, R. Legay et al., Modal interfaces: unifying interface automata and modal specifications, Proceedings of EMSOFT'09, pp.87-96, 2009.

E. Jean-baptiste-raclet, A. Badouel, B. Benveniste, R. Caillaud, and . Passerone, Why are modalities good for interface theories?, Proceedings of ACSD'09, pp.119-127, 2009.

J. H. Reif, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol.29, issue.2
DOI : 10.1016/0022-0000(84)90034-5

K. Rudie and S. L. Ricker, Know means no: Incorporating knowledge into discrete-event control systems, IEEE Transactions on Automatic Control, vol.45, issue.9, pp.1656-1668, 2000.

T. W. Reps, R. Sagiv, and . Wilhelm, Static program analysis via 3- valued logic, Proceedings of CAV'04, pp.15-30, 2004.
DOI : 10.1007/3-540-45789-5_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8519

W. [. Ramadge and . Wonham, Supervisory Control of a Class of Discrete Event Processes, SIAM Journal on Control and Optimization, vol.25, issue.1, pp.206-230, 1987.
DOI : 10.1137/0325013

K. Rudie and W. M. Wonham, Think globally, act locally: decentralized supervisory control, IEEE Transactions on Automatic Control, vol.37, issue.11, pp.1692-1708, 1992.
DOI : 10.1109/9.173140

J. Sifakis, A framework for component-based construction extended abstract, Proceedings of SEFM'05, pp.293-300, 2005.

[. Sinha, Automated Compositional Analysis for Checking Component Substitutability, 2007.

J. G. Thistle, Undecidability in decentralized supervision. System and Control Letters, pp.503-509, 2005.

W. Thomas, On the synthesis of strategies in infinite games, Proceedings of STACS'95, pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

[. Tripakis, B. Lickly, T. A. Henzinger, and E. A. Lee, On relational interfaces, Proceedings of the seventh ACM international conference on Embedded software, EMSOFT '09, pp.67-76, 2009.
DOI : 10.1145/1629335.1629346

T. Yoo and S. Lafortune, A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems, Discrete Event Dynamic Systems, vol.12, issue.3, pp.335-377, 2002.
DOI : 10.1007/978-1-4615-4493-7_11