O. and U. Profile, Object Management Group, pp.2009-2020, 2009.

C. André, F. Mallet, and R. De-simone, Modeling Time(s), ACM-IEEE, pp.559-573, 2007.
DOI : 10.1007/978-3-540-75209-7_38

C. André, Syntax and semantics of the Clock Constraint Specification Language (CCSL), Research Report, vol.6925, 2009.

J. Deantoni and F. Mallet, TimeSquare: Treat Your Models with Logical Time, Lecture Notes in Computer Science, vol.7304, issue.50, pp.34-41, 2012.
DOI : 10.1007/978-3-642-30561-0_4
URL : https://hal.archives-ouvertes.fr/hal-00688590

F. Mallet, Automatic generation of observers from MARTE/CCSL, 2012 23rd IEEE International Symposium on Rapid System Prototyping (RSP), 2012.
DOI : 10.1109/RSP.2012.6380695
URL : https://hal.archives-ouvertes.fr/hal-00764066

F. Mallet, J. Millo, and R. De-simone, Safe CCSL specifications and marked graphs, 11th ACM/IEEE Int. Conf. on Formal Methods and Models for Codesign, pp.157-166, 2013.
DOI : 10.1007/978-3-642-41202-8_3
URL : https://hal.archives-ouvertes.fr/hal-00913962

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

A. Arnold, G. Point, A. Griffault, and A. Rauzy, The altarica formalism for describing concurrent systems, Fundam. Inform, vol.40, issue.2-3, pp.109-124, 1999.

G. Berry and L. Cosserat, The ESTEREL synchronous programming language and its mathematical semantics, Seminar on Concurrency, pp.389-448, 1984.
DOI : 10.1007/3-540-15670-4_19
URL : https://hal.archives-ouvertes.fr/inria-00076230

A. Benveniste, P. Caspi, S. A. Edwards, N. Halbwachs, P. Le-guernic et al., The synchronous languages 12 years later, Proceedings of the IEEE, vol.91, issue.1, pp.64-83, 2003.
DOI : 10.1109/JPROC.2002.805826

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

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

E. A. Lee and A. L. Sangiovanni-vincentelli, A framework for comparing models of computation, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.17, issue.12, pp.1217-1229, 1998.
DOI : 10.1109/43.736561

A. Benveniste, B. Caillaud, L. P. Carloni, P. Caspi, and A. L. Sangiovanni-vincentelli, Composing heterogeneous reactive systems, ACM Transactions on Embedded Computing Systems, vol.7, issue.4
DOI : 10.1145/1376804.1376811
URL : https://hal.archives-ouvertes.fr/inria-00555841

B. Combemale, J. Deantoni, M. V. Larsen, F. Mallet, O. Barais et al., Reifying Concurrency for Executable Metamodeling, Software Language Engineering -6th Int. Conf., SLE, pp.365-384, 2013.
DOI : 10.1007/978-3-319-02654-1_20
URL : https://hal.archives-ouvertes.fr/hal-00850770

L. G. Valiant and M. Paterson, Deterministic one-counter automata, Journal of Computer and System Sciences, vol.10, issue.3, pp.340-35010, 1975.
DOI : 10.1016/S0022-0000(75)80005-5
URL : http://dx.doi.org/10.1016/s0022-0000(75)80005-5

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Lecture Notes in Computer Science, vol.2725, pp.118-121, 2003.
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185

A. Finkel and G. Sutre, Decidability of Reachability Problems for Classes of Two Counters Automata, STACS 2000, 17th Annual Symp. on Theoretical Aspects of Computer Science, pp.346-357, 2000.
DOI : 10.1007/3-540-46541-3_29

J. Hopcroft and J. Pansiot, On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, vol.8, issue.2, pp.135-15910, 1979.
DOI : 10.1016/0304-3975(79)90041-0

S. Bardin, A. Finkel, and J. Leroux, FASTer Acceleration of Counter Automata in Practice, 10th Int. Conf., TACAS 2004, pp.576-590, 2004.
DOI : 10.1007/978-3-540-24730-2_42

R. Gascon, F. Mallet, and J. Deantoni, Logical Time and Temporal Logics: Comparing UML MARTE/CCSL and PSL, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning, pp.141-148, 2011.
DOI : 10.1109/TIME.2011.10
URL : https://hal.archives-ouvertes.fr/inria-00540738

L. Yin, F. Mallet, and J. Liu, Verification of MARTE/CCSL Time Requirements in Promela/SPIN, 2011 16th IEEE International Conference on Engineering of Complex Computer Systems, pp.65-74, 2011.
DOI : 10.1109/ICECCS.2011.14
URL : https://hal.archives-ouvertes.fr/hal-00650621

H. Yu, J. Talpin, L. Besnard, T. Gautier, H. Marchand et al., Polychronous controller synthesis from MARTE CCSL timing specifications, Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMPCODE2011), pp.21-30, 2011.
DOI : 10.1109/MEMCOD.2011.5970507
URL : https://hal.archives-ouvertes.fr/inria-00594942

J. Suryadevara, C. C. Seceleanu, F. Mallet, and P. Pettersson, Verifying MARTE/CCSL Mode Behaviors Using UPPAAL, Lecture Notes in Computer Science, vol.8137, pp.1-15, 2013.
DOI : 10.1007/978-3-642-40561-7_1
URL : https://hal.archives-ouvertes.fr/hal-00866477

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

A. Arnold, Finite transition systems -semantics of communicating systems, Int. Series in Computer Science, 1994.

T. Johnsson, Efficient compilation of lazy evaluation, SIGPLAN Symposium on Compiler Construction, pp.58-69, 1984.

P. H. Feiler and J. Hansson, Flow latency analysis with the architecture analysis and design language, 2007.

S. Of, Automotive Engineers, SAE Architecture Analysis and Design Language (AADL), document number, 2006.