Fulltext

Analytic real-time analysis and timed automata: a hybrid methodology for the performance analysis of embedded real-time systems

Lampka, Kai ; Perathoner, Simon ; Thiele, Lothar

In: Design Automation for Embedded Systems, 2010, vol. 14, no. 3, p. 193-227

Ajouter à la liste personnelle
    Titre
    • Analytic real-time analysis and timed automata: a hybrid methodology for the performance analysis of embedded real-time systems
    Auteur
    • Lampka, Kai. Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland
    • Perathoner, Simon. Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland
    • Thiele, Lothar. Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland
    Type de document
    • Postprint
    Langue
    • Anglais
    Publié dans
    • Design Automation for Embedded Systems, 2010, vol. 14, no. 3, p. 193-227. Springer US; http://www.springer-ny.com
    Autre version électronique
    Identifiant OAI-PMH
    • oai:doc.rero.ch:309742
    Summary
    This paper presents a compositional and hybrid approach for the performance analysis of distributed real-time systems. The developed methodology abstracts system components by either flow-oriented and purely analytic descriptions or by state-based models in the form of timed automata. The interaction among the heterogeneous components is modeled by streams of discrete events. In total this yields a hybrid framework for the compositional analysis of embedded systems. It supplements contemporary techniques for the following reasons: (a) state space explosion as intrinsic to formal verification is limited to the level of isolated components; (b) computed performance metrics such as buffer sizes, delays and utilization rates are not overly pessimistic, because coarse-grained analytic models are used only for components that conform to the stateless model of computation. For demonstrating the usefulness of the presented ideas, a corresponding tool-chain has been implemented. It is used to investigate the performance of a two-staged computing system, where one stage exhibits state-dependent behavior that is only coarsely coverable by a purely analytic and stateless component abstraction. Finally, experiments are performed to ascertain the scalability and the accuracy of the proposed approach