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.

L. Carnevali, G. Lipari, A. Pinzuti, and E. Vicario, A formal approach to design and verification of two-level hierarchical scheduling systems, Reliable Software Technologies -Ada-Europe, pp.118-131, 2011.

R. Cruz and J. Proença, Reolive: Analysing connectors in your browser, Software Technologies: Applications and Foundations -STAF 2018 Collocated Workshops, vol.11176, pp.336-350, 2018.

L. De-alfaro, T. Henzinger, M. Broy, J. Grünbauer, and D. Harel, Interface-based design, Engineering Theories of Software Intensive Systems: Proceedings of the NATO Advanced Study Institute on Engineering Theories of Software Intensive Systems Marktoberdorf, pp.83-104, 2004.

C. Dietrich, M. Hoffmann, and D. Lohmann, Global optimization of fixed-priority real-time systems by rtos-aware control-flow analysis, ACM Trans. Embed. Comput. Syst, vol.16, issue.2, pp.1-35, 2017.

K. Dokter, S. S. Jongmans, and F. Arbab, Scheduling games for concurrent systems, Coordination Models and Languages, pp.84-100, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01631719

V. Ha, M. Rangarajan, D. Cofer, H. Rues, and B. Dutertre, Feature-based decomposition of inductive proofs applied to real-time avionics software: An experience report, Proceedings of the 26th International Conference on Software Engineering, 2004.

S. S. Jongmans, T. Kapp, and F. Arbab, Constraint automata with memory cells and their composition, Science of Computer Programming, vol.146, pp.50-86, 2015.

A. B. Kahn, Topological sorting of large networks, Commun. ACM, vol.5, issue.11, pp.558-562, 1962.

M. Kaminski and N. Francez, Finite-memory automata, Theor. Comput. Sci, vol.134, issue.2, pp.90242-90251, 1994.

N. Kokash, C. Krause, and E. P. De-vink, Reo + mCRL2: A framework for modelchecking dataflow in service compositions, FAC, vol.24, issue.2, pp.187-216, 2012.

A. Kurz, T. Suzuki, and E. Tuosto, On Nominal Regular Languages with Binders, Foundations of Software Science and Computational Structures, pp.255-269, 2012.

A. Nv, OpenComRTOS-Suite Manual and API Manual

J. Proença and A. Madeira, Taming hierarchical connectors, Fundamentals of Software Engineering -8th International Conference, FSEN 2019, 2019.

L. Schröder, D. Kozen, S. Milius, and T. Wißmann, Nominal Automata with Name Binding, Foundations of Software Science and Computation Structures -20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, pp.124-142, 2017.

E. Verhulst, R. T. Boute, J. M. Faria, B. H. Sputh, and V. Mezhuyev, Formal Development of a Network-Centric RTOS: software engineering for reliable embedded systems, 2011.