>. <<, . <<, and . <<, dispatch of the task 43 >> << "start of the task 45 >> << "start of the task 10 >> << "dispatch of the task 90 >> << "start of the task 92 >> << "release resource 94 >> << "end of the taskdate", 100 >> << "lock resourcedate", 102 >> << "release resourceend of the tasklaxity", 50 >> << "dispatch of the taskdate", 125 >> << "dispatch of the taskdate", 125 >> << "dispatch of the task", "pl", "date", 125 >> << "dispatch of the task", "syst", "date", 125 >> << "start of the task", "syst", "date", 125 >> << "end of the task", "syst", "datelaxity", 75 >> << "start of the task", "pl", "date", 150 >> << "end of the tasklaxity", 57 >> << "dispatch of the taskdate", 168 >> << "dispatch of the task", "acc", "date", 168 >> << "start of the task", "pf", "date", 168 >> << "end of the tasklaxity", 45 >> << "start of the taskdate", 180 >> << "end of the tasklaxity", 10 >> << "dispatch of the taskdate", 215 >> << "start of the taskdate", 215 >> << "lock resourcedate", 217 >> << "release resourcedate", 219 >> << "end of the tasklaxity", 23 >> << "start of the taskdate", 225 >> << "lock resourcedate", 227 >> << "release resourcedate", 229 >> << "end of the taskdate", 233 >> << "end of the tasklaxity", 50 >> << "dispatch of the taskdate", 250 >> << "dispatch of the taskdate", 250 >> << "dispatch of the taskdate", 3 >> << "release resourcedate", 5 >> << "end of the tasklaxity", 0 >> << "dispatch of the task", "two", "date", 6 >> << "start of the task", "two", "date", 6 >> << "lock resource", "sd", "two", "date", 6 >> << "release resource >> << "end of the tasklaxity", 3 >> << "dispatch of the task", "one", "date", 10 >> << "start of the task", "one", "date", 10 >> << "lock resource, >> << "start of the task 75 >> << "start of the task 23 >> << "start of the task 104 >> << "end of the task 15 >> << "start of the task 15 >> << "start of the task 250 >> << "dispatch of the task >> << "dispatch of the task >> << "start of the task >> << "lock resource >> << "release resource >> << "end of the task 1 >> << "start of the task >> << "lock resource 10 >> << "dispatch of the task 12 >> << "release resource 13 >> << "end of the task >> << "start of the task 13 >> << "lock resource 13 >> << "release resource 15 >> << "end of the task 18 >> << "start of the task 18 >> << "lock resource 18 >> << "release resource 20 >> << "dispatch of the task 20 >> << "start of the task 20 >> << "lock resource 20 >> << "release resource 23 >> << "end of the task >> << "start of the task 23 >> << "end of the task >> << "dispatch of the task 24 >> << "start of the task 24 >> << "lock resource 26 >> << "end of the task 30 >> << "start of the task 30 >> << "lock resource 33 >> << "end of the task >> << "start of the task 35 >> << "end of the task 36 >> Dans la figure 6.5, on voit que la tâche one est activéè a la date 20, pp.30-30

A. D. Alors-que-la-tâche, . Mod-`-elemod-`-mod-`-ele, . De, and . Acceleo, Si on modifie notre système et que l'on déclare que la ressource est non protégée, \in Periodic |-> <%for (processImpl.subcomponents.threadSubcomponent){%> IF x = "<%name%>" THEN <%current().getWCET()%> ELSE<%}%> 0

=. {. Shareddata, Protected == {"<%processImpl.subcomponents.dataSubcomponent [current().getConcurrencyControlProtocol() == "Interrupt_Masking"].name.sep, p.sep

=. Writer and . Shareddata, -> <%for (processImpl.subcomponents.dataSubcomponent){%> IF x = "<%name%>" THEN {"<%getRootContainer().shdw(current().name).sep

=. Audsley and A. Burns, Real-Time System Scheduling, 1990.
DOI : 10.1007/978-3-642-79789-7_3

[. Abrial, The B-Book : Assigning programs to meanings, 1996.
DOI : 10.1017/CBO9780511624162

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

D. [. Alur and . Dill, Automata-theoretic verification of real-time systems. Formal Methods for Real-Time Computing, Trends in Software Series, pp.55-82, 1996.

P. Amey and B. Dobbing, High Integrity Ravenscar, 8th International Conference on Reliable Software Technologies ? Ada-Europe 2003 (AE03, 2003.
DOI : 10.1007/3-540-44947-7_4

E. Amnell, L. Fersman, P. Mokrushin, W. Pettersson, and . Yi, TIMES: A??Tool for Schedulability Analysis and Code Generation of Real-Time Systems, 1st International Workshop on Formal Modeling and Analysis of Timed Systems, 2003.
DOI : 10.1007/978-3-540-40903-8_6

[. Allen and D. Garlan, A formal basis for architectural connection, ACM Transactions on Software Engineering and Methodology, vol.6, issue.3, 1997.
DOI : 10.1145/258077.258078

URL : https://hal.archives-ouvertes.fr/hal-00444067

S. Sinan and . Alhir, UML in a Nutshell, 1998.

A. André, Systèmes de transitions finis et sémantique des processus communicants, 1992.

C. André, Representation and analysis of reactive behaviors : A synchronous approach, Proc. CESA 201996, 1996.

A. Benveniste, G. Berry-barras, S. Boutin, C. Cornes, J. Courant et al., The Coq Proof Assistant Reference Manual ? Version V6.1 The synchronous languages 12 years later From synchrony to asynchrony The ESTEREL synchronous programming language : design, semantics, implementation towards validated real-time software Process algebra A Tutorial Introduction to PVS Dssa-adage : An environment for architecture-based avionics development First experiments using the UML profile for MARTE, Readings in hardwarecoq.inria.fr. [BCE + 03] International Conference on Concurrency Theory 12 th Euromicro Conference on Real-Time Systems Workshop on Industrial-Strength Formal Specification Techniques Proc. AGARD, 1993. [DTA + 08] Sébastien Demathieu ISORC '08 : Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (ISORC), pp.147-15964, 1990.

]. E. Eme90 and . Emerson, Temporal and modal logic, Handbook of Theoretical Computer Science, pp.995-1072, 1990.

H. Peter and . Feiler, Efficient embedded runtime systems through port communication optimization, ICECCS '08 : Proceedings of the 13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008), pp.294-300, 2008.

H. Peter, D. P. Feiler, J. J. Gluch, B. A. Hudak, and . Lewis, Pattern-based analysis of an embedded real-time system architecture, Architecture Description Languages, pp.51-65, 2005.

[. França, J. Rolland, J. Bodeveix, and M. Filali, Assessment of AADL's behavioral annex, FAC Formalisation des Activités ConcurrentesfSS91] European Cooperation for Space Standardization. Software engineering standards, 1991.

[. Garlan, R. Allen, and J. Ockerbloom, Exploiting style in architectural design environments, Proceedings of SIGSOFT'94 : The Second ACM SIGSOFT Symposium on the Foundations of Software Engineering, 1994.

P. L. Paul-le-guernic, J. Guernic, J. Pierre-talpin, J. C. Pierre-talpin, L. Lann et al., POLYCHRONY for System Design, Journal of Circuits, Systems and Computers, vol.12, issue.03, 2003.
DOI : 10.1142/S0218126603000763

T. [. Gordon and . Melham, Introduction to HOL, 1994.

[. Garlan, R. T. Monroe, and D. Wile, Acme, CASCON First Decade High Impact Papers on, CASCON '10, pp.47-68, 2000.
DOI : 10.1145/1925805.1925814

D. Garlan and M. Shaw, AN INTRODUCTION TO SOFTWARE ARCHITECTURE, Advances in Software Engineering and Knowledge Engineering, pp.1-39, 1993.
DOI : 10.1142/9789812798039_0001

A. Ghosal, A. Sangiovanni-vincentelli, C. M. Kirsch, T. A. Henzinger, and D. Iercan, A hierarchical coordination language for interacting real-time tasks, Proceedings of the 6th ACM & IEEE International conference on Embedded software , EMSOFT '06, pp.132-141, 2006.
DOI : 10.1145/1176887.1176907

[. Harel, Statecharts: a visual formalism for complex systems, Science of Computer Programming, vol.8, issue.3, pp.231-274, 1987.
DOI : 10.1016/0167-6423(87)90035-9

P. [. Halbwachs, P. Caspi, D. Raymond, and . Pilaud, The synchronous data flow programming language LUSTRE, Proceedings of the IEEE, pp.1305-1320, 1991.
DOI : 10.1109/5.97300

A. Thomas, B. Henzinger, C. M. Horowitz, and . Kirsch, Giotto : a time-triggered language for embedded programming, 2001.

A. Thomas, C. M. Henzinger, and . Kirsch, The embedded machine : predictable, portable real-time code, PLDI '02 : Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp.315-326, 2002.

A. Thomas, X. Henzinger, J. Nicollin, S. Sifakis, and . Yovine, Symbolic model checking for real-time systems, Information and Computation, vol.111, pp.394-406, 1994.

]. C. Hoa78 and . Hoare, Communicating sequential processes, Communications of the ACM, vol.21, pp.666-677, 1978.

A. [. Harel and . Pnueli, On the development of reactive systems . Logics and models of concurrent systems, pp.477-498, 1985.

N. Halbwachs and P. Raymond, Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing, Asian Computing Science Conference, pp.1-12, 1999.
DOI : 10.1007/3-540-46674-6_1

J. Hugues, B. Zalila, L. Pautet, and F. Kordon, From the prototype to the final embedded system using the Ocarina AADL tool suite, Trans. on Embedded Computing Sys, vol.7, issue.4, pp.1-25, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01175916

[. Izerrouken, X. Thirioux, M. Pantel, and M. Strecker, Certifying an Automated Code Generator Using Formal Tools : Preliminary Experiments in the GeneAuto Project, European Congress on Embedded Real-Time Software (ERTS), p.page, 2008.

H. Mark, T. Klein, B. Ralya, R. Pollak, M. Obenza et al., A practitioner's handbook for real-time analysis, 1993.

L. Lamport, The Windows Win32 threads API specification, 1996.

L. Lamport, Specifying Systems :The TLA+ Language and Tools for Hardware and Software Engineers, 2002.

L. Lamport, Real time is really simple, 2005.

[. Luc, T. Dave, and P. Luc, Architecture dynamique des logiciels enfouis, 2006.

T. [. Leguernic, M. L. Gautier, C. L. Borgne, and . Maire, Programming real-time applications with SIGNAL, Proceedings of the IEEE, pp.1321-1336, 1991.
DOI : 10.1109/5.97301

C. David, J. J. Luckham, L. M. Kenney, J. Augustin, D. Vera et al., Specification and analysis of system architecture using Rapide, IEEE Trans. Softw. Eng, vol.21, issue.4, pp.336-355, 1995.

J. [. Liu and . Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM, vol.20, issue.1, pp.46-61, 1973.
DOI : 10.1145/321738.321743

[. Lee, F. Mallet, R. , and S. , Dealing with aadl end-to-end flow latency with uml marte, ICECCS '08 : Proceedings of the 13th IEEE International Conference on Engineering of Complex Computer Systems, pp.228-233, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00371400

K. G. Larsen, P. Pettersson, and W. Yi, Model-checking for real-time systems, Proc. of Fundamentals of Computation Theory, number 965 in Lecture Notes in Computer Science, pp.62-88, 1995.
DOI : 10.1007/3-540-60249-6_41

]. F. Mar91 and . Maraninchi, The Argos language : graphical representation of automata and description of reactive systems, IEEE Workshop on Visual Languages, 1991.

N. [. Magee, S. Dulay, J. Eisenbach, and . Kramer, Specifying distributed software architectures, Proc. 5th European Software Engineering Conf. (ESEC 95, pp.137-153, 1995.
DOI : 10.1007/3-540-60406-5_12

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.7933

]. J. Mon00 and . Monin, Introduction aux méthodes formelles. Hermès, 2000.

[. Medvidovic, P. Oreizy, J. E. Robbins, and R. N. Taylor, Using object-oriented typing to support architectural design in the C2 style, ACM SIGSOFT Software Engineering Notes, vol.21, issue.6, pp.24-32, 1996.
DOI : 10.1145/250707.239106

[. Moriconi, X. Qian, and R. A. Riemenschneider, Correct architecture refinement, IEEE Transactions on Software Engineering, vol.21, issue.4, pp.356-372, 1995.
DOI : 10.1109/32.385972

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.9620

F. Maraninchi and Y. Rémond, Mode-automata: About modes and states for reactive systems, Lecture Notes in Computer Science, vol.1381, pp.185-200, 1998.
DOI : 10.1007/BFb0053571

[. Medvidovic and R. N. Taylor, A framework for classifying and comparing architecture description languages, Proceedings of the Sixth European Software Engineering Conference (ESEC/FSE 97), pp.60-76, 1997.

[. Omg, Unified Modeling Language V2, 2007.

. Osa and . Osate, Open source aadl tool environment

J. Rolland, J. Bodeveix, D. Chemouil, M. Filali, D. Rolland et al., Towards a formal semantics for AADL execution model AADL modes for space software, European Congress on Embedded Real-Time Software (ERTS) Data Systems In Aerospace (DASIA), Palma de Majorca-Spain, p.page (electronic medium, 2007.

J. Jean-françois-rolland, M. Bodeveix, D. Filali, T. Chemouil, and . Dave, Modes in asynchronous systems, 13th IEEE International Conference on Engineering Complex Computer Systems Belfast Ireland, p.page, 2008.

J. Real, A. Rolland, T. Dave, D. Chemouilrug07, ]. A. Rugina-[-sc85-]-a et al., Utilisation d'AADL pour la conception de logiciels de vol satellite Dependability modeling and evaluation -From AADL to stochastic Petri nets The complexity of propositional linear temporal logics Abstractions for software architecture and tools to support them. Software Engineering Cheddar : a flexible real time scheduling framework [Spa] The Spacify project. Model-driven engineering and formal methods for critical embedded softwareSpb] The Spices projetc The Z notation : a reference manual, Génie Logiciel J. ACM IEEE Transactions on Ada Lett, vol.26, issue.2144, pp.161-19741, 1985.

[. Sha, R. Rajkumar, and J. P. Lehoczky, Priority inheritance protocols: an approach to real-time synchronization, IEEE Transactions on Computers, vol.39, issue.9, pp.1175-1185, 1990.
DOI : 10.1109/12.57058

J. A. Stankovic, M. Spuri, M. D. Natale, and G. C. Buttazzo, Implications of classical scheduling results for real-time systems, Computer, vol.28, issue.6, pp.16-25, 1995.
DOI : 10.1109/2.386982

[. Tindell, A. Burns, and A. J. Wellings, Mode changes in priority pre-emptively scheduled systems in open-source for critical applications and systems development, IEEE Real-Time Systems Symposium, pp.100-109, 1992.

]. S. Ves98 and . Vestal, MetaH User's Manual. Honewell Technology Drive, 1998.

A. Wellings, Concurrent and Real-Time Programming in Java, 2004.