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

F. Arbab, G. Agha, O. Danvy, and J. Meseguer, Puff, The Magic Protocol, Lecture Notes in Computer Science, vol.7000, pp.169-206, 2011.
DOI : 10.1007/978-3-642-21464-6_13

F. Arbab and J. J. Rutten, A Coinductive Calculus of Component Connectors, Lecture Notes in Computer Science, vol.5, issue.1, pp.34-55, 2002.
DOI : 10.2140/pjm.1955.5.285

C. Baier, T. Blechmann, J. Klein, and S. Klüppelholz, A Uniform Framework for Modeling and Verifying Components and Connectors, 11th International Conference, pp.247-267978, 2009.
DOI : 10.1007/11767954_18

C. Baier, E. M. Clarke, V. Hartonas-garmhausen, M. Z. Kwiatkowska, and M. Ryan, Symbolic model checking for probabilistic processes, Automata, Languages and Programming, 24th International Colloquium, ICALP'97, pp.430-440, 1997.
DOI : 10.1007/3-540-63165-8_199

C. Baier, M. Sirjani, F. Arbab, and J. J. Rutten, Modeling component connectors in Reo by constraint automata, Science of Computer Programming, vol.61, issue.2, pp.75-113, 2006.
DOI : 10.1016/j.scico.2005.10.008

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

URL : http://www.paradise.caltech.edu/cns188/Handouts/Bryant86.pdf

J. R. Burch, E. M. Clarke, K. L. Mcmillan, D. L. Dill, and L. J. Hwang, Symbolic model checking: 10?20 states and beyond, Inf. Comput, vol.9892, issue.2, pp.142-1700890, 1992.
DOI : 10.1016/0890-5401(92)90017-a

URL : https://doi.org/10.1016/0890-5401(92)90017-a

D. Clarke, J. Proença, A. Lazovik, and F. Arbab, Channel-based coordination via constraint satisfaction, Science of Computer Programming, vol.76, issue.8, pp.681-710, 2011.
DOI : 10.1016/j.scico.2010.05.004

URL : https://doi.org/10.1016/j.scico.2010.05.004

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., All About Maude -A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, Lecture Notes in Computer Science, vol.4350, 2007.
DOI : 10.1016/s0304-3975(01)00359-0

URL : https://doi.org/10.1016/s0304-3975(01)00359-0

K. Dokter and F. Arbab, Treo: Textual syntax of reo connectors, Proc. of MeTRiD, 2018.

R. Ehlers, Minimising Deterministic B??chi Automata Precisely Using SAT Solving, 13th International Conference, pp.326-332978, 2010.
DOI : 10.1145/75277.75293

S. T. Jongmans, Automata-theoretic protocol programming, Centrum Wiskunde & Informatica (CWI), p.38223, 2016.

S. T. Jongmans and F. Arbab, Prdk: Protocol programming with automata Tools and Algorithms for the Construction and Analysis of Systems -22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016 Proceedings. Lecture Notes in Computer Science, vol.9636, pp.547-552978, 2016.

S. T. Jongmans and F. Arbab, Centralized coordination vs. partially-distributed coordination with Reo and constraint automata, Science of Computer Programming, vol.160, 2017.
DOI : 10.1016/j.scico.2017.06.004

S. T. Jongmans, S. Halle, and F. Arbab, Automata-based optimization of interaction protocols for scalable multicore platforms Coordination Models and Languages -16th IFIP WG 6, International Conference , COORDINATION 2014, Held as Part of the 9th International Federated Conferences on Distributed Computing Techniques, DisCoTec 2014, pp.65-82978, 2014.
DOI : 10.1007/978-3-662-43376-8_5

S. T. Jongmans, T. Kappé, and F. Arbab, Constraint automata with memory cells and their composition, Science of Computer Programming, vol.146, pp.50-86, 2017.
DOI : 10.1016/j.scico.2017.03.006

URL : https://ir.cwi.nl/pub/25710/SoCP9925.pdf

S. Kemper, Sat-based verification for timed component connectors, Sci. Comput. Program, vol.7778, pp.779-798, 2012.
DOI : 10.1016/j.entcs.2009.10.027

URL : https://doi.org/10.1016/j.entcs.2009.10.027

S. Klüppelholz, Verification of Branching-Time and Alternating-Time Properties for Exogenous Coordination Models, pp.4-8621, 2012.

M. Z. Kwiatkowska, G. Norman, J. Sproston, and F. Wang, Symbolic model checking for probabilistic timed automata, Information and Computation, vol.205, issue.7, pp.1027-1077, 2007.
DOI : 10.1016/j.ic.2007.01.004

URL : http://www.prismmodelchecker.org/papers/ic07.pdf

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

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-75789597, 1990.
DOI : 10.1109/FSCS.1990.89597

J. Proença, D. Clarke, E. P. De-vink, and F. Arbab, Dreams, Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, pp.1510-1515, 2012.
DOI : 10.1145/2245276.2232017

J. J. Rutten, Elements of Stream Calculus, Electronic Notes in Theoretical Computer Science, vol.45, issue.04, pp.358-423, 2001.
DOI : 10.1016/S1571-0661(04)80972-1

URL : https://doi.org/10.1016/s1571-0661(04)80972-1