Sökning: "datorteknik"

Visar resultat 6 - 10 av 431 avhandlingar innehållade ordet datorteknik.

  1. 6. Code synthesis for timed automata

    Författare :Tobias Amnell; Wang Yi; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : In this thesis, we study executable behaviours of timed models. The focus is on synthesis of executable code with predictable behaviours from high level abstract models. We assume that a timed system consists of two parts: the control software and the plant (i.e. LÄS MER

  3. 7. Efficient symbolic state exploration of timed systems : Theory and implementation

    Författare :Johan Bengtsson; Wang Yi; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : Timing aspects are important for the correctness of safety-critical systems. It is crucial that these aspects are carefully analysed in designing such systems. UPPAAL is a tool designed to automate the analysis process. LÄS MER

  4. 8. Methods for run time analysis of data locality

    Författare :Erik Berg; Erik Hagersten; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : The growing gap between processor clock speed and DRAM access time puts new demands on software and development tools. Deep memory hierarchies and high cache miss penalties in present and emerging computer systems make execution time sensitive to data locality. LÄS MER

  5. 9. Specification and Implementation of Distributed Real-Time Systems for Embedded Applications

    Författare :Lars Björnfot; Lars Asplund; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : .... LÄS MER

  7. 10. Regular Inference for Communication Protocol Entities

    Författare :Therese Bohlin; Bengt Jonsson; Dilian Gurov; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer engineering; Datorteknik;

    Sammanfattning : A way to create well-functioning computer systems is to automate error detection in the systems. Automated techniques for finding errors, such as testing and formal verification, requires a model of the system. The technique for constructing deterministic finite automata (DFA) models, without access to the source code, is called regular inference. LÄS MER