Sökning: "Yi Wang"

Visar resultat 6 - 10 av 21 avhandlingar innehållade orden Yi Wang.

  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. Hierarchical Modeling and Analysis of Real Time Systems

    Författare :Alexandre David; Wang Yi; Purush Iyer; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science with specialization in Real Time Systems; Computer science; Datavetenskap;

    Sammanfattning : UPPAAL is a tool for model-checking real-time systems developed jointly by Uppsala University and Aalborg University. It has been applied successfully in case studies ranging from communication protocols to multimedia applications. The tool is designed to verify systems that can be modeled as networks of timed automata. LÄS MER

  5. 9. Practical verification of real-time systems

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

    Sammanfattning : Formal methods are becoming mature enough to be used on nontrivial examples. They are particularly well fitted for real-time systems whose correctness is defined in terms of correct responses at correct times. Most common real-time systems are of reasonable size and can therefore be handled by an automatic verification tool such as Uppaal. LÄS MER

  7. 10. Models and Complexity Results in Real-Time Scheduling Theory

    Författare :Pontus Ekberg; Wang Yi; Alberto Marchetti-Spaccamela; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Real-time systems; Scheduling theory; Task models; Computational complexity; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

    Sammanfattning : When designing real-time systems, we want to prove that they will satisfy given timing constraints at run time. The main objective of real-time scheduling theory is to analyze properties of mathematical models that capture the temporal behaviors of such systems. LÄS MER