Sökning: "Timed automata"

Visar resultat 1 - 5 av 37 avhandlingar innehållade orden Timed automata.

  1. 1. Learning of Timed Systems

    Författare :Olga Grinchtein; Bengt Jonsson; Oded Maler; Uppsala universitet; []
    Nyckelord :learning regular languages; timed systems; event-recording automata;

    Sammanfattning : Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. LÄS MER

  3. 2. 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

  4. 3. Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods

    Författare :Johann Deneux; Parosh Abdulla; Eugene Asarin; Uppsala universitet; []
    Nyckelord :Parameterized Systems; Timed Systems; Symbolic Model Checking; Forward Reachability; Acceleration; Robust Languages; Language Universality; Automata Minimization; Bisimulation;

    Sammanfattning : Software is finding its way into an increasing range of devices (phones, medical equipment, cars...). LÄS MER

  5. 4. Model Checking Parameterized Timed Systems

    Författare :Pritha Mahata; Parosh Abdulla; Jean-Francois Raskin; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Model Checking; Parameterized Systems; Undecidability; Timed Petri Nets; Timed Networks; Computer science; Datavetenskap;

    Sammanfattning : In recent years, there has been much advancement in the area of verification of infinite-state systems. A system can have an infinite state-space due to unbounded data structures such as counters, clocks, stacks, queues, etc. It may also be infinite-state due to parameterization, i.e. LÄS MER

  7. 5. Formal Verification of Adaptive Real-Time Systems by Extending Task Automata

    Författare :Leo Hatvani; Paul Pettersson; Cristina Seceleanu; Brian Nielsen; Mälardalens högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; formal verification; embedded systems; timed automata; scheduling; Computer Science; datavetenskap;

    Sammanfattning : Recently, we have seen an increase in the deployment of safety critical embedded systems in rapidly changing environments, as well as requirement for on-site customizations and rapid adaptation. To address the extended range of requirements, adaptation mechanism are added to the systems to handle large number of situations appropriately. LÄS MER