000184998 001__ 184998
000184998 005__ 20181203040007.0
000184998 0247_ $$2doi$$a10.1145/1879021.1879052
000184998 037__ $$aCONF
000184998 245__ $$aModel-based implementation of real-time applications
000184998 269__ $$a2010
000184998 260__ $$c2010
000184998 336__ $$aConference Papers
000184998 520__ $$aCorrect and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on features of the execution platform, in particular its speed. Existing rigorous implementation techniques are applicable to specific classes of systems e.g. with periodic tasks, time deterministic systems. We present a general model-based implementation method for real-time systems based on the use of two models. &bull An abstract model representing the behavior of real-time software as a timed automaton. The latter describes user-defined platform-independent timing constraints. Its transitions are timeless and correspond to the execution of statements of the real-time software. &bull A physical model representing the behavior of the real-time software running on a given platform. It is obtained by assigning execution times to the transitions of the abstract model. A necessary condition for implementability is time-safety, that is, any (timed) execution sequence of the physical model is also an execution sequence of the abstract model. Time-safety simply means that the platform is fast enough to meet the timing requirements. As execution times of actions are not known exactly, time-safety is checked for worst-case execution times of actions by making an assumption of time-robustness: time-safety is preserved when speed of the execution platform increases. We show that as a rule, physical models are not time-robust and show that time-determinism is a sufficient condition for time-robustness. For given real-time software and execution platform corresponding to a time-robust model, we define an Execution Engine that coordinates the execution of the application software so as to meet its timing constraints. Furthermore, in case of non-robustness, the Execution Engine can detect violations of time-safety and stop execution.
000184998 6531_ $$aAbstracting
000184998 6531_ $$aAlgorithms
000184998 6531_ $$aComputer software selection and evaluation
000184998 6531_ $$aEmbedded 	systems
000184998 6531_ $$aModels
000184998 6531_ $$aProgram compilers
000184998 6531_ $$aTiming circuits
000184998 700__ $$aAbdellatif, Tesnim
000184998 700__ $$aCombaz, Jacques
000184998 700__ $$0246058$$aSifakis, Joseph$$g220186
000184998 7112_ $$aEmbedded Systems Week 2010 - Proceedings of the 10th ACM International 	Conference on Compilers, Architecture and Synthesis for Embedded 	Systems, EMSOFT'10$$cScottsdale, AZ, United states
000184998 773__ $$q229 - 238$$tEmbedded Systems Week 2010 - Proceedings of the 10th ACM International 	Conference on Compilers, Architecture and Synthesis for Embedded 	Systems, EMSOFT'10
000184998 8564_ $$s335912$$uhttps://infoscience.epfl.ch/record/184998/files/EMSOFT2010.pdf$$yn/a$$zn/a
000184998 909C0 $$0252413$$pRISD$$xU12523
000184998 909CO $$ooai:infoscience.tind.io:184998$$pconf$$pIC$$qGLOBAL_SET
000184998 937__ $$aEPFL-CONF-184998
000184998 970__ $$a20110113538631/RISD
000184998 973__ $$aOTHER$$rREVIEWED$$sPUBLISHED
000184998 980__ $$aCONF